Abstraction-Based model checking using modal transition systems

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

Volumn 2154, Issue , 2001, Pages 426-440

  Godefroid, Patrice ^a   Huth, Michael ^b   Jagadeesan, Radha ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b Kansas State University   (United States)

^c LOYOLA UNIVERSITY CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; CALCULATIONS; COMPUTER PROGRAMMING LANGUAGES; TEMPORAL LOGIC;

ABSTRACTION TECHNIQUES; AUTOMATIC PROGRAMS; COMPUTATIONAL COSTS; MODAL MU CALCULUS; MODAL TRANSITION SYSTEMS; PATH QUANTIFIERS; UNIVERSAL FORMULAS; UNIVERSAL PROPERTIES;

MODEL CHECKING;

EID: 84944065857     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_29     Document Type: Conference Paper

References (32)

1. T. Ball, A. Podelski, and S. K. Rajamani. Boolean and Cartesian Abstraction for Model Checking C Programs. In T. Margaria and W. Yi, editors, Proceedings of TACAS’2001, volume 2031 of LNCS, pages 268–283, Genova, Italy, April 2001. Springer Verlag.
2. T. Ball and S. K. Rajamani. Bebop: A symbolic model checker for boolean programs. In Proceedings of the Seventh International SPIN Workshop (SPIN 2000), volume 1885, pages 113–130. Springer Verlag, 2000.
3. S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstractions on infinite state systems compositionally and automatically. In A. J. Hu and M. Vardi, editors, Computer Aided Verification (CAV’98), volume 1427, pages 319–331, Vancouver, Canada, 1998. Springer Verlag.
4. G. Bruns and P. Godefroid. Model Checking Partial State Spaces with 3-Valued Temporal Logics. In Proceedings of the 11th Conference on Computer Aided Verification, volume 1633 of Lecture Notes in Computer Science, pages 274–287. Springer Verlag, July 1999.
5. G. Bruns and P. Godefroid. Generalized Model Checking: Reasoning about Partial State Spaces. In Proceedings of CONCUR’2000 (11th International Conference on Concurrency Theory), volume 1877 of Lecture Notes in Computer Science, pages 168–182. Springer Verlag, August 2000.
6. R. R. Bryant. Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams. ACM Computing Surveys, 24(3):293–318, September 1992.
7. E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512–1542, 1994.
8. R. Cleaveland, P. Iyer, and D. Yankelevich. Optimality in abstractions of model checking. In SAS’95: Proc. 2d. Static Analysis Symposium, Lecture Notes in Computer Science 983, pages 51–63. Springer, 1995.
9. J. C. Corbett, M. B. Dwyer, J. Hatcliff, S. Laubach, C. S. Pasareanu, Robby, and H. Zheng. Bandera: Extracting Finite-state Models from Java Source Code. In Proceedings of the 22nd Intl’ Conference on Software Engineering, June 2000.
10. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs. In Proc. 4th ACM Symp. on Principles of Programming Languages, pages 238–252. ACM Press, 1977.
11. P. Cousot and R. Cousot. Temporal abstract interpretation. In Conference Record of the 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 12–25, Boston, Mass., January 2000. ACM Press, New York, NY.
12. D. Dams.: Abstract interpretation and partition refinement for model checking. PhD thesis, Technische Universiteit Eindhoven, The Netherlands, 1996.
13. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems, 19(2):253–291, 1997.
14. S. Das, D. L. Dill, and S. Park. Experience with Predicate Astraction. In N. Halbwachs and D. Peled, editors, Proc. of the 11th International Conference on Computer-Aided Verification, pages 160–172, Trento, Italy, July 1999. Springer Verlag.
15. E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, NewJersey, 1976.
16. P. Godefroid. Model Checking for Programming Languages using VeriSoft. In Proceedings of the 24th ACM Symposium on Principles of Programming Languages, pages 174–186, Paris, January 1997
17. S. Graf and H. Saidi. Construction of abstract state graphs with PVS. In Grumberg O., editor, Conference on Computer-Aided Verification, volume 1254 of Lecture Notes in Computer Science, pages 72–83, Haifa, Israel, June 1997.
18. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137–161, January 1985.
19. M. Huth, R. Jagadeesan, and D. Schmidt. Modal transition systems: a foundation for three-valued program analysis. In D. Sands, editor, Proceedings of the European Symposium on Programming (ESOP’2001), volume 2028 of LNCS, pages 155–169, Genova, Italy, April 2001. Springer Verlag.
20. P. Kelb. Model checking and abstraction: a framework preserving both truth and failure information. Technical Report OFFIS, University of Oldenburg, Germany, 1994.
21. S. C. Kleene. Introduction to Metamathematics. Van Nostrand, 1952.
22. D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333–354, 1983.
23. K. G. Larsen.: Modal Specifications. In J. Sifakis, editor, Automatic Verification Methods for Finite State Systems, number 407 in Lecture Notes in Computer Science, pages 232–246. Springer Verlag, June 12–14 1989. International Workshop, Grenoble, France.
24. K. G. Larsen and B. Thomsen. A Modal Process Logic. In Third Annual Symposium on Logic in Computer Science, pages 203–210. IEEE Computer Society Press, 1988.
25. 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: An International Journal, 6(1):11–44, January 1995.
26. R. Milner. An algebraic definition of simulation between programs. In 2nd International Joint Conference on Artificial Intelligence, pages 481–489, London, United Kingdom, 1971. British Computer Society.
27. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
28. D. M. R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, In Proc. of the 5th GI Conference, volume 104 of Lecture Notes in Computer Science, pages 167–183. Springer Verlag, 1989.
29. A. Pnueli. Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends. In J. W. de Bakker, editor, Current Trends in Concurrency, volume 224 of Lecture Notes in Computer Science, pages 510–584. Springer-Verlag, 1985.
30. H. Saidi and N. Shankar. Abstract and model check while you prove. In Proc. of the 11th Conference on Computer-Aided Verification, number 1633 in Lecture Notes in Computer Science, pages 443–454. Springer, 1999.
31. T. Sasao. Ternary Decision Diagrams — Survey. In Proceedings of the 27th International Symposium on Multi-valued Logic, pages 241–250. IEEE, 1997.
32. W. Visser, S. J. Park, and J. Penix. Using predicate abstraction to reduce objectoriented programs for model checking. In Proc. of Formal Methods in Software Practice (FMSP’00), pages 3–12, Portland, Oregon, August 2000.