research-article

Open access

The sliding-window protocol revisited

Author:

Jan L. A. van de SnepscheutAuthors Info & Claims

Formal Aspects of Computing, Volume 7, Issue 1

Pages 3 - 17

https://doi.org/10.1007/BF01214620

Published: 01 January 1995 Publication History

Abstract

We give a correctness proof of the sliding-window protocol. Both safety and liveness properties are addressed. We show how faulty channels can be represented as nondeterministic programs. The correctness proof is given as a sequence of correctness-preserving transformations of a sequential program that satisfies the original specification, with the exception that it does not have any faulty channels. We work as long as possible with a sequential program, although the transformation steps are guided by the aim of going to a distributed program. The final transformation steps consist in distributing the actions of the sequential program over a number of processes.

References

References

[1]

Back R.-J. R. and Kurki-Suonio R. Decentralization of process nets with centralized control Distributed Computing 1989 3 73-87

Digital Library

[2]

Bartlett K. A., Scantlebury R. A., and Wilkinson P. T. A note on reliable full-duplex transmission over half-duplex links Communications of the ACM 1969 12 5 260-261

Digital Library

[3]

Chandy, K. M. and Misra, J.:Parallel Program Design, a foundation. Addison-Wesley, 1988.

[4]

Cardell-Oliver, R.: Using higher order logic for modelling real-time protocols. InTAPSOFT '91, volume 494 ofLecture Notes in Computer Science, pages 259–282. Springer-Verlag, 1991.

[5]

Dijkstra, E. W.:A Discipline of Programming. Prentice-Hall, 1976.

[6]

Dijkstra, E. W. and Scholten, C. S.:Predicate Calculus and Program Semantics. Springer-Verlag, 1990.

[7]

Hailpern, B. T.:Verifying Concurrent Processes Using Temporal Logic, volume 129 ofLecture Notes in Computer Science. Springer-Verlag, 1982.

[8]

Hoare C. A. R. Communicating sequential processes Communications of the ACM 1978 21 8 666-677

Digital Library

[9]

Hoare, C. A. R.:Communicating Sequential Processes. Series in Computer Science (C.A.R. Hoare, ed.). Prentice-Hall International, 1985.

[10]

Martin A. J. An axiomatic definition of synchronization primitives Acta Informatica 1981 16 219-235

Digital Library

[11]

Martin A. J. The probe: an addition to communication primitives Information Processing Letters 1985 20 125-130

[12]

Paliwoda K. and Sanders J. W. An incremental specification of the sliding-window protocol Distributed Computing 1991 5 83-94

Digital Library

[13]

Stenning N. V. A data transfer protocol Computer Networks 1976 1 2 99-110

[14]

Tanenbaum, A. S.:Computer Networks, second edition. Prentice Hall, 1988.

[15]

Yemini Y. and Kurose J. F. Can current protocol verification techniques guarantee correctness? Computer Networks 1982 6 377-381

Cited By

Coudert S(2021)Proving the Safety of a Sliding Window Protocol with Event-BRigorous State-Based Methods10.1007/978-3-030-77543-8_4(50-65)Online publication date: 9-Jun-2021
https://dl.acm.org/doi/10.1007/978-3-030-77543-8_4
Goodloe AMuñoz C(2013)Compositional verification of a communication protocol for a remotely operated aircraftScience of Computer Programming10.1016/j.scico.2011.10.01178:7(813-827)Online publication date: 1-Jul-2013
https://dl.acm.org/doi/10.1016/j.scico.2011.10.011
Goodloe AMuñoz C(2009)Compositional Verification of a Communication Protocol for a Remotely Operated VehicleProceedings of the 14th International Workshop on Formal Methods for Industrial Critical Systems10.1007/978-3-642-04570-7_8(86-101)Online publication date: 4-Nov-2009
https://dl.acm.org/doi/10.1007/978-3-642-04570-7_8
Show More Cited By

Index Terms

The sliding-window protocol revisited

Index terms have been assigned to the content through auto-classification.

Recommendations

The Sliding Window Protocol Revisited
An incremental specification of the sliding-window protocol

The sliding-window protocol is specified using the notation of Communicating Sequential Processes and its partial correctness is proved using the trace semantics. First the stop-and-wait protocol is defined; its correctness, that it forms a 1-place ...
An almost-optimally fair three-party coin-flipping protocol
STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computing

In a multiparty fair coin-flipping protocol, the parties output a common (close to) unbiased bit, even when some corrupted parties try to bias the output. Cleve [STOC 1986] has shown that in the case of dishonest majority (i.e., at least half of the ...

Comments

Information & Contributors

Information

Published In

cover image Formal Aspects of Computing

Formal Aspects of Computing Volume 7, Issue 1

Jan 1995

110 pages

ISSN:0934-5043

EISSN:1433-299X

Issue’s Table of Contents

© BCS 1995.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 January 1995

Published in FAC Volume 7, Issue 1

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
81
Total Downloads

Downloads (Last 12 months)35
Downloads (Last 6 weeks)12

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Coudert S(2021)Proving the Safety of a Sliding Window Protocol with Event-BRigorous State-Based Methods10.1007/978-3-030-77543-8_4(50-65)Online publication date: 9-Jun-2021
Goodloe AMuñoz C(2013)Compositional verification of a communication protocol for a remotely operated aircraftScience of Computer Programming10.1016/j.scico.2011.10.01178:7(813-827)Online publication date: 1-Jul-2013
Goodloe AMuñoz C(2009)Compositional Verification of a Communication Protocol for a Remotely Operated VehicleProceedings of the 14th International Workshop on Formal Methods for Industrial Critical Systems10.1007/978-3-642-04570-7_8(86-101)Online publication date: 4-Nov-2009
Feijen Wvan Gasteren ASchieder B(2006)An elementary derivation of the alternating bit protocolMathematics of Program Construction10.1007/BFb0054290(175-187)Online publication date: 25-May-2006
Badban BFokkink WGroote JPang JPol J(2005)Verification of a sliding window protocol in μCRL and PVSFormal Aspects of Computing10.1007/s00165-005-0070-017:3(342-388)Online publication date: 1-Oct-2005
Fokkink WGroote JPang JBadban Bvan de Pol J(2004)Verifying a Sliding Window Protocol in μCRLAlgebraic Methodology and Software Technology10.1007/978-3-540-27815-3_15(148-163)Online publication date: 2004
Röckl CEsparza J(2002)Proof-Checking Protocols Using BisimulationsCONCUR’99 Concurrency Theory10.1007/3-540-48320-9_36(525-540)Online publication date: 19-Apr-2002
(1996)BibliographyDistributed Algorithms10.1016/B978-1-55860-348-6.50026-2(829-856)Online publication date: 1996
Lynch N(1996)Distributed AlgorithmsundefinedOnline publication date: 16-Apr-1996
Leino K(1995)A method for showing progressFormal Aspects of Computing10.1007/BF012116337:5(576-580)Online publication date: Sep-1995

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Figures

Tables

Media

View Issue’s Table of Contents