Download:
|
by Jan Friso Groote, Jaco Van De Pol
http://www.win.tue.nl/cs/tt/jaco/papers/brp.ps.Z
Add To MetaCart
Abstract:
A protocol is described for the transmission of large data packets over unreliable channels. The protocol splits each data packet and broadcasts it in parts. In case of failure of transmission, only a limited number of retries are allowed (bounded retransmission), hence the protocol may give up the delivery of a part of the packet. Both the sending and the receiving client are informed adequately. This protocol is used in one of Philips ' products. We used ��CRL as formal framework, a combination of process algebra and abstract data types. The protocol and its external behaviour are specified in ��CRL. The correspondence between these is shown using the proof theory of ��CRL. The whole proof of this correspondence has been computer checked using the proof checker Coq. This provides an example showing that proof checking of realistic protocols is feasible within the setting of process algebras. 1
Citations
|
2860
|
Communication and Concurrency
– Milner
- 1989
|
|
190
|
unknown title
– ISO
- 1989
|
|
112
|
The syntax and semantics of CRL
– Groote, Ponse
- 1994
|
|
98
|
Process Algebra. Cambridge tracts in theoretical computer science 18
– Baeten, Weijland
- 1990
|
|
62
|
Proof-checking a data link protocol
– Helmink, Sellink, et al.
- 1994
|
|
58
|
The Coq proof assistant user's guide. Version 5.8
– Dowek, Felty, et al.
- 1993
|
|
50
|
A Process Specification Formalism
– Mauw, Veltink
- 1990
|
|
49
|
Proof theory for CRL: A language for processes with data
– Groote, Ponse
- 1994
|
|
43
|
Invariants in process algebra with data
– Bezem, Groote
- 1994
|
|
19
|
A computer-checked verification of Milner's Scheduler
– Korver, Springintveld
- 1994
|
|
17
|
Verifying process algebra proofs in type theory
– Sellink
- 1993
|
|
16
|
Proof theory for ��CRL
– Groote, Ponse
- 1991
|
|
15
|
A formal verification of the alternating bit protocol in the calculus of constructions
– Bezem, Groote
- 1993
|
|
15
|
A correctness proof of a one-bit sliding window protocol in ��CRL
– Bezem, Groote
- 1994
|
|
14
|
A correctness proof of a One Bit Sliding Window Protocol in CRL
– Bezem, Groote
- 1994
|
|
14
|
Correctness proof of the bakery protocol in CRL
– Groote, Korver
- 1994
|
|
13
|
Formalizing process algebraic verifications in the calculus of constructions
– Bezem, Bol, et al.
- 1997
|
|
7
|
CRL: A base for analysing processes with data
– Groote, Ponse
- 1991
|
|
6
|
A correctness proof of the bakery protocol
– Groote, Korver
- 1992
|
|
6
|
Computer-Aided Verification of Protocols, The Type Theoretic Approach
– Sellink
- 1996
|
|
1
|
A computer checked formal verification of Milner's scheduler
– Korver, Springintveld
- 1993
|
|
1
|
Experiments in theorem priving and model checking for protocol verification. Obtainable via http://www.csl.sri.com/��shankar/shankar.html
– Havelund, Shankar
- 1995
|
