Verifying a sliding window protocol in μCRL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3116, Issue , 2004, Pages 148-163

  Fokkink, Wan ^a   Groote, Jan Priso ^b   Pang, Jun ^a   Badban, Bahareh ^b   Van De Pol, Jaco ^c  

^a CWI   (Netherlands)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE ENGINEERING;

AXIOMATIC THEORY; MODULO 2; SEQUENCE NUMBER; SLIDING WINDOW PROTOCOL; WINDOW SIZE;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 35048816463     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27815-3_15     Document Type: Article

References (44)

1. J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Control, 60(1/3):109-137, 1984.
2. M.A. Bezem and J.F. Groote. Invariants in process algebra with data. In Proc. CONCUR'94, LNCS 836, pp. 401-416. Springer, 1994.
3. M.A. Bezem and J.F. Groote. A correctness proof of a one bit sliding window protocol in μCRL. The Computer Journal, 37(4):289-307, 1994.
4. J.J. Brunekreef. Sliding window protocols. In S. Mauw and G. Veltink, eds, Algebraic Specification of Protocols. Cambridge Tracts in Theoretical Computer Science 36, pp. 71-112. Cambridge University Press, 1993.
5. R. Cardell-Oliver. Using higher order logic for modelling real-time protocols. In Proc. TAPSOFT'91, LNCS 494, pp. 259-282. Springer, 1991.
6. V.G. Cerf and R.E. Kahn. A protocol for packet network intercommunication. IEEE Transactions on Communications, COM-22:637-648, 1974.
7. D. Chkliaev, J. Hooman, and E. de Vink. Verification and improvement of the sliding window protocol. In TACAS'03, LNCS 2619, pp. 113-127. Springer, 2003.
8. W.J. Fokkink, J.F. Groote, J. Pang, B. Badban, and J.C. van de Pol. Verifying a sliding window protocol in μCRL. Technical Report SEN-R0308, CWI, 2003.
9. W.J. Fokkink and J. Pang. Cones and foci for protocol verification revisited. In Proc. FOSSACS'03, LNCS 2620, pp. 267-281. Springer, 2003.
10. R.J. van Glabbeek and W.P. Weijland. Branching time and abstraction in bisimulation semantics. Journal of the ACM, 43(3):555-600, 1996.
11. P. Godefroid and D.E. Long. Symbolic protocol verification with Queue BDDs. Formal Methods and System Design, 14(3):257-271, 1999.
12. R.A. Groenveld. Verification of a sliding window protocol by means of process algebra. Report P8701, University of Amsterdam, 1987.
13. J.F. Groote. Process Algebra and Structured Operational Semantics. PhD thesis, University of Amsterdam, 1991.
14. J.F. Groote and H.P. Korver. Correctness proof of the bakery protocol in μCRL. In Proc. ACP'94, Workshops in Computing, pp. 63-86. Springer, 1995.
15. J.F. Groote and A. Ponse. Proof theory for μCRL: A language for processes with data. In Proc. SoSL'93, Workshops in Computing, pp. 232-251. Springer, 1994.
16. J.F. Groote and A. Ponse. Syntax and semantics of μCRL. In Proc. ACP'94, Workshops in Computing, pp. 26-62. Springer, 1995.
17. J.F. Groote, A. Ponse, and Y.S. Usenko. Linearization of parallel pCRL. Journal of Logic and Algebraic Programming, 48(1/2):39-72, 2001.
18. J.F. Groote and M. Reniers. Algebraic process verification. In Handbook of Process Algebra, pp. 1151-1208. Elsevier, 2001.
19. J.F. Groote and J. Springintveld. Focus points and convergent process operators: A proof strategy for protocol verification. Journal of Logic and Algebraic Programming, 49(1/2):31-60, 2001.
20. B.T. Hailpern. Verifying Concurrent Processes Using Temporal Logic. LNCS 129, Springer, 1982.
21. G.J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
22. G.J. Holzmann. The model checker Spin. IEEE Transactions on Software Engineering, 23(5):279-295, 1997.
23. B. Jonsson. Compositional Verification of Distributed Systems. PhD thesis, Uppsala University, 1987.
24. B. Jonsson and M. Nilsson. Transitive closures of regular relations for verifying infinite-state systems. In TACAS'00, LNCS 1785, pp. 220-234. Springer, 2000
25. R. Kaivola. Using compositional preorders in the verification of sliding window protocol. In Proc. CAV'97, LNCS 1254, pp. 48-59. Springer, 1997.
26. D.E. Knuth. Verification of link-level protocols. BIT, 21:21-36, 1981.
27. T. Latvala. Model checking LTL properties of high-level Petri nets with fairness constraints. In Proc. APN'01, LNCS 2075, pp. 242-262. Springer, 2001.
28. J. Loeckx, H.-D. Ehrich, and M. Wolf. Specification of Abstract Data Types. Wiley/Teubner, 1996.
29. E. Madelaine and D. Vergamini. Specification and verification of a sliding window protocol in Lotos. In Proc. FORTE'91, IFIP Transactions, pp. 495-510. North-Holland, 1991.
30. S. Mauw and G.J. Veltink. A process specification formalism. Fundamenta Informaticae, 13(2):85-139, 1990.
31. A. Middeldorp. Specification of a sliding window protocol within the framework of process algebra. Report FVI 86-19, University of Amsterdam, 1986.
32. K. Paliwoda and J.W. Sanders. An incremental specification of the sliding-window protocol. Distributed Computing, 5:83-94, 1991.
33. D.M.R. Park. Concurrency and automata on infinite sequences. In Proc. 5th GI Conference, LNCS 104, pp. 167-183. Springer, 1981.
34. J.L. Richier, C. Rodriguez, J. Sifakis, and J. Voiron. Verification in Xesar of the sliding window protocol. In Proc. PSTV'87, pp. 235-248. North-Holland, 1987.
35. C. R̈ckl and J. Esparza. Proof-checking protocols using bisimulations. In Proc. CONCUR'99, LNCS 1664, pp. 525-540. Springer, 1999.
36. V. Rusu. Verifying a sliding-window protocol using PVS. In Proc. FORTE'01, Conference Proceedings 197, pp. 251-268. Kluwer, 2001.
37. A.A. Schoone. Assertional Verification in Distributed Computing. PhD thesis, Utrecht University, 1991.
38. M.A. Smith and N. Klarlund. Verification of a sliding window protocol using IOA and MONA. In Proc. FORTE/PSTV'OO, pp. 19-34. Kluwer, 2000.
39. J.L.A. van de Snepscheut. The sliding window protocol revisited. Formal Aspects of Computing, 7(1):3-17, 1995.
40. K. Stahl, K. Baukus, Y. Lakhnech, and M. Steffen. Divide, abstract, and modelcheck. In Proc. SPIN'99, LNCS 1680, pp. 57-76. Springer, 1999.
41. N.V. Stenning. A data transfer protocol. Computer Networks, 1(2):99-110, 1976.
42. A.S. Tanenbaum. Computer Networks. Prentice Hall, 1981.
43. F.W. Vaandrager. Verification of two communication protocols by means of process algebra. Report CS-R8608, CWI, Amsterdam, 1986.
44. J.J. van Wamel. A study of a one bit sliding window protocol in ACP. Report P9212, University of Amsterdam, 1992.