Verification of a sliding window protocol in μCRL and PVS

Authors:
Bahareh Badban;Wan Fokkink;Jan Friso Groote;Jun Pang;Jaco van de Pol
Affiliations:
Department of Software Engineering, CWI, PO Box 94079, 1090, Amsterdam, GB, The Netherlands;Department of Software Engineering, CWI, PO Box 94079, 1090, Amsterdam, GB, The Netherlands and Department of Theoretical Computer Science, Vrije Universiteit Amsterdam, PO Box 513, De Boelelaan 1 ...;Department of Software Engineering, CWI, PO Box 94079, 1090, Amsterdam, GB, The Netherlands and Department of Computer Science, Eindhoven University of Technology PO Box 513, 5600, MB, Eindhoven, ...;École Polytechnique, INRIA Futurs and LIX, PO Box 94079, Rue de Saclay, 91128, Palaiseau Cedex, GB, France;Department of Software Engineering, CWI, PO Box 94079, 1090, Amsterdam, GB, The Netherlands and Department of Computer Science, Eindhoven University of Technology PO Box 513, 5600, MB, Eindhoven, ...
Venue:
Formal Aspects of Computing
Year:
2005

Citing 0
Cited 12

Cones and foci: A mechanical framework for protocol verification

Formal Methods in System Design
A Database Approach to Distributed State Space Generation

Electronic Notes in Theoretical Computer Science (ENTCS)
Symbolic Reachability for Process Algebras with Recursive Data Types

Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
A Multi-Core Solver for Parity Games

Electronic Notes in Theoretical Computer Science (ENTCS)
CSP-CASL-Prover: A Generic Tool for Process and Data Refinement

Electronic Notes in Theoretical Computer Science (ENTCS)
State Space Reduction of Linear Processes Using Control Flow Reconstruction

ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Compositional Verification of a Communication Protocol for a Remotely Operated Vehicle

FMICS '09 Proceedings of the 14th International Workshop on Formal Methods for Industrial Critical Systems
Stuttering mostly speeds up solving parity games

NFM'11 Proceedings of the Third international conference on NASA Formal methods
Using Model Checking to Analyze the System Behavior of the LHC Production Grid

CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
A cure for stuttering parity games

ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Compositional verification of a communication protocol for a remotely operated aircraft

Science of Computer Programming
Using model checking to analyze the system behavior of the LHC production grid

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. The correctness consists of showing that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory, and has been checked in the theorem prover PVS.