Verifying protocols by model checking: a case study of the wireless application protocol and the model checker SPIN

  title={Verifying protocols by model checking: a case study of the wireless application protocol and the model checker SPIN},
  author={Yu-Tong He and Ryszard Janicki},
This paper deals with a formal verification of protocols, where the model checking approach is applied. As a case example, the Wireless Application Protocol (WAP Version 2.0) and the SPIN model checker are used. The paper concentrates on the Transaction Layer, in which some defects have been uncovered and proper corrections have been proposed. 

Figures and Tables from this paper

Modeling and Formally Verifying a Safety-Critical System Through MCRL2

  • Ram Chandra BhushanD. Yadav
  • Computer Science
    2018 8th International Conference on Cloud Computing, Data Science & Engineering (Confluence)
  • 2018
One of the main safety requirements of the level-crossing control system is that a train and a car should never be inside the crossing at the same time, which is verified in this paper by comparing the number of cars entered into the crossing and number of vehicles left from the crossing through modeling.

Using SPIN and Eclipse for Optimized High-Level Modeling and Analysis of Computer Network Attack Models

This work proposes a SPIN based approach for formal modeling and analysis of advanced attack sequences were protocol and network level aspects matter simultaneously and through integration of the compiler and SPIN into the Eclipse platform both model development and analysis are facilitated.

Integrating Module Checking and Deduction in a Formal Proof for the Perlman Spanning Tree Protocol (STP)

This paper gives a formal proof for correctness of the STP algorithm by showing that finally a single node is selected as the root of the tree and the loops are eliminated correctly.

Analysis of a Session-Layer Protocol in mCRL2

The analysis of an industrial implementation of the session-layer of a load-balancing software system used for distribution of the print jobs among several document processors (workers) significantly improved the quality of this real-life system.

Using Model Checking to Analyze the System Behavior of the LHC Production Grid

This paper reverse engineered two critical and related DIRAC subsystems, and subsequently modeled their behavior with the mCRL2 toolset, and formalized and verified several behavioral properties of the two modeled subsystems.

Log Differencing using State Machines for Anomaly Detection

This project aims the identifications of unexpected executions of the software and the determination of the root cause behind them, which required the modification of the aforementioned algorithm to not only align two sequences, but a sequence with a tree structured model.

Correctness of fault-tolerant cluster-based beacon vector routing for ad hoc networks

  • Luke DemoracskiD. Avresky
  • Computer Science
    WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005.
  • 2005
Correctness is proven for a new clustering method and fault-tolerant routing approach to beacon vector routing that improves significantly the percentage of successful packet transmission attempts, and reduces flooding in the network, in the presence of multiple simultaneous faults.

Bringing Model Checking Closer To Practical Software Engineering



The Model Checker SPIN

  • G. Holzmann
  • Computer Science
    IEEE Trans. Software Eng.
  • 1997
An overview of the design and structure of the verifier, its theoretical foundation, and an overview of significant practical applications are given.

Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools

It is contention that the i-protocol makes for a particularly compelling case study in protocol verification and for a formidable benchmark of verification-tool performance, for the following reasons.

Creating implementations from Promela models

This contribution consists of an extension to SPIN which allows the creation of implementations from PROMELA speci cations which can be used for thecreation of test scenarios and the rapid prototyping of validated protocol implementations.

Towards effective model checking

This dissertation describes research into the effective application of model checkers, smart computer programs which can be used to find errors in (the designs of) systems.

Patterns in property specifications for finite-state verification

A survey of available specifications found that most are instances of the proposed pattern-based approach to the presentation, codification and reuse of property specifications for finite-state verification.

Design and validation of computer protocols

Part 1 Basic: introduction protocol structure error control flow control and design tools: a protocol simulator a protocol validator using the validator.

Symbolic Model Checking: 10^20 States and Beyond

Structure of Concurrency

On a formal semantics of tabular expressions

Verification of the WAP Transaction Layer using Coloured Petri Nets