Abstract:
Abstract. Communication protocols pose interesting and difficult challenges for verification technologies. The state spaces of interesting protocols are either infinite or too large for finite-state verification techniques like model checking and state exploration. Theorem proving is also not effective since the formal correctness proofs of these protocols can be long and complicated. We describe a series of protocol verification experiments culminating in a methodology where theorem proving is used to abstract out the sources of unboundedness in the protocol to yield a skeletal protocol that can be verified using model checking. Our experiments focus on the Philips bounded retransmission protocol originally studied by Groote and van de Pol and by Helmink, Sellink, and Vaandrager. First, a scaled-down version of the protocol is analyzed using the MurOE state exploration tool as a debugging aid and then translated into the PVS specification language. The PVS verification of the generalized protocol illustrates the difficulty of using theorem proving to
Citations
|
1128
|
Symbolic Model Checking
– McMillan
- 1992
|
|
737
|
The temporal logic of actions
– Lamport
- 1994
|
|
714
|
Design and Validation of Computer Protocols
– Holzmann
- 1991
|
|
693
|
Parallel Program Design { A Foundation
– Chandy, Misra
- 1988
|
|
548
|
Model Checking and Abstraction
– Clarke, Grumberg, et al.
|
|
389
|
PVS: A prototype verification system
– Owre, Rushby, et al.
- 1992
|
|
329
|
Hierarchical correctness proofs for distributed algorithms
– Lynch, Tuttle
- 1987
|
|
206
|
C.: HOL: A proof generating system for Higher-Order Logic
– Gordon
- 1988
|
|
199
|
Abstract interpretation of reactive systems
– Dams, Gerth, et al.
- 1997
|
|
146
|
A Note on Reliable Full-Duplex Transmission over Half-Duplex Links
– Bartlett, Scantlebury, et al.
- 1969
|
|
115
|
Property Preserving Abstractions for the Verification of Concurrent Systems
– Loiseaux, Graf, et al.
- 1995
|
|
86
|
An integration of model-checking with automated proof checking
– Rajan, Shankar, et al.
- 1995
|
|
66
|
Protocol Verification via Projections
– Lam, Shankar
- 1984
|
|
61
|
Proof-checking a data link protocol
– Helmink, Sellink, et al.
- 1993
|
|
46
|
Combining model checking and deduction for I/Oautomata
– Muller, Nipkow
- 1995
|
|
43
|
Effective theorem proving for hardware verification
– Cyrluk, Rajan, et al.
- 1994
|
|
28
|
de Pol. A bounded retransmission protocol for large data packets
– Groote, van
- 1993
|
|
24
|
The Coq proof assistant reference manual, version 5.10
– Cornes, Courant, et al.
- 1995
|
|
6
|
The Formal Verification of Hard Real-Time Systems
– Cardell-Oliver
- 1992
|
|
2
|
Murphi annotated reference manual, version
– Melton, Dill, et al.
|
|
