Divide, abstract, and model-check

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

Volumn 1680, Issue , 1999, Pages 57-76

  Stahl, Karsten ^a   Baukus, Kai ^a   Lakhnech, Yassine ^a   Steffen, Martin ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING;

ADDED VALUES; COMPOSITIONALITY; DATA INDEPENDENCE; DEDUCTIVE REASONING; SLIDING WINDOW PROTOCOL; WINDOW SIZE;

MODEL CHECKING;

EID: 84948149926     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48234-2_5     Document Type: Conference Paper

References (23)

1. A. Bouajjani, S. Bensalem, C. Loiseaux, and J. Sifakis. Property preserving simulations. In G. v. Bochmann and D. K. Probst, editors, CAV’92, volume 663 of LNCS. Springer, 1992.
2. R. Cardell-Oliver. The specification and verification of sliding window protocols. Technical Report 183, University of Cambridge, 1989.
3. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th POPL, Los Angeles, CA. ACM, 1977.
4. E. M. Clarke and E. A. Emerson. Synthesis of synchronisation skeletons for branching time temporal logic. In D. Kozen, editor, Workshop on Logic of Programs 1981, volume 131 of LNCS. Springer, 1981.
5. E. Clarke, O. Grumberg, and D. Long. Model checking and abstraction. TOPLAS, 16(5):1512-1542, 1994.
6. D. Dams. Abstract interpretation and partition refinement for model checking. PhD thesis, Technical University of Eindhoven, 1996.
7. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems: Abstractions preserving ACTL*, ECTL* and CTL*. In E.-R. Olderog, editor, Proceedings of PROCOMET '94. North-Holland, 1994.
8. I. Dravapoulos, N. Pronios, A. Andritsou, I. Piveropoulos, N. Passas, D. Skyrianoglou, G. Awater, J. Kruys, N. Nikaein, A. Enout, S. Decrauzat, T. Kaltenschnee, T. Schumann, J. Meierhofer, S. Thömel, and J. Mikkonen. The Magic WAND, Deliverable 3D5, Wireless ATM MAC, Final Report, 1998.
9. W.-P. de Roever, H. Langmaack, and A. Pnueli, editors. Compos '97, volume 1536 of LNCS. Springer, 1998.
10. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
11. B. Jonsson. Compositional Verification of Distributed Systems. PhD thesis, University of Uppsala, 1987. Technical Report DoCS 87/09.
12. R. Kaivola. Using compositional preorders in the verification of sliding window protocol. In O. Grumberg, editor, Proceedings of CAV '97, volume 1256 of LNCS, pages 48-59. Springer, 1997.
13. P. Kelb. Abstraktionstechniken für Automatische Verifikationsmethoden. PhD thesis, University of Oldenburg, 1995.
14. D. E. Knuth. Verification of link-level protocols. BIT, 21:31-36, 1981.
15. R. P. Kurshan. Computer-Aided Verification of Coordinating Processes, the automata theoretic approach. Princeton Series in Computer Science. Princeton University Press, 1994.
16. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6(1), 1995.
17. D. E. Long. Model Checking, Abstraction, and Compositional Reasoning. PhD thesis, Carnegie Mellon, 1993.
18. S. Owre, J. Rushby, N. Shankar, and F. von Henke. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107-125, 1995.
19. J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proceedings of the Fifth International Symposium on Programming, 1981.
20. J. L. Richier, C. Rodriguez, J. Sifakis, and J. Voiron. Verification in Xesar of the sliding window protocol. In PSTV VII. North-Holland, 1987.
21. A. U. Shankar and S. S. Lam. A stepwise refinement heuristics for protocol construction. TOPLAS, 14(3):417-461, 1992.
22. N. V. Stenning. A data transfer protocol. Computer Networks, 11:99-110, 1976.
23. P. Wolper. Expressing interesting properties of programs in propositional temporal logic. In Thirteenth POPL (St. Peterburg Beach, FL), pages 184-193. ACM, 1986.