Verification of a sliding window protocol in μcRL and PVS

Formal Aspects of Computing

Volumn 17, Issue 3, 2005, Pages 342-388

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

^a CWI   (Netherlands)

^b ÉCOLE POLYTECHNIQUE   (France)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^d VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Branching bisimulation; Process algebra; Sliding window protocols; Specification; Verification techniques; CRL

Indexed keywords

THEOREM PROVING;

BRANCHING BISIMULATION; PROCESS ALGEBRA; SLIDING WINDOW PROTOCOLS; SPECIFICATION; VERIFICATION TECHNIQUES;

NETWORK PROTOCOLS;

EID: 26844463872     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-005-0070-0     Document Type: Conference Paper

References (48)

1. [BeK84] Bergstra JA, Klop JW (1984) Process algebra for synchronous communication. Inform Comput 60:109-137
2. [BeK86] Bergstra JA, Klop JW (1986) Verification of an alternating bit protocol by means of process algebra. In: Proceedings of spring school on mathematical methods of specification and synthesis of software systems, LNCS 215, Springer, Berlin Heidelberg NewYork, pp 9-23
3. [BeG94a] Bezem MA, Groote JF (1994) A correctness proof of a one bit sliding window protocol in μCRL. Comput J 37(4):289-307
4. [BeG94b] Bezem MA, Groote JF (1994) Invariants in process algebra with data. In: Proceedings of 5th conference on concurrency theory, LNCS 836, Springer, Berlin Heidelberg NewYork, pp 401-416
5. [Bru93] Brunekreef JJ (1993) Sliding window protocols. In: Algebraic Specification of Protocols. Cambridge Tracts in Theoretical Computer Science 36, Cambridge University Press, London, pp 71-112
6. [Car91] Cardell-Oliver R (1991) Using higher order logic for modelling real-time protocols. In: Proceedings of 4th joint conference on theory and practice of software development, LNCS 494, Springer, Berlin Heidelberg NewYork, pp 259-282
7. [CeK74] Cerf VG, Kahn RE (1974) A protocol for packet network intercommunication. IEEE Trans Commun COM-22:637-648
8. [CHV03] Chkliaev D, Hooman J, de Vink E (2003) Verification and improvement of the sliding window protocol. In: Proceedings of 9th conference on tools and algorithms for the construction and analysis of systems, LNCS 2619, Springer, Berlin Heidelberg New York, pp 113-127
9. +04] Fokkink WJ, Groote JF, Pang J, Badban B, van de Pol JC (2004) Verifying a sliding window protocol in μCRL. In: Proceedings of 10th conference on algebraic methodology and software technology, LNCS 3116, Springer, Berlin Heidelberg NewYork, pp 148-163
10. [FoP03] Fokkink WJ, Pang J (2003) Cones and foci for protocol verification revisited. In: Proceedings of 6th Conference on Foundations of Software Science and Computation Structures, LNCS 2620, Springer, Berlin Heidelberg NewYork, pp 267-281
11. [FPP04] Fokkink WJ, Pang J, van de Pol JC (2005) Cones and foci: A mechanical framework for protocol verification. Forma Methods Syst Des, to appear
12. [Gla94] van Glabbeek, RJ (1994) What is branching time and why to use it? The concurrency column, Bull. EATCS 53:190-198
13. [GlW96] van Glabbeek RJ, Weijland WP (1996) Branching time and abstraction in bisimulation semantics. J ACM 43:555-600
14. [GoL99] Godefroid P, Long DE (1999) Symbolic protocol verification with Queue BDD& Formal Methods Syst Des 14(3):257-271
15. [Gro87] Groenveld RA (1987) Verification of a sliding window protocol by means of process algebra. Report P8701, University of Amsterdam, The Netherlands
16. [Gro91] Groote JF (1991) Process algebra and structured operational semantics. PhD thesis, University of Amsterdam, The Netherlands
17. [GrK95] Groote JF, Korver HP (1995) Correctness proof of the bakery protocol in ,μCRL. In: Proceedings of 1st workshop on the algebra of communicating processes, Workshops in Computing, Springer, Berlin Heidelberg NewYork, pp 63-86
18. [GrP94] Groote JF, Ponse A (1994) Proof theory for μCRL: a language for processes with data. In: Proceedings of workshop on semantics of specification languages, Workshops in Computing, Springer, Berlin Heidelberg NewYork, pp 232-251
19. [GrP95] Groote JF, Ponse A (1995) The syntax and semantics of μCRL. In: Proceedings of 1st workshop on the algebra of communicating processes, Workshops in Computing Series, pp 26-62. Springer, Berlin Heidelberg NewYork
20. [GPU01] Groote JF, Ponse A, Usenko YS (2001) Linearization in parallel pCRL. J Logic Algebr Progr, 48(1/2):39-72
21. [GrR01] Groote JF, Reniers MA (2001) Algebraic process verification. In: Bergstra JA, Ponse A, Smolka SA (eds) Handbook of process algebra, Elsevier, Amsterdam, pp 1151-1208
22. [GrS01] Groote JF, Springintveld J (2001) Focus points and convergent process operators. A proof strategy for protocol verification. J Logic Algebr Progr, 49(1/2):31-60
23. [Hai82] Hailpern BT (1982) Verifying concurrent processes using temporal logic. LNCS 129, Springer, Berlin Heidelberg NewYork
24. [Hol91] Holzmann GJ (1991) Design and validation of computer protocols. Prentice Hall
25. [Hol97] Holzmann GJ (1997) The model checker Spin. IEEE Transactions on Software Engineering, 23(5):279-295
26. [Jon87] Jonsson B (1987) Compositional verification of distributed systems. PhD thesis, Department of Computer Science, Uppsala University, Sweden
27. [JoN00] Jonsson B, Nilsson M (2000) Transitive closures of regular relations for verifying infinite-state systems. In: Proceedings of 6th Conference on tools and algorithms for construction and analysis of systems, LNCS 1785, Springer, Berlin Heidelberg New York, pp 220-234
28. [Kai97] Kaivola R (1997) Using compositional preorders in the verification of sliding window protocol. In: Proceedings of 9th Conference on computer aided verification, LNCS 1254, Springer, Berlin Heidelberg NewYork, pp 48-59
29. [Knu81] Knuth DE (1981) Verification of link-level protocols. BIT 21:21-36
30. [Lat01] Latvala T (2001) Model checking LTL properties of high-level Petri nets with fairness constraints. In: Proceedings of 22nd Conference on application and theory of petri nets, LNCS 2075, Springer, Berlin Heidelberg NewYork, pp 242-262
31. [LEW96] Loeckx J, Ehrich HD, Wolf M (1996) Specification of abstract data types. Wiley/Teubner
32. [MaV91] Madelaine E, Vergamini D (1991) Specification and verification of a sliding window protocol in Lotos. In: Proceedings of 4th Conference on formal description techniques for distributed systems and communication protocols, IFIP Transactions, North-Holland, pp 495-510
33. [MaV90] Mauw S, Veltink GJ (1990) A process specification formalism. Fund Inform 13(2):85-139
34. [Mid86] Middeldorp A (1986) Specification of a sliding window protocol within the framework of process algebra. Report FVI 86-19, University of Amsterdam, The Netherlands
35. +96] Owre S, Rajan R, Rushby JM, Shankar N, Srivas MK (1996) PVS: combining specification, proof checking, and model checking. In: Proceedings of 8th Conference on computer-aided verification, LNCS 1102, Springer, Berlin Heidelberg NewYork, pp 411-414
36. [PaS91] Paliwoda K, Sanders JM (1991) An incremental specification of the sliding-window protocol. Distrib Comput, 5:83-94
37. [Par81] Park DMR (1981) Concurrency and automata on infinite sequences. In: Proceedings of 5th Gl-Conference on theoretical computer science, LNCS 104, Springer, Berlin Heidelberg NewYork, pp 167-183
38. +87] Richier JL, Rodriguez C, Sifakis J, Voiron J (1987) Verification in Xesar of the sliding window protocol. In: Proceedings of 7th Conference on protocol specification, testing and verification, North-Holland, pp 235-248
39. [RoE99] Röckl C, Esparza J (1999) Proof-checking protocols using bisimulations. In: Proceedings of 10th Conference on Concurrency Theory, LNCS 1664, Springer, Berlin Heidelberg NewYork, pp 525-540
40. [Rus01] Rusu V (2001) Verifying a sliding-window protocol using PVS. In: Proceedings of 21st Conference on formal techniques for networked and distributed systems, IFIP Conference Proceedings 197, Kluwer, Dordrecht, pp 251-268
41. [Sch91] Schoone AA (1991) Assertional verification in distributed computing. PhD thesis, Utrecht University, The Netherlands
42. [SmK00] Smith MA, Klarlund N (2000) Verification of a sliding window protocol using IDA and MONA. In: Proceedings of 20th Conference on formal techniques for distributed system development, IFIP Conference Proceedings 183, Kluwer, Dordrecht, pp 19-34
43. [Sne95] van de Snepscheut JLA (1995) The sliding window protocol revisited. Form Aspects Comput 7(1):3-17
44. +99] Stahl K, Baukus K, Lakhnech Y, Steffen M (1999) Divide, abstract, and model-check. In: Proceedings of 6th International SPIN Workshop, LNCS 1680, Springer, Berlin Heidelberg NewYork, pp 57-76
45. [Ste76] Stenning NV (1976) A data transfer protocol. Comput Networks 1(2):99-110
46. [Tan81] Tanenbaum AS (1981) Computer networks. Prentice Hall
47. [Vaa86] Vaandrager FW (1986) Verification of two communication protocols by means of process algebra. Report CS-R8608, CWI, Amsterdam
48. [Wam92] van Wamel JJ (1992) A study of a one bit sliding window protocol in ACP. Report P9212, University of Amsterdam, The Netherlands