Nederlands
Contact
Sitemap
Search
OrganisationEEMCS EPrints Service
 |
|
|
||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||
|
|
Badban, B. and Fokkink, W.J. and van de Pol, J.C.
(2008)
Mechanical Verification of a Two-Way Sliding Window Protocol (Full version including proofs).
Technical Report TR-CTIT-08-45,
Centre for Telematics and Information Technology University of Twente, Enschede.
ISSN 1381-3625
Full text available as:
 AbstractWe prove the correctness of a two-way sliding window protocol with piggybacking, where the acknowledgments of the latest received data are attached to the next data transmitted back into the channel. The window size of both parties are considered to be finite, though they can be of different sizes. We show that this protocol is equivalent (branching bisimilar) to a pair of FIFO queues of finite capacities. The protocol is first modeled and manually proved for its correctness in the process algebraic language of muCRL. We use the theorem prover PVS to formalize and to mechanically prove the correctness. This implies both safety and liveness (under the assumption of fairness).
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
|
|
||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||
