Model checking with formula-dependent abstract models

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

Volumn 2102, Issue , 2001, Pages 155-168

  Asteroth, Alexander ^a   Baier, Christel ^a   Aßmann, Ulrich ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; COMPUTER AIDED ANALYSIS; ITERATIVE METHODS;

ABSTRACT MODELS; ABSTRACTION REFINEMENT; ABSTRACTION REFINEMENT ALGORITHMS; BISIMULATIONS; FINITE SIMULATION; MODEL CHECKING ALGORITHM; TRANSITION SYSTEM;

MODEL CHECKING;

EID: 33847273233     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44585-4_14     Document Type: Conference Paper

References (40)

1. P. Abdulla, A. Annichini, S. Bensalem, A. Boujjani, P. Habermehl, Y. Lakhnech. Verification of infinite state systems by combining abstraction and reachability analysis. In Proc. CAV’99, LNCS 1633, 1999.
2. R. Alur, D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
3. A. Aziz, T. R. Shiple, V. Singhal, A. L. Sangiovanni-Vincentelli. Formula-dependent equivalence for compositional CTL model checking. Proc. CAV’94, LNCS 818, pp. 324-337, 1994.
4. A. Biere, A. Cimatti, E. Clarke, M. Fujita, Y. Zhu. Symbolic model checking using SAT procedures instead of BDDs. In Design Automation Conference, pp.317-320, 1999.
5. M. Browne, E. Clarke, O. Grumberg. Characterizing finite Kripke structures in Propositional Temporal Logic. Theoretical Computer Science, 59(12):115-131, July 1988.
6. J. Burch, E. Clarke, K. McMillan, D. Dill, L. Hwang. Symbolic model checking 1020 states and beyond. Information and Computation, 1992.
7. A. Bouajjani, Jean-Claude Fernandez, N. Halbwachs. Minimal model generation. Proc. CAV’90, LNCS 531, pp. 197-203, 1990.
8. D. Bustan, O. Grumberg. Simulation based minimization. Computing Science Reports CS-2000-04, Computer Science Department, Technion, Haifa 32000, Israel, 2000.
9. S. Bensalem, Y. Lakhnech, S. Owre. Computing abstractions of infinite state systems compositionally and automatically. LNCS 1427, Proc. CAV’98, pp. 319-331, 1998.
10. F. Balarin, A. Sangiovanni-Vincentelli. An iterative approach to language containment. Proc. CAV’93, LNCS 697, pp. 29-40, 1993.
11. P. Cousot, R. Cousot. Abstract interpretation a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. POPL’77, pp. 238-252, 1977.
12. E. Clarke, O. Grumberg, S. Jha, Y. Lu, H. Veith. Counterexample-guided abstraction refinement. LNCS 1855, Proc. CAV’00, pp. 154-169, 2000.
13. E. Clarke, O. Grumberg, D. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512-1542, September 1994.
14. E. Clarke, O. Grumberg, D. Peled. Model Checking. MIT Press, 2000.
15. E. Clarke, S. Jha, Y. Lu, D. Wang. Abstract BDDs: a technique for using abstraction in model checking. In Proc. Correct Hardware Design and VerificationMethods, LNCS 1703, pp. 172-186, 1999.
16. D. Dams. Abstract Interpretation and Partition Refinement forModel Checking. PhD thesis, Technische Universiteit Einhoven, 1996. 168 Alexander Asteroth, Christel Baier, Ulrich Aßmann
17. J. Dingel, T. Filkorn. Model checking for infinite state systems using data abstraction, assumption commitment style reasoning and theorem proving. In Proc. CAV’95, LNCS 939, pp. 54-69, 1995.
18. D. Dams, R. Gerth, O. Grumberg. Generation of reduced models for checking fragments of CTL. In Proc. CAV’93, LNCS 697, pp. 479-490, 1993.
19. D. Dams, R. Gerth, O. Grumberg. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems, 19(2):253-291, March 1997.
20. E. A. Emerson. Temporal and modal logic. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pp. 995-1072. Elsevier Science Publishers, Amsterdam, The Netherlands, 1990.
21. O. Grumberg, D. Long. Model checking and modular verification. ACM Transactions on Programming Languages and Systems, 16(3):843-871, 1994.
22. P. Godefroid. Partial order methods for the verification of concurrent systems: An approach to the state explosion problem (Ph.D.Thesis, University of Liege) LNCS 1032, 1996.
23. S. Graf, H. Saidi. Construction of abstract state graphs with PVS. In Proc. CAV’97, LNCS 1254, pp 72-83, 1997.
24. M. Henzinger, T. Henzinger, P. Kopke. Computing simulations on finite and infinite graphs. In Proc. FOCS’95, pp. 453-462, IEEE Computer Society Press. 1995.
25. P. Kelb, D. Dams, R. Gerth. Efficient symbolic model checking of the full μ-calculus using compositional abstractions. Computing Science Reports 95/31, Eindhoven University of Technology, 1995.
26. R. Kurshan. Computer-aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, 1994.
27. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6(1):11-44, January 1995.
28. J. Lind-Nielsen, H. Andersen. Stepwise CTL model checking of State/Event systems. In Proc. CAV’99, LNCS 1633, pp. 316-327, 1999.
29. D. Long. Model Checking, Abstraction and Compositional Verification. PhD thesis, Carnegie Mellon University, 1993.
30. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pages 97-107, New York, January 1985. ACM.
31. W. Lee, A. Pardo, J.-Y. Jang, G. Hachtel, F. Somenzi. Tearing based automatic abstraction for ctl model checking. In Proc. ICCAD’96, pp. 76-81, 1996.
32. D. Lee, M. Yannakakis. Online minimization of transition systems. In Proc. STOC’92, pp. 264-274, 1992. ACM Press.
33. K. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
34. K. Namjoshi, R. Kurshan. Syntactic program transformation for automatic abstraction. In Proc. CAV’2000, LNCS 1855, pp. 435-449, 2000.
35. D. Peled. All from one, one from all: on model checking using representatives. In Proc. CAV’93, LNCS 697, pp. 409-423, 1993.
36. A. Pardo, G. Hachtel. Automatic abstraction techniques for propositional μ-calculus model checking. In Proc. CAV’97, LNCS 1254, pp. 12-23, 1997.
37. R. Paige, R. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
38. H. Saidi, N. Shankar. Abstract and model check while you prove. In Proc. CAV’99, LNCS 1633, pp 443-454, 1999.
39. H. B. Sipma, T. E. Uribe, Z Manna. Deductive Model Checking. In Proc. CAV’96, LNCS 1102, pp. 208-219, 1996
40. A. Valmari. State of the art report: Stubborn sets. Petri-Net Newsletters, 46:6-14, 1994.