Computing over-approximations with bounded model checking

Electronic Notes in Theoretical Computer Science

Volumn 144, Issue 1 SPEC. ISS, 2006, Pages 79-92

  Kroening, Daniel ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Bounded model checking; Safety property; SAT procedure

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; AUTOMATA THEORY; COMPUTATIONAL METHODS;

BOUNDED MODEL CHECKING; SAFETY PROPERTIES; SAT PROCEDURE;

DATA STRUCTURES;

EID: 30344471054     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.07.021     Document Type: Conference Paper

References (28)

1. M. Awedh, and F. Somenzi Proving more properties with bounded model checking R. Alur D.A. Peled 16th International Conference on Computer Aided Verification (CAV) Lecture Notes in Computer Science 3114 2004 96 108
2. Ball, T. and S. Rajamani, Boolean programs: A model and process for software analysis, Technical Report 2000-14, Microsoft Research (2000)
3. S. Barner, D. Geist, and A. Gringauze Symbolic localization reduction with reconstruction layering and backtracking E. Brinksma K.G. Larsen Proceedings of the 14th International Conference on Computer Aided Verification Lecture Notes in Computer Science 2404 2002 65 77
4. Baumgartner, J. and A. Kuehlmann, Enhanced diameter bounding via structural transformation, in: Design, Automation and Test in Europe Conference and Exposition (DATE) (2004), pp. 36-41
5. J. Baumgartner, A. Kuehlmann, and J.A. Abraham Property checking via structural analysis E. Brinksma K.G. Larsen Proceedings of the 14th International Conference on Computer Aided Verification (CAV) Lecture Notes in Computer Science 2404 2002 151 165
6. A. Biere, A. Cimatti, E. Clarke, and Y. Yhu Symbolic model checking without BDDs Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS) Lecture Notes in Computer Science 1579 1999 193 207
7. 20 states and beyond Information and Computation 98 1992 142 170
8. P. Chauhan, E.M. Clarke, J.H. Kukula, S. Sapra, H. Veith, and D. Wang Automated abstraction refinement for model checking large state spaces using sat based conflict analysis M. Aagaard J.W. O'Leary 4th International Conference on Formal Methods in Computer-Aided Design (FMCAD) Lecture Notes in Computer Science 2517 2002 33 51
9. Clarke, E., O. Grumberg, S. Jha, Y. Lu and V. H., Counterexample-guided abstraction refinement, in: CAV, 2000, pp. 154-169
10. E. Clarke, O. Grumberg, and D. Peled Model Checking 1999 MIT Press
11. E. Clarke, D. Kroening, O. Strichman, and J. Ouaknine Completeness and complexity of bounded model checking 5th International Conference on Verification, Model Checking, and Abstract Interpretation Lecture Notes in Computer Science 2937 2004 85 96
12. E.M. Clarke, and E.A. Emerson Synthesis of synchronization skeletons for branching time temporal logic Logic of Programs: Workshop LNCS 131 1981 Springer-Verlag
13. E.M. Clarke, A. Gupta, J.H. Kukula, and O. Strichman SAT based abstraction-refinement using ILP and machine learning techniques E. Brinksma K.G. Larsen Proceedings of the 14th International Conference on Computer Aided Verification (CAV) Lecture Notes in Computer Science 2404 2002 265 279
14. F. Copty, L. Fix, R. Fraer, E. Giunchiglia, G. Kamhi, A. Tacchella, and M.Y. Vardi Benefits of bounded model checking at an industrial setting G. Berry H. Comon A. Finkel Proceedings of the 13th International Conference on Computer Aided Verification (CAV 2001) Lecture Notes in Computer Science number 2102 2001 436 453
15. Das, S. and D. Dill, Successive approximation of abstract transition relations, in: 16th Annual IEEE Symposium on Logic in Computer Science (LICS) (2001), pp. 51-60
16. Kroening, D. and E. Clarke, Checking consistency of C and Verilog using predicate abstraction and induction, in: Proceedings of ICCAD (2004), pp. 66-72
17. D. Kroening, and O. Strichman Efficient computation of recurrence diameters L. Zuck P. Attie A. Cortesi S. Mukhopadhyay 4th International Conference on Verification, Model Checking, and Abstract Interpretation Lecture Notes in Computer Science 2575 2003 298 309
18. Kuehlmann, A. and F. Krohm, Equivalence checking using cuts and heaps, in: Proceedings of the 34th annual conference on Design automation (DAC) (1997), pp. 263-268
19. R. Kurshan Computer-aided verification of coordinating processes: the automata-theoretic approach 1994 Princeton University Press
20. B. Li, C. Wang, and F. Somenzi Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure International Journal on Software Tools for Technology Transfer (STTT) 7 2005 143 155
21. McMillan, K., Applying SAT methods in unbounded symbolic model checking, in: 14th Conference on Computer Aided Verification, 2002, pp. 250-264
22. K. McMillan, and N. Amla Automatic abstraction without counterexamples Proceedings of the 9th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS) Lecture Notes in Computer Science 2003
23. K.L. McMillan Interpolation and SAT-based model checking W.A.H. Jr. F. Somenzi Proceedings of the 15th International Conference on Computer Aided Verification (CAV) Lecture Notes in Computer Science 2725 2003 1 13
24. Mneimneh, M. and K. Sakallah, SAT-based sequential depth computation, in: Proceedings of Asia South Pacific Design Automation Conference (ASPDAC), 2003, pp. 87-92
25. Moskewicz, M., C. Madigan, Y. Zhao, L. Zhang and S. Malik, Chaff: Engineering an efficient SAT solver, in: DAC, 2001, pp. 530-535
26. Sheeran, M., S. Singh and G. Stålmarck, Checking safety properties using induction and a SAT-solver, in: Third International Conference on Formal Methods in Computer-Aided Design (FMCAD) (2000), pp. 108-125
27. O. Shtrichman Tuning SAT checkers for bounded model checking E. Emerson A. Sistla Proceedings of the 12th International Conference on Computer Aided Verification (CAV 2000) Lecture Notes in Computer Science 2000 480 494
28. Wang, D., P. Ho, J. Long, J. Kukula, Y. Zhu, T. Ma and R. Damiano, Formal property verification by abstraction refinement with formal, simulation and hybrid engines, in: DAC, 2001, pp. 35-40