Skip to main content
SpringerLink
Log in

Proving the Safety of a Sliding Window Protocol with Event-B

  • Conference paper
  • First Online:
Rigorous State-Based Methods (ABZ 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12709))

Included in the following conference series:

  • 472 Accesses

Abstract

This paper presents an Event-B modeling of the general version of the Sliding Window Protocol (SWP). SWPs ensure reliable data transfer over unreliable media by routing frames together with their indexes. Providing SWPs with formal guarantees is recognized to be quite complex. The experiment we present here shows that Event-B refinement is a suitable approach to ensure the safety of the protocol. First a simple model is developed with unbounded frame indexes. Then bounded indexes and modular arithmetic are introduced, as concrete indexes have fixed size. At this “hybrid” level, unbounded indexes are not used any more in computations but they are still useful to express some properties. Finally, abstract general media are refined towards queues, as an example of implementation. All unbounded indexes fully disappear in the final model.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    https://perso.telecom-paristech.fr/coudert/downloads/SWProdin3_5v1.zip.

  2. 2.

    restricts the domain of function F to S. restricts it to \(dom(F)\backslash S\).

  3. 3.

    Notice that frame outside the receiver window may be too old or too recent ones.

  4. 4.

    We are currently transposing them in the new release of the Rodin theory plugin.

  5. 5.

    becomes later in refinement.

  6. 6.

    Reminder: acknowledgments outside the window are handled by event reack.

References

  1. Abrial, J.-R.: Modeling in Event-B: System and Software Engineering, 1st edn. Cambridge University Press, New York (2010)

    Book  Google Scholar 

  2. Stenning, N.V.: A data transfer protocol. Comput. Netw. 1(2), 99–110 (1976)

    Google Scholar 

  3. Tanenbaum, A.S., et al.: Computer Networks. Prentice-Hall (1996)

    Google Scholar 

  4. Richier, J.-L., Rodriguez, C., Sifakis, J., Voiron, J.: Verification in XESAR of the sliding window protocol. In: IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII, NLD. North-Holland Publishing Co (1987)

    Google Scholar 

  5. Kaivola, R.: Using compositional preorders in the verification of sliding window protocol. In: Grumberg, O. (ed.) CAV 1997. LNCS, pp. 48–59. Springer, Heidelberg (1997). https://doi.org/10.1007/3-540-63166-6_8

  6. Godefroid, P., Long, D.E.: Symbolic protocol verification with queue BDDs. Formal Methods Syst. Des. 14(3), 257–271 (1999)

    Google Scholar 

  7. Smith, M.A., Klarlund, N.: Verification of a sliding window protocol using IOA and MONA. In: FORTE/PSTV 2000, pp. 19–34. NLD (2000). Kluwer, B.V

    Google Scholar 

  8. Chkliaev, D., Hooman, J., de Vink, E.: Verification and improvement of the sliding window protocol. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 113–127. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-36577-X_9

    Chapter  MATH  Google Scholar 

  9. Badban, B., Fokkink, W., Groote, J.F., Pang, J., van de Pol, J.: Verification of a sliding window protocol in \(\mu \)CRL and PVS. Formal Aspects Comput. 17(3), 342–388 (2005)

    Google Scholar 

  10. Siala, B., Bhiri, M.T., Bodeveix, J.-P., Filali, M.: An event-B development process for the distributed BIP framework. In: Ogata, K., Lawford, M., Liu, S. (eds.) ICFEM 2016. LNCS, vol. 10009, pp. 313–328. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-47846-3_20

    Chapter  Google Scholar 

  11. Stankaitis, P., Iliasov, A., Ait-Ameur, Y., Kobayashi, T., Ishikawa, F., Romanovsky, A.: A refinement based method for developing distributed protocols. In: HASE 2019, pp. 90–97 (2019)

    Google Scholar 

  12. Event-B home page. http://www.event-b.org/

  13. Zhu, C., Butler, M., Cirstea, C.: Trace semantics and refinement patterns for real-time properties in Event-B models. Sci. Comput. Program. 197 (2020)

    Google Scholar 

  14. Sulskus, G., Poppleton, M., Rezazadeh, A.: An interval-based approach to modelling time in event-B. In: Dastani, M., Sirjani, M. (eds.) FSEN 2015. LNCS, vol. 9392, pp. 292–307. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-24644-4_20

    Chapter  Google Scholar 

  15. Rusu, V.: Verifying a sliding-window protocol using PVS. In: Kim, M., Chin, B., Kang, S., Lee, D. (eds.) FORTE 2001. IIFIP, vol. 69, pp. 251–268. Springer, Boston, MA (2002). https://doi.org/10.1007/0-306-47003-9_16

    Chapter  Google Scholar 

  16. Chkliaev, D., Nepomniaschy, V.: Deductive verification of the sliding window protocol. Autom. Control. Comput. Sci. 47, 12 (2013)

    Google Scholar 

  17. Fokkink, W., Pang, J., De Pol, J.: Cones and foci: A mechanical framework for protocol verification. Form. Methods Syst. Des. 29(1), 1–31 (2006)

    Article  Google Scholar 

  18. Van de Snepscheut, J.L.A.: The sliding-window protocol revisited. Formal Aspects Comput. 7(1), 3–17 (1995)

    Article  Google Scholar 

  19. Hoogerwoord, R.R.: A formal derivation of a sliding window protocol. Computer science reports. Technische Universiteit Eindhoven (2006)

    Google Scholar 

  20. Méry, D.: Modelling by patterns for correct-by-construction process. In: Margaria, T., Steffen, B. (eds.) ISoLA 2018. LNCS, vol. 11244, pp. 399–423. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-03418-4_24

    Chapter  Google Scholar 

  21. Butler, M.: Incremental design of distributed systems with Event-B. Eng. Methods Tools Softw. Saf. Secur. 22(131) (2009)

    Google Scholar 

  22. Silva, R., Butler, M.: Shared event composition/decomposition in event-B. In: Aichernig, B.K., de Boer, F.S., Bonsangue, M.M. (eds.) FMCO 2010. LNCS, vol. 6957, pp. 122–141. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25271-6_7

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LTCI, Télécom Paris, Paris, France

    Sophie Coudert

Authors
  1. Sophie Coudert
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sophie Coudert .

Editor information

Editors and Affiliations

  1. Ulm University, Ulm, Germany

    Alexander Raschke

  2. University of Lorraine, Vandœuvre-lès-Nancy, France

    Dominique Méry

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Coudert, S. (2021). Proving the Safety of a Sliding Window Protocol with Event-B. In: Raschke, A., Méry, D. (eds) Rigorous State-Based Methods. ABZ 2021. Lecture Notes in Computer Science(), vol 12709. Springer, Cham. https://doi.org/10.1007/978-3-030-77543-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-77543-8_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-77542-1

  • Online ISBN: 978-3-030-77543-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation