Download:
by Xingyuan Zhang, Xiren Xie, Mark Harman, Lin Hu
http://www.dur.ac.uk/malcolm.munro/papers/docs/ICCT-2003.pdf
Add To MetaCart
Abstract:
Abstract — In this paper, an approach is proposed to verify communication protocol using the type theoretical proof assistant Coq. Compared with existing methods of protocol verification, this approach is based directly on the simple notion of event trace. Without the burden of embedding external concurrent languages such as process algebra, finite state machine, temporal logic, etc., this approach leads to very efficient reasoning. The approach is deliberately designed to exploit the computational mechanism intrinsic to type theory so that many cases can be proved automatically by computation. Because of these advantages, even non-trivial protocols can be verified within reasonable cost. This paper shows that both safeness and liveness can be formalized and verified using only finite event traces. A simplified version of the sliding window protocol is used to illustrate the approach. All the results presented in this paper have been mechanically checked in Coq. The relevant Coq scripts are accessible through Internet.
Citations
|
2762
|
R.: Communication and Concurrency
– Milner
- 1989
|
|
2677
|
Communicating Sequential Processes
– Hoare
- 1978
|
|
1345
|
A.: The Temporal Logic of Reactive and Concurrent Systems
– Manna, Pnueli
- 1992
|
|
714
|
Design and Validation of Computer Protocols
– Holzmann
- 1991
|
|
693
|
Parallel Program Design { A Foundation
– Chandy, Misra
- 1988
|
|
381
|
M.: An Introduction to Input/Output automata
– Lynch, Tuttle
- 1989
|
|
368
|
The Existence of Refinement Mappings
– Abadi, Lamport
- 1991
|
|
356
|
Symbolic Model Checking: 1020 States and Beyond
– Burch, Clarke, et al.
- 1990
|
|
247
|
Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications
– Clarke, Emerson, et al.
- 1986
|
|
146
|
Statecharts: A Visual Approach to Complex Systems
– Harel
- 1987
|
|
142
|
Proving properties of security protocols by induction
– Paulson
- 1997
|
|
24
|
The Coq proof assistant reference manual, version 5.10
– Cornes, Courant, et al.
- 1995
|
|
15
|
A formal verification of the alternating bit protocol in the calculus of constructions
– Bezem, Groote
- 1993
|
|
10
|
Coinductive Types in Coq: An Experiment with the Alternating Bit Protocol. Ecole Normale Supérieure de Lyon
– Giménez
- 1995
|
|
9
|
A Stepwise Refinement Heuristic for Protocol Construction
– Shankar, Lam
- 1987
|
|
5
|
Verification of a Reliable Net Protocol
– Yodaiken, Ramamritham
- 1992
|
|
4
|
The Coq proof assistant, A tutorial, version 5.10
– Huet, Kahn, et al.
- 1995
|
|
3
|
Spies: Summary of Case Studies
– Broy, Breitling, et al.
- 1997
|
|
1
|
The Temporal Logic of Actions,” Digital Equipment
– Lamport
- 1991
|
|
1
|
A tutorial on recursive types in Coq,” Inria, Institut National de Recherche en Informatique et en Automatique
– Gimenez
- 1998
|
