Experimental analysis of different techniques for bounded model checking

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

Volumn 2619, Issue , 2003, Pages 34-48

  Amla, Nina ^a   Kurshan, Robert ^a   McMillan, Kenneth L ^a   Medel, Ricardo ^b  

^a CADENCE DESIGN SYSTEMS   (United States)

^b STEVENS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; BOOLEAN FUNCTIONS;

BOUNDED MODEL CHECKING; COMMERCIAL DESIGN; EXPERIMENTAL ANALYSIS; EXPLICIT STATE; SAT-BASED;

MODEL CHECKING;

EID: 21144432500     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36577-x_4     Document Type: Article

References (25)

1. P. Bjesse and K. Claessen. SAT-based verification without state space traversal. In FMCAD, 2000.
2. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1579 of LNCS, 1999.
3. 20 states and beyond. In LICS, 1990.
4. A. Biere, E. Clarke, R. Raimi, and Y. Zhu. Verifying safety properties of a PowerPC microprocessor using symbolic model checking without BDDs. In CAV, 1999.
5. R. Brayton, G. Hachtel, A. Sangiovanni-Vincentelli, F. Somenzi, A. Aziz, S. Cheng, S. Edwards, S. Khatri, Y. Kukimoto, A. Pardo, S. Qadeer, R. Ranjan, S. Sarwary, T . Shiple, G. Swamy, and T. Villa. VIS. In FMCAD, 1996.
6. P. Bjesse, T. Leonard, and A. Mokkedem. Finding bugs in an Alpha microprocessor using satisfiability solvers. In CAV, volume 2102 of LNCS, 2001.
7. A. Boralv. The industrial success of verification tools based on stalmarck's method. In CAV, 1997.
8. R. E. Bryant. Graph-based algorithms for boolean function manipulations. IEEE Transactions on Computers, 1986.
9. G. Cabodi, P. Camurati, and S. Quer. Can bdds compete with sat solvers on bounded model checking. In DAC, 2002.
10. E.M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Workshop on Logics of Programs, volume 131 of LNCS, 1981.
11. Fady C., L. Fix, R. Fraer, E. Giunchiglia, G. Kamhi, A. Tacchella, and M. Y. Vardi. Benefits of bounded model checking at an industrial setting. In CAV, volume 2102 of LNCS, 2001.
12. E. Goldberg and Y. Novikov. Berkmin: A fast and robust sat-solver. In DATE, 2002.
13. Z. Har'El and R. P. Kurshan. Software for analytical development of communications protocols. AT&T Technical Journal, 69(1), 1990.
14. A. Kuehlmann and F. Krohm. Equivalence checking using cuts and heaps. In DAC, 1997.
15. D. Kroening and O. Strichman. Efficient computation of recurrence diameters. In VMCAI, 2002.
16. R. Kurshan. Computer-aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, 1994.
17. K. McMillan. Symbolic model checking: An approach to the state explosion problem. Kluwer Academic Publishers, 1993.
18. K. McMillan. Getting started with smv, 1999. URL: http://www-cad.eecs.berkeley.edu/k̃enmcmil.
19. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference (DAC'01), 2001.
20. Marques-Silva and Sakallah. GRASP: A search algorithm for prepositional satisfiability. IEEETC: IEEE Transactions on Computers, 48, 1999.
21. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proc. of the 5th International Symposium on Programming, volume 137 of LNCS, 1982.
22. M. Sheeran and G. Stålmarck. A tutorial on Stålmarck's proof procedure for propositional logic. In CAV, volume 1522 of LNCS, 1998.
23. O. Strichman. Tuning SAT checkers for bounded model checking. In CAV, 2000.
24. M. N. Velev and R. E. Bryant. Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW. In Proceedings of the 38th Conference on Design Automation Conference 2001, 2001.
25. H. Zhang. SATO: An efficient propositional prover. In Proceedings of the 14th International Conference on Automated deduction, volume 1249 of LNAI, 1997.