Skip to main content
SpringerLink
Log in

Deductive verification of the Sliding Window Protocol

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

We consider the well-known Sliding Window Protocol which provides reliable and efficient transmission of data over unreliable channels. A formal proof of correctness for this protocol faces substantial difficulties, caused by a high degree of parallelism which creates a significant potential for errors. Here we consider a version of the protocol that is based on selective repeat of frames. The specification of the protocol by a state machine and its safety property are represented in the language of the verification system PVS. Using the PVS system, we give an interactive proof of this property of the Sliding Window Protocol.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alekseev, I.V., Sokolov, V.A., and Chalyi, D.Y., Modeling and Analysis of Transport Protocols in Information Networks, Yaroslavl State University, 2004 (in Russian).

    Google Scholar 

  2. Badban, B., Fokkink, W., Groote, J.F., Pang, J., and van de Pol, J., Verification of a Sliding Window Protocol in CRL and PVS, Formal Aspects Comput., 2005, vol. 17, no. 3, pp. 342–388.

    Article  MATH  Google Scholar 

  3. Chkliaev, D.A., Mechanical Verification of Concurrency Control and Recovery Protocols, PhD Thesis, Eindhoven University of Technology, 2001; http://alexandria.tue.nl/extra2/200112908.pdf

    MATH  Google Scholar 

  4. Chkliaev, D., Hooman, J., and de Vink, E.P., Verification and Improvement of the Sliding Window Protocol, Lecture Notes Comput. Sci., 2003, vol. 2619, pp. 113–127.

    Article  Google Scholar 

  5. Chkliaev, D.A. and Nepomniaschy, V.A., Specification and verification of the classical Sliding Window Protocol, Bull. Novosibirsk Comput. Center, Ser. Comput. Sci., IIS Special Issue, 2011, vol. 32, pp. 37–56.

    Google Scholar 

  6. Owre, S., Rushby, J.M., and Shankar, N., PVS: a prototype verification system, Lect. Notes Comput. Sci., 1992, vol. 607, pp. 748–752.

    Article  Google Scholar 

  7. Rusu, V., Verifying a Sliding-Window Protocol using PVS, Formal Description Techniques (FORTE’01), 2001, pp. 251–266.

    Google Scholar 

  8. Stenning, N.V., A data transfer protocol, Comput. Networks, 1976, vol. 1, pp. 99–110.

    Google Scholar 

  9. Tanenbaum, A.S., Computer Networks, Third Ed., Prentice-Hall International, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ershov Institute of Informatics Systems Siberian Branch of the Russian Academy of Sciences, pr. Acad. Lavrentjeva 6, Novosibirsk, 630090, Russia

    D. A. Chkliaev & V. A. Nepomniaschy

Authors
  1. D. A. Chkliaev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. A. Nepomniaschy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D. A. Chkliaev.

Additional information

The article is published in the original.

About this article

Cite this article

Chkliaev, D.A., Nepomniaschy, V.A. Deductive verification of the Sliding Window Protocol. Aut. Control Comp. Sci. 47, 420–426 (2013). https://doi.org/10.3103/S0146411613070195

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411613070195

Keywords

Search

Navigation