Model checking with Boolean Satisfiability

Journal of Algorithms

Volumn 63, Issue 1-3, 2008, Pages 3-16

  Marques Silva, Joao ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Boolean satisfiability; Interpolation; Model checking; Resolution refutation

Indexed keywords

BOOLEAN FUNCTIONS;

BOOLEAN SATISFIABILITY; BOUNDED MODEL CHECKING; INTERPOLATION; RESOLUTION REFUTATION; SAT SOLVERS; UNBOUNDED MODEL CHECKING;

MODEL CHECKING;

EID: 49449103561     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2008.02.007     Document Type: Article

References (38)

1. L. Baptista, J.P. Marques-Silva, Using randomization and learning to solve hard real-world instances of satisfiability, in: International Conference on Principles and Practice of Constraint Programming, September 2000, pp. 489-494
2. Beame P., Kautz H.A., and Sabharwal A. Towards understanding and harnessing the potential of clause learning. J. Artificial Intelligence Res. 22 (2004) 319-351
3. Biere A. Hardware model checking competition (July 2007). http://fmv.jku.at/hwmcc/
4. Biere A., Cimatti A., Clarke E., Strichman O., and Zhu Y. Advances in Computers (2003), Academic Press chapter Bounded Model Checking
5. A. Biere, A. Cimatti, E. Clarke, Y. Zhu, Symbolic model checking without BDDs, in: Tools and Algorithms for the Construction and Analysis of Systems, March 1999, pp. 193-207
6. P. Bjesse, K. Claesen, SAT-based verification without state space traversal, in: Formal Methods in Computer-Aided Design, 2000, pp. 372-389
7. G. Cabodi, M. Murciano, S. Nocco, S. Quer, Stepping forward with interpolants in unbounded model checking, in: International Conference on Computer-Aided Design, 2006, pp. 772-778
8. P. Chauhan, E. Clarke, J. Kukula, S. Sapra, H. Veith, D. Wang, Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis, in: Formal Methods in Computer-Aided Design, 2002, pp. 33-51
9. Clarke E.M., Grumberg O., and Peled A. Model Checking (1999), MIT Press
10. F. Copty, L. Fix, R. Fraer, E. Giunchiglia, G. Kamhi, A. Tacchella, M.Y. Vardi, Benefits of bounded model checking at an industrial setting, in: Computer-Aided Verification, 2001, pp. 436-453
11. Craig W. Linear reasoning: A new form of the Herbrand-Gentzen theorem. J. Symbolic Logic 22 3 (1957) 250-268
12. Davis M., Logemann G., and Loveland D. A machine program for theorem-proving. Comm. of the ACM 5 (July 1962) 394-397
13. Davis M., and Putnam H. A computing procedure for quantification theory. J. ACM 7 (July 1960) 201-215
14. N. Een, N. Sörensson, An extensible SAT solver, in: International Conference on Theory and Applications of Satisfiability Testing, May 2003, pp. 502-518
15. Een N., and Sörensson N. Temporal induction by incremental SAT solving. Workshop on Bounded Model Checking. Electron. Notes Theor. Comput. Sci. vol. 89 (2003), Elsevier
16. M. Glusman, G. Kamhi, S. Mador-Haim, R. Fraer, M. Vardi, Multiple-counterexample guided iterative abstraction refinement, in: Tools and Algorithms for the Construction and Analysis of Systems, April 2003, pp. 176-191
17. E. Goldberg, Y. Novikov, BerkMin: A fast and robust SAT-solver, in: Design, Automation and Testing in Europe Conference, March 2002, pp. 142-149
18. C.P. Gomes, B. Selman, H. Kautz, Boosting combinatorial search through randomization, in: AAAI Conference on Artificial Intelligence, July 1998, pp. 431-437
19. A. Gupta, M. Ganai, Z. Yang, P. Ashar, Iterative abstraction using SAT-based BMC with proof analysis, in: International Conference on Computer-Aided Design, November 2003, pp. 416-423
20. Huth M., and Ryan M. Logic in Computer Science. 2nd ed. (2004), Cambridge Univ. Press
21. H.-J. Kang, I.-C. Park, SAT-based unbounded symbolic model checking, in: Design Automation Conference, June 2003, pp. 840-843
22. Krajicek J. Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic. J. Symbolic Logic 62 2 (1997) 457-486
23. J. Marques-Silva, Improvements to the implementation of interpolant-based model checking, in: Advanced Research Working Conference on Correct Hardware Design and Verification Methods, October 2005, pp. 367-370
24. J. Marques-Silva, Interpolant learning and reuse in SAT-based model checking, in: Electron. Notes Theor. Comput. Sci., vol. 174(3), Elsevier, 2007, pp. 31-43
25. J. Marques-Silva, K. Sakallah, GRASP: A new search algorithm for satisfiability, in: International Conference on Computer-Aided Design, November 1996, pp. 220-227
26. Marques-Silva J., and Sakallah K. GRASP-A search algorithm for propositional satisfiability. IEEE Trans. Comput. 48 5 (1999) 506-521
27. McMillan K.L. Symbolic Model Checking (1993), Kluwer Academic Publ.
28. K.L. McMillan, Applying SAT methods in unbounded symbolic model checking, in: Computer-Aided Verification, July 2002, pp. 250-264
29. K.L. McMillan, Interpolation and SAT-based model checking, in: Computer-Aided Verification, 2003, pp. 1-13
30. K.L. McMillan, N. Amla, Automatic abstraction without counterexamples, in: Tools and Algorithms for the Construction and Analysis of Systems, April 2003, pp. 2-17
31. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik, Engineering an efficient SAT solver, in: Design Automation Conference, June 2001, pp. 530-535
32. Plaisted D.A., and Greenbaum S. A structure-preserving clause form translation. J. Symbolic Comput. 2 3 (1986) 293-304
33. Pudlák P. Lower bounds for resolution and cutting planes proofs and monotone circuit computations. J. Symbolic Logic 62 3 (1997) 981-998
34. M. Sheeran, S. Singh, G. Stalmarck, Checking safety properties using induction and a SAT solver, in: Formal Methods in Computer-Aided Design, 2000, pp. 108-125
35. O. Strichman, Tuning SAT checkers for bounded model checking, in: Computer-Aided Verification, July 2000, pp. 480-494
36. G.S. Tseitin, On the complexity of derivation in propositional calculus, in: Studies in Constructive Mathematics and Mathematical Logic, Part II, 1968, pp. 115-125
37. R. Zabih, D.A. McAllester, A rearrangement search strategy for determining propositional satisfiability, in: AAAI Conference on Artificial Intelligence, July 1988, pp. 155-160
38. L. Zhang and S. Malik, Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications, in: Design, Automation and Testing in Europe Conference, March 2003, pp. 10880-10885