Bounded model checking and induction: From refutation to verification (extended abstract, category A)

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

Volumn 2725, Issue , 2003, Pages 14-26

  De Moura, Leonardo ^a   Rueß, Harald ^a   Sorea, Maria ^a,b  

^a SRI INTERNATIONAL   (United States)

^b UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER AIDED ANALYSIS;

BOUNDED MODEL CHECKING; DISJUNCTIVE NORMAL FORM; HYBRID AUTOMATONS; INFINITE STATE SYSTEMS; QUANTIFIER ELIMINATION; SAFETY PROPERTY; TIMED AUTOMATA;

MODEL CHECKING;

EID: 29244482627     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45069-6_2     Document Type: Article

References (20)

1. P. A. Abdulla, P. Bjesse, and N. Eén. Symbolic reachability analysis based on SAT-solvers. In S. Graf and M. Schwartzbach, editors, TACAS 2000, volume 1785 of LNCS, pages 411-125. Springer-Verlag, 2000.
2. R. Alur. Timed automata. In Computer-Aided Verification, CAV 1999, volume 1633 of Lecture Notes in Computer Science, pages 8-22, 1999.
3. S. Bensalem and Y. Lakhnech. Automatic generation of invariants. Formal Methods in System Design, 15:75-92, 1999.
4. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zh. Symbolic model checking without BDDs. Lecture Notes in Computer Science, 1579, 1999.
5. E. M. Clarke, A. Biere, R. Raimi, and Y. Zhu. Bounded model checking using satisfiability solving. Formal Methods in System Design, 19(1):7-34, 2001.
6. L. de Moura and H. Rueß. Lemmas on demand for satisfiability solvers. Annals of Mathematics and Artificial Intelligence, 2002. Accepted for publication.
7. L. de Moura, H. Rueß, and M. Sorea. Lazy theorem proving for bounded model checking over infinite domains. In Conference on Automated Deduction (CADE), volume 2392 of LNCS, pages 438-455. Springer-Verlag, July 27-30 2002.
8. G. Delzanno. Automatic verification of parameterized cache coherence protocols. In Computer Aided Verification (CAV'00), pages 53-68, 2000.
9. J.-C. Filliâtre, S. Owre, H. Rueß, and N. Shankar. ICS: Integrated Canonization and Solving. In Proceedings of CAV'2001, volume 2102 of Lecture Notes in Computer Science, pages 246-249. Springer-Verlag, 2001.
10. S. M. German and B. Wegbreit. A synthesizer of inductive assertions. IEEE Transactions on Software Engineering, 1(1):68-75, Mar. 1975.
11. S. M. Katz and Z. Manna. A heuristic approach to program verification. In N. J. Nilsson, editor, Proceedings of the 3rd IJCAI, pages 500-512, Stanford, CA, Aug. 1973. William Kaufmann.
12. D. Kroening and O. Strichman. Efficient computation of recurrence diameters. In Proceedings of VMCAI'03, Jan. 2003.
13. 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):11-44, Jan. 1995.
14. K. McMillan. Applying SAT methods in unbounded symbolic model checking. In Computer-Aided Verification, CAV 2002, volume 2404 of LNCS. Springer-Verlag, 2002.
15. O. Coudert, C. Berthet, and J.C. Madre. Verification of synchronous sequential machines using symbolic execution. In Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems, volume 407 of LNCS, pages 365-373, Grenoble, France, June 1989. Springer-Verlag.
16. J. Rushby. Model checking Simpson's four-slot fully asynchronous communication mechanism. Technical report, CSL, SRI International, Menlo Park, Menlo Park, CA, July 2002.
17. M. Sheeran, S. Singh, and G. Stålmarck. Checking safety properties using induction and a SAT-solver. LNCS, 1954:108, 2000.
18. H. R. Simpson. Four-slot fully asynchronous communication mechanism. IEE Proceedings, Part E: Computers and Digital Techniques, 137(1):17-30, Jan. 1990.
19. M. Sorea. Bounded model checking for timed automata. In Proceedings of MTCS 2002, volume 68 of Electronic Notes in Theoretical Computer Science, 2002.
20. P. F. Williams, A. Biere, E. M. Clarke, and A. Gupta. Combining decision diagrams and SAT procedures for efficient symbolic model checking. In Proc. Computer Aided Verification (CAV), volume 1855 of LNCS. Springer-Verlag, 2000.