Symbolic analysis of transition systems

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

Volumn 1912 LNCS, Issue , 2000, Pages 287-302

  Shankar, Natarajan ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

THEOREM PROVING; TOOLS; SEMANTICS;

ANALYSIS TOOLS; INTERMEDIATE LANGUAGES; PROGRAM ANALYSIS; SEMANTIC REPRESENTATION; SYMBOLIC ANALYSIS; TRANSITION SYSTEM; VERIFICATION FRAMEWORK;

MODEL CHECKING;

EID: 84889569002     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44518-8_16     Document Type: Conference Paper

References (38)

1. Rajeev Alur and Thomas A. Henzinger, editors. Computer-Aided Verification, CAV '96, volume 1102 of Lecture Notes in Computer Science, New Brunswick, NJ, July/August 1996. Springer-Verlag.
2. R. Alur and T.A. Henzinger. Reactive modules. Formal Methods in System Design, 15(1):7-48, 1999.
3. Nikolaj Bjørner, I. Anca Browne, and Zohar Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49-87, 1997.
4. 20 states and beyond. Information and Computation, 98(2):142-170, June 1992.
5. G. Berry and G. Gonthier. The Esterel synchronous programming language: Design, semantics, and implementation. Science of Computer Programming, 19(2):87-152, 1992.
6. Saddek Bensalem, Vijay Ganesh, Yassine Lakhnech, César Mũnoz, Sam Owre, Harald Rueβ, John Rushby, Vlad Rusu, Hassen Saïdi, N. Shankar, Eli Singerman, and Ashish Tiwari. An overview of SAL. In C. Michael Holloway, editor, LFM 2000: Fifth NASA Langley Formal Methods Workshop, Hampton, VA, June 2000. NASA Langley Research Center. To appear.
7. Saddek Bensalem and Yassine Lakhnech. Automatic generation of invariants. Formal Methods in Systems Design, 15(1):75-92, July 1999.
8. Saddek Bensalem, Yassine Lakhnech, and Sam Owre. Computing abstractions of infinite state systems compositionally and automatically. In Hu and Vardi [26], pages 319-331.
9. Saddek Bensalem, Yassine Lakhnech, and Hassen Saïdi. Powerful techniques for the automatic generation of invariants. In Alur and Henzinger [1], pages 323-335.
10. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
11. Edmund Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. Counterexample-guided abstraction refinement. In E. A. Emerson and A. P. Sistla, editors, Computer-Aided Verification, Lecture Notes in Computer Science. Springer-Verlag, 2000. To appear.
12. Edmund M. Clarke, Orna Grumberg, and David E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512-1542, September 1994.
13. E. M. Clarke, Orna Grumberg, and Doron Peled. Model Checking. MIT Press, 1999.
14. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables. In 5th ACM Symposium on Principles of Programming Languages. Association for Computing Machinery, January 1978.
15. K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, Reading, MA, 1988.
16. M. A. Col on and T. E. Uribe. Generating finite-state abstractions of reactive systems using decidion procedures. In Hu and Vardi [26], pages 293-304.
17. Satyaki Das, David L. Dill, and Seungjoon Park. Experience with predicate abstraction. In Halbwachs and Peled [25], pages 160-171.
18. David L. Dill. The Murø verification system. In Alur and Henzinger [1], pages 390-393.
19. R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Proc. 15th Work. Protocol Specification, Testing, and Verification,Warsaw, June 1995. North-Holland.
20. Yuri Gurevich. Evolving algebras 1993: Lipari guide. In Egon Börger, editor, Specification and Validation Methods, International Schools for Computer Scientists, pages 9-36. Oxford University Press, Oxford, UK, 1995.
21. S. M. German and B. Wegbreit. A synthesizer for inductive assertions. IEEE Transactions on Software Engineering, 1(1):68-75, March 1975.
22. N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. The synchronous dataflow programming language Lustre. Proceedings of the IEEE, 79(9):1305-1320, September 1991.
23. C. A. R. Hoare. An axiomatic basis of computer programming. Communications of the ACM, 12(10):576-580, October 1969.
24. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
25. Nicolas Halbwachs and Doron Peled, editors. Computer-Aided Verification, CAV '99, volume 1633 of Lecture Notes in Computer Science, Trento, Italy, July 1999. Springer-Verlag.
26. Alan J. Hu and Moshe Y. Vardi, editors. Computer-Aided Verification, CAV '98, volume 1427 of Lecture Notes in Computer Science, Vancouver, Canada, June 1998. Springer-Verlag.
27. S. Katz and Z. Manna. Logical analysis of programs. Communications of the ACM, 19(4):188-206, April 1976.
28. Leslie Lamport. The temporal logic of actions. ACM TOPLAS, 16(3):872-923, May 1994.
29. 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:11-44, 1995.
30. Kenneth L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Boston, MA, 1993.
31. Zohar Manna and Amir Pnueli. The Temporal Logic of Reactive and Concurrent Systems, Volume 1: Specification. Springer-Verlag, New York, NY, 1992.
32. Zohar Manna and The STeP Group. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Alur and Henzinger [1], pages 415-418.
33. A. Pnueli. The temporal logic of programs. In Proc. 18th Symposium on Foundations of Computer Science, pages 46-57, Providence, RI, November 1977. ACM.
34. Hassen Saïdi. A tool for proving invariance properties of concurrent systems automatically. In Tools and Algorithms for the Construction and Analysis of Systems TACAS '96, volume 1055 of Lecture Notes in Computer Science, pages 412-416, Passau, Germany, March 1996. Springer-Verlag.
35. Hassen Saïdi and Susanne Graf. Construction of abstract state graphs with PVS. In Orna Grumberg, editor, Computer-Aided Verification, CAV '97, volume 1254 of Lecture Notes in Computer Science, pages 72-83, Haifa, Israel, June 1997. Springer-Verlag.
36. N. Suzuki and K. Ishihata. Implementation of an array bound checker. In 4th ACM Symposium on Principles of Programming Languages, pages 132-143, January 1977.
37. Hassen Saïdi and N. Shankar. Abstract and model check while you prove. In Halbwachs and Peled [25], pages 443-454.
38. Moshe Y. Vardi and Pierre Wolper. An automata-theoretic approach to automatic program verification (preliminary report). In Proceedings 1st Annual IEEE Symp. on Logic in Computer Science, pages 332-344. IEEE Computer Society Press, 1986.