Verification and improvement of the sliding window protocol

Authors:
Dmitri Chkliaev;Jozef Hooman;Erik de Vink
Affiliations:
Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands;Computing Science Institute, University of Nijmegen, The Netherlands;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands
Venue:
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Year:
2003

Citing 15
Cited 11

Verified data transfer protocols with variable flow control

ACM Transactions on Computer Systems (TOCS)
Tight bounds for the sequence transmission problem

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
A theory of timed automata

Theoretical Computer Science
Proof-checking a data link protocol

TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Reliable communication over unreliable channels

Journal of the ACM (JACM)
Computer networks (3rd ed.)

Computer networks (3rd ed.)
A note on reliable full-duplex transmission over half-duplex links

Communications of the ACM
Distributed Algorithms

Distributed Algorithms
Verification in XESAR of the Sliding Window Protocol

Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII
A Bounded Retransmission Protocol for Large Data Packets

AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Verification of a Sliding Window Protocol Using IOA and MONA

FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
The Bounded Retransmission Protocol Must Be on Time!

TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Linear Parametric Model Checking of Timed Automata

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Experiments in Theorem Proving and Model Checking for Protocol Verification

FME '96 Proceedings of the Third International Symposium of Formal Methods Europe on Industrial Benefit and Advances in Formal Methods
Using Compositional Preorders in the Verification of Sliding Window Protocal

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification

Rigorous specification and conformance testing techniques for network protocols, as applied to TCP, UDP, and sockets

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Stenning's protocol implemented in UDP and verified in Isabelle

CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
An investigation of credit-based flow control protocols

Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
A Rigorous Approach to Networking: TCP, from Implementation to Protocol to Service

FM '08 Proceedings of the 15th international symposium on Formal Methods
On reliable transmission of data over simple wireless channels

Journal of Computer Systems, Networks, and Communications
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
Formal specification and analysis of zeroconf using uppaalS

ACM Transactions on Embedded Computing Systems (TECS)
Model checking the time to reach agreement

FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Forgetting the time in timed process algebra: timeless behaviour in a timestamped world

FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Challenges of a Validation Process Based on Models: An Industrial Case Study

Bell Labs Technical Journal
Compositional verification of a communication protocol for a remotely operated aircraft

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The well-known Sliding Window protocol caters for the reliable and efficient transmission of data over unreliable channels that can lose, reorder and duplicate messages. Despite the practical importance of the protocol and its high potential for errors, it has never been formally verified for the general setting. We try to fill this gap by giving a fully formal specification and verification of an improved version of the protocol. The protocol is specified by a timed state machine in the language of the verification system PVS. This allows a mechanical check of the proof by the interactive proof checker of PVS. Our modelling is very general and includes such important features of the protocol as sending and receiving windows of arbitrary size, bounded sequence numbers and channels that may lose, reorder and duplicate messages.