An incremental algorithm to check satisfiability for bounded model checking

Electronic Notes in Theoretical Computer Science

Volumn 119, Issue 2, 2005, Pages 51-65

  Jin, HoonSang ^a   Somenzi, Fabio ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

Bounded model checking; Conflict learned clauses; Incremental algorithms; Propositional satisfiability

Indexed keywords

BOUNDED MODEL CHECKING; CONFLICT-LEARNED CLAUSES; INCREMENTAL ALGORITHMS; PROPOSITIONAL SATISFIABILITY;

ALGORITHMS; DATA STRUCTURES; MATHEMATICAL MODELS; PROBLEM SOLVING; SEMANTICS;

BOOLEAN ALGEBRA;

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

References (27)

1. M. Awedh and F. Somenzi. Proving more properties with bounded model checking. In R. Alur and D. Peled, editors, Sixteenth Conference on Computer Aided Verification (CAV'04). Springer-Verlag, Berlin, July 2004. To appear
2. M. Benedetti and S. Bernardini. Incremental compilation-to-SAT procedures. In International Conference on Theory and Applications of Satisfiability Testing (SAT 2004), Vancouver, Canada, May 2004
3. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Fifth International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'99), pages 193-207, Amsterdam, The Netherlands, Mar. 1999. LNCS 1579
4. R.K. Brayton VIS: A system for verification and synthesis T. Henzinger R. Alur Eighth Conference on Computer Aided Verification (CAV'96) LNCS 1102 1996 Springer-Verlag Rutgers University 428 432
5. R.E. Bryant Graph-based algorithms for Boolean function manipulation IEEE Transactions on Computers C-35 8 Aug. 1986 677 691
6. E. Clarke, D. Kroening, J. Ouaknine, and O. Strichman Completeness and complexity of bounded model checking Verification, Model Checking, and Abstract Interpretation, Venice, Italy LNCS 2937 Jan. 2004 Springer 85 96
7. M. Davis, G. Logemann, and D. Loveland A machine program for theorem proving Communications of the ACM 5 1962 394 397
8. M. Davis, and H. Putnam A computing procedure for quantification theory Journal of the Association for Computing Machinery 7 3 July 1960 201 215
9. N. Eén, and N. Sörensson Temporal induction by incremental SAT solving Electronic Notes in Theoretical Computer Science 89 4 2003
10. First International Workshop on Bounded Model Checking http://www.elsevier.nl/locate/entcs/
11. M.K. Ganai, P. Ashar, A. Gupta, L. Zhang, and S. Malik. Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver. In Proceedings of the Design Automation Conference, pages 747-750, New Orleans, LA, June 2002
12. E. Goldberg and Y. Novikov. BerkMin: A fast and robust SAT-solver. In Proceedings of the Conference on Design, Automation and Test in Europe, pages 142-149, Paris, France, Mar. 2002
13. J.N. Hooker Solving the incremental satisfiability problem Journal of Logic Programming 15 1-2 Jan. 1993 177 186
14. H. Jin, M. Awedh, and F. Somenzi. CirCUs: A satisfiability solver geared towards bounded model checking. In R. Alur and D. Peled, editors, Sixteenth Conference on Computer Aided Verification (CAV'04). Springer-Verlag, Berlin, July 2004. To appear
15. H. Jin and F. Somenzi. CirCUs: A hybrid satisfiability solver. In International Conference on Theory and Applications of Satisfiability Testing (SAT 2004), Vancouver, Canada, May 2004
16. J. Kim, J. Whittemore, J.P.M. Silva, and K.A. Sakallah. On solving stack-based incremental satisfiability problems. In Proceedings of the International Conference on Computer Design, pages 379-382, Sept. 2000
17. A. Kuehlmann, M.K. Ganai, and V. Paruthi. Circuit-based Boolean reasoning. In Proceedings of the Design Automation Conference, pages 232-237, Las Vegas, NV, June 2001
18. 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 Orleans, Jan. 1985
19. K.L. McMillan Interpolation and SAT-based model checking W.A. Hunt Jr. F. Somenzi Fifteenth Conference on Computer Aided Verification (CAV'03) LNCS 2725 July 2003 Springer-Verlag Berlin 1 13
20. M. Sheeran, S. Singh, and G. Stålmarck Checking safety properties using induction and a SAT-solver W.A. Hunt Jr. S.D. Johnson Formal Methods in Computer Aided Design LNCS 1954 Nov. 2000 Springer-Verlag 108 125
21. O. Shtrichman Pruning techniques for the SAT-based bounded model checking problem Correct Hardware Design and Verification Methods (CHARME 2001), Livingston, Scotland LNCS 2144 Sept. 2001 Springer 58 70
22. J.P. M. Silva and K.A. Sakallah. Grasp - a new search algorithm for satisfiability. In Proceedings of the International Conference on Computer-Aided Design, pages 220-227, San Jose, CA, Nov. 1996
23. URL http://vlsi.colorado.edu/~vis
24. C. Wang, H. Jin, G.D. Hachtel, and F. Somenzi. Refining the SAT decision ordering for bounded model checking. In Proceedings of the Design Automation Conference, pages 535-538, San Diego, CA, June 2004
25. J. Whittemore, J. Kim, and K. Sakallah. SATIRE: A new incremental satisfiability engine. In Proceedings of the Design Automation Conference, pages 542-545, Las Vegas, NV, June 2001
26. H. Zhang. SATO: An efficient propositional prover. In Proceedings of the International Conference on Automated Deduction, pages 272-275, July 1997. LNAI 1249
27. L. Zhang, C. Madigan, M. Moskewicz, and S. Malik. Efficient conflict driven learning in Boolean satisfiability solver. In Proceedings of the International Conference on Computer-Aided Design, pages 279-285, San Jose, CA, Nov. 2001