Abstract
The main obstacle to automatic verification of temporal logic properties of finite-state systems is the state explosion problem. One way to alleviate this is to replace components of a system with smaller ones and verify the required properties from the smaller system. This approach leads to notions of compositional property-preserving equivalences and preorders. Previously we have shown that the NDFD preorder is the weakest preorder which is compositional w.r.t. standard operators and preserves nexttime-less linear temporal logic properties. In this paper we describe a case study where NDFD preorder was used to verify semiautomatically both safety and liveness properties of the Sliding Window protocol for arbitrary channel lengths and realistic parameter values. In this process we located a previously undiscovered fault leading to lack of liveness in a version of the protocol.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bolognesi, T. & Brinksma, E.: Introduction to the ISO specification language LOTOS, in The Formal Descr. Technique LOTOS, North-Holland, 1989, pp. 23–73
Clarke, E. M. & Long, D. E. & McMillan, K. L.: Compositional model checking, in Proceedings of the Fourth IEEE LICS, 1989, pp. 353–362
De Nicola, R. & Vaandrager, F.: Action vs. state based logics for transition systems, in Semantics of Sys. of Conc. Proc., LNCS vol. 469, Springer, 1990, pp. 407–419
Emerson, E. A.: Temporal and modal logic, in van Leeuwen, J. (ed.): Handbook of Theoretical Computer Science, Elsevier/North-Holland, 1990, pp. 997–1072
Graf, S. & Steffen, B. & Lüttgen, G.: Compositional Minimisation of Finite State Systems Using Interface Spec., in Formal Asp. of Comp., vol. 8, 1996, pp. 607–616
International Standards Organisation: Data Communications — HDLC Unbalanced Class of Procedures, Ref. No. ISO 6159, ISO, Geneva, 1980
Kaivola, R.: Equivalences, Preorders and Compositional Verification for Linear Time Temp. Logic and Conc. Sys., A-1996-1, Univ. of Helsinki, Dept. of Comp. Sci., 1996, 176+9 p., also in www.cs.Helsinki.FI/~rkaivola/research/ft.ps
Kaivola, R. & Valmari, A.: Using truth-preserving reductions to improve the clarity of Kripke-models, in CONCUR'91, LNCS vol. 527, Springer, 1991, pp. 361–375
Kaivola, R. & Valmari, A.: The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic, CONCUR'92, LNCS vol. 630, Springer, 1992, pp. 207–221
Manna, Z. & Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems, vol. 1, Specification, Springer, 1991
Richier, J. L. & Rodriguez, C. & Sifakis, J. & Voiron, J.: Verification in Xesar of the sliding window protocol, in PSTV VII, North-Holland, 1987, pp. 235–248
Sabnani, K.: An algorithmic technique for protocol verification, in IEEE Transactions on Communications, vol. 36, no. 8, 1988, pp. 924–931
Stenning, N. V.: A data transfer protocol, in Computer Networks, vol. 11, 1976, pp. 99–110
Stirling, C.: Modal and temporal logics, in Abramsky, S. & al. (eds.): Handbook of Logic in Computer Science, Oxford University Press, 1992, pp. 477–563
Valmari, A. & Kemppainen, J. & Clegg, M. & Levanto, M.: Putting advanced reachability analysis techniques together: the “ARA” tool, in FME'93: Industrial-Strength Formal Methods, LNCS vol. 670, Springer, 1993, pp. 597–616
Valmari, A. & Tienari, M.: Compositional failure-based semantic models for Basic LOTOS, in Formal Aspects of Computing, vol. 7, 1995, pp. 440–468
Wolper, P.: Expressing interesting properties of programs in propositional temporal logic, in Proceedings of the 13th ACM POPL, 1986, pp. 184–193
Wolper, P. & Lovinfosse, V.: Verifying Properties of Large Sets of Processes with Network Invariants, in Proc. of International Workshop on Automatic Verification Methods for Finite State Systems, LNCS vol. 407, Springer, 1990, pp. 68–80
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaivola, R. (1997). Using compositional preorders in the verification of sliding window protocol. In: Grumberg, O. (eds) Computer Aided Verification. CAV 1997. Lecture Notes in Computer Science, vol 1254. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63166-6_8
Download citation
DOI: https://doi.org/10.1007/3-540-63166-6_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63166-8
Online ISBN: 978-3-540-69195-2
eBook Packages: Springer Book Archive