## Modeling and Verification of a Real Life Protocol Using Symbolic Model Checking (1994)

Venue: | Computer Aided Verification, volume 818 of Lecture |

Citations: | 6 - 0 self |

### BibTeX

@INPROCEEDINGS{Naik94modelingand,

author = {Vivek G. Naik and A. P. Sistla},

title = {Modeling and Verification of a Real Life Protocol Using Symbolic Model Checking},

booktitle = {Computer Aided Verification, volume 818 of Lecture},

year = {1994},

pages = {194--206},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

this paper, we show how symbolic modelchecking has been used to verify a real life protocol. Specifically, we have used SMV tool to model and verify IEEE 802.3 Etherenet CSMA/CD protocol with minimal abstraction. The Ethernet CSMA/CD protocol is a protocol that allows a set of computer systems connected over a local area network to communicate with each other. The major steps involved in using the SMV system for verification of the protocol were to correctly identify the processes within the protocol, to model them in the SMV toolkit, and to specify and verify the required properties of the protocol. Some design issues while modeling such a protocol are also dealt with in the research. We have verified the protocol under the asynchronous and synchronous models. The major problems encountered in using the SMV system were in modeling of the following aspects associated with the protocol: the channel, collision detection and carrier sensing, delay modeling (delay is used in successive attempts after a collision using the exponential backoff approach) and synchronization of transmitters and receivers. We first modeled the protocol at much detail and checked the properties. Under these two models, we used progressive abstraction to reduce the number of variables in each transmitter and receiver, and thus reduce the time taken for modelchecking. We have verified many properties for different stations, for various values for different values of maximum number attempts and frame sizes. This paper describes the appraoches employed in the verification purpose. The paper is organized as follows. Section 2 briefly describes the SMV system and

### Citations

1246 | Automatic verification of finite-state concurrent systems using temporal logic specifications
- Clarke, Emerson, et al.
- 1986
(Show Context)
Citation Context ...Introduction As the computing systems have grown in size and complexity it has become necessary to develop automated methods for checking the correctness of such systems. Temporal logic modelchecking =-=[2]-=- is one of such automated methods for verifying properties of finite state systems. The practical applicability of the original modelchecking system was limited due to the state explosion problem. Rec... |

1145 |
Computer Networks
- Tanenbaum
- 2002
(Show Context)
Citation Context ... is modeled as a timed transition system with upper and lower bounds on each transition. This specification is much clearer and more readable than the informal specification of Ethernet in IEEE 802.3 =-=[10, 4, 9]-=-. We use this as the basis in our verification. The various processes at each station and the data flow between these processes is given in figure 1. Each process performs a particular function. The a... |

547 |
Symbolic Model Checking: An Approach to the State Explosion Problem
- McMillan
- 1992
(Show Context)
Citation Context ... the state explosion problem. Recently many techniques have been developed to overcome the state explosion problem. One of the methods that has been finding much application is symbolic modelchecking =-=[1, 8, 3, 6]-=-. The symbolic modelchecking approach, implemented as the SMV system, uses BDDs for symbolically representing sets of states and the transition relation. This approach allowed the possibility of handl... |

326 |
Symbolic Model Checking: 10 States and Beyond
- Burch, Clarke, et al.
- 1992
(Show Context)
Citation Context ... the state explosion problem. Recently many techniques have been developed to overcome the state explosion problem. One of the methods that has been finding much application is symbolic modelchecking =-=[1, 8, 3, 6]-=-. The symbolic modelchecking approach, implemented as the SMV system, uses BDDs for symbolically representing sets of states and the transition relation. This approach allowed the possibility of handl... |

247 | Checking that Finite State Concurrent Programs Satisfy their Specifica- tions - Lichtenstein - 1985 |

96 |
The OSI reference model
- JD, Zimmermann
(Show Context)
Citation Context ... is modeled as a timed transition system with upper and lower bounds on each transition. This specification is much clearer and more readable than the informal specification of Ethernet in IEEE 802.3 =-=[10, 4, 9]-=-. We use this as the basis in our verification. The various processes at each station and the data flow between these processes is given in figure 1. Each process performs a particular function. The a... |

80 | The SMV System
- McMillan
- 1992
(Show Context)
Citation Context ... provides for a hierarchical description of the system. The data types available are Booleans, scalars and fixed arrays. The language allows a parallel assignment syntax. The reader is refered to the =-=[7]-=- for a detailed description of SMV. 3 Ethernet Protocol 3.1 Informal Description Modern Computer Networks are designed in a highly structured way. A seven layered model was proposed by the Internation... |

28 |
Formal verification of the encore gigamax cache consistency protocols
- McMillan, S
- 1991
(Show Context)
Citation Context ... the state explosion problem. Recently many techniques have been developed to overcome the state explosion problem. One of the methods that has been finding much application is symbolic modelchecking =-=[1, 8, 3, 6]-=-. The symbolic modelchecking approach, implemented as the SMV system, uses BDDs for symbolically representing sets of states and the transition relation. This approach allowed the possibility of handl... |

8 |
Automatic verification of sequential circuit designs
- Clarke, Burch, et al.
(Show Context)
Citation Context |

7 |
Timed ethernet: Real-time formal specification of ethernet
- Weinberg, Zuck
- 1992
(Show Context)
Citation Context ...fy for the checksum and then send the acknowledgement frame if the data received is error free. 3.2 Formal Specification of the protocol A formal specification of the Ethernet protocol is given in in =-=[11]-=-. In this model each station consists of a set of processes communicating through shared variables. Each process is modeled as a timed transition system with upper and lower bounds on each transition.... |

1 |
Information Processing Systems- Local Area Networks- Part3: Carrier sense multiple access with collision detection (CSMA/CD) access method and physical layer specifications
- std
- 1991
(Show Context)
Citation Context ... is modeled as a timed transition system with upper and lower bounds on each transition. This specification is much clearer and more readable than the informal specification of Ethernet in IEEE 802.3 =-=[10, 4, 9]-=-. We use this as the basis in our verification. The various processes at each station and the data flow between these processes is given in figure 1. Each process performs a particular function. The a... |