Memory efficient algorithms for the verification of temporal properties

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

Volumn 531 LNCS, Issue , 1991, Pages 233-242

  Courcoubetis, C ^a   Vardi, M ^b   Wolper, P ^c   Yannakakis, M ^d  

^a INSTITUTE OF COMPUTER SCIENCE   (Greece)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c Institut Montefiore ^*  (Belgium)

^d LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER AIDED ANALYSIS;

EMPTINESS PROBLEM; FINITE STATE PROGRAM; INFINITE WORD; MEMORY-EFFICIENT ALGORITHMS; NUMBER OF STATE; STRONGLY CONNECTED COMPONENT; TEMPORAL PROPERTY; VERIFICATION OF TEMPORAL PROPERTIES;

PROBLEM SOLVING;

EID: 84867758199     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0023737     Document Type: Conference Paper

References (21)

1. S. Aggarwal, C. Courcoubetis, and P. Wolper. Adding liveness properties to coupled finite-state machines. ACM Transactions on Programming Languages and Systems, 12(2):303-339, 1990.
2. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley, Reading, 1974.
3. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. Data Structures and Algorithms. Addison Wesley, Reading, 1982.
4. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, January 1986.
5. E. M. Clarke and O. Grümberg. Avoiding the state explosion problem in temporal logic model-checking algorithms. In Proc. 6th ACM Symposium on Principles of Distributed Computing, pages 294-303, Vancouver, British Columbia, August 1987.
6. R. Grotz, C. Jard, and C. Lassudrie. Attacking a complex distributed systems from different sides: an experience with complementary validation tools. In Proc. 4th Work. Protocol Specification, Testing, and Verification, pages 3-17. North-Holland, 1984.
7. B.T. Hailpern. Tools for verifying network protocols. In K. Apt, editor, Logic and Models of Concurrent Systems, NATO ISI Series, pages 57-76. Springer-Verlag, 1985.
8. G. Holzmann. An improved protocol reachability analysis technique. Software Practice and Experience, pages 137-161, February 1988.
9. C. Jard and T. Jeron. On-line model-checking for finite linear temporal logic specifications. In Automatic Verification Methods for Finite State Systems, Proc. Int. Workshop, Grenoble, volume 407, pages 189-196, Grenoble, June 1989. Lecture Notes in Computer Science, Springer-Verlag.
10. M.T. Liu. Protocol engineering. Advances in Computing, 29:79-195, 1989.
11. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the Twelfth ACM Symposium on Principles of Programming Languages, pages 97-107, New Orleans, January 1985.
12. J.P. Quielle and J. Sifakis. Specification and verification of concurrent systems in cesar. In Proc. 5th Int’l Symp. on Programming, volume 137, pages 337-351. Springer-Verlag, Lecture Notes in Computer Science, 1981.
13. H. Rudin. Network protocols and tools to help produce them. Annual Review of Computer Science, 2:291-316, 1987.
14. H. Rudin and C.H. West. A validation technique for tightly-coupled protocols. IEEE Transactions on Computers, C-312:630-636, 1982.
15. C.A. Sunshine. Experience with automated protocol verification. In Proceedings of the International Conference on Communication, pages 1306-1310, 1983.
16. M. Vardi. Unified verification theory. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Proc. Temporal Logic in Specification, volume 398, pages 202-212. Lecture Notes in Computer Science, Springer-Verlag, 1989.
17. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. Symp. on Logic in Computer Science, pages 322-331, Cambridge, june 1986.
18. M.Y. Vardi and P. Wolper. Reasoning about infinite computation paths. IBM Research Report RJ6209, 1988.
19. C.H. West. Generalized technique for communication protocol validation. IBM J. of Res. and Devel., 22:393-404, 1978.
20. P. Wolper. On the relation of programs and computations to models of temporal logic. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Proc. Temporal Logic in Specification, volume 398, pages 75-123. Lecture Notes in Computer Science, Springer-Verlag, 1989.
21. C.H. West and P. Zafiropulo. Automated validation of a communication protocol: the ccitt x.21 recommendation. IBM Journal of Research and Development, 22:60-71, 1978a