Interpolant Learning and Reuse in SAT-Based Model Checking

Electronic Notes in Theoretical Computer Science

Volumn 174, Issue 3, 2007, Pages 31-43

  Marques Silva, Joao ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Boolean Satisfiability; Bounded Model Checking; Interpolants

Indexed keywords

BOOLEAN ALGEBRA; INTERPOLATION; LEARNING SYSTEMS; SET THEORY;

BOOLEAN SATISFIABILITY; BOUNDED MODEL CHECKING; INTERPOLANTS; UNBOUNDED MODEL CHECKING (UMC);

MODEL CHECKING;

EID: 34248588793     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.12.021     Document Type: Article

References (29)

1. P.A. Abdulla, P. Bjesse, and N. Eén. Symbolic reachability analysis based on SAT solvers. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2000
2. Biere A., Cimatti A., Clarke E., Strichman O., and Zhu Y. Advances in Computers (2003), Academic Press chapter Bounded Model Checking
3. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pages 193-207, March 1999
4. P. Bjesse and K. Claesen. SAT-based verification without state space traversal. In International Conference on Formal Methods in Computer-Aided Design, 2000
5. P. Chauhan, E. Clarke, J. Kukula, S. Sapra, H. Veith, and D. Wang. Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis. In International Conference on Formal Methods in Computer-Aided Design, 2002
6. Clarke E.M., Grumberg O., and Peled A. Model Checking (1999), MIT Press
7. 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. In International Conference on Computer-Aided Verification, 2001
8. Craig W. Linear reasoning: A new form of the Herbrand-Gentzen theorem. Journal of Symbolic Logic 22 3 (1957) 250-268
9. Davis M., Logemann G., and Loveland D. A machine program for theorem-proving. Communications of the Association for Computing Machinery 5 (July 1962) 394-397
10. Davis M., and Putnam H. A computing procedure for quantification theory. Journal of the Association for Computing Machinery 7 (July 1960) 201-215
11. N. Een and N. Sorensson. An extensible SAT solver. In Sixth International Conference on Theory and Applications of Satisfiability Testing, May 2003
12. N. Een and N. Sorensson. Temporal induction by incremental SAT solving. In Workshop on Bounded Model Checking, volume 89 of ENTCS, 2003
13. M. Glusman, G. Kamhi, S. Mador-Haim, R. Fraer, and M. Vardi. Multiple-counterexample guided iterative abstraction refinement. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, April 2003
14. E. Goldberg and Y. Novikov. BerkMin: a fast and robust SAT-solver. In Design, Automation and Test in Europe Conference, pages 142-149, March 2002
15. C.P. Gomes, B. Selman, and H. Kautz. Boosting combinatorial search through randomization. In National Conference on Artificial Intelligence, pages 431-437, July 1998
16. A. Gupta, M. Ganai, Z. Yang, and P. Ashar. Iterative abstraction using SAT-based BMC with proof analysis. In International Conference on Computer-Aided Design, November 2003
17. H.-J. Kang and I.-C. Park. SAT-based unbounded symbolic model checking. In Design Automation Conference, pages 840-843, June 2003
18. J.P. 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
19. J.P. Marques-Silva and K.A. Sakallah. GRASP: A new search algorithm for satisfiability. In International Conference on Computer-Aided Design, pages 220-227, November 1996
20. K.L. McMillan. Applying SAT methods in unbounded symbolic model checking. In International Conference on Computer-Aided Verification, July 2002
21. K.L. McMillan. Interpolation and SAT-based model checking. In International Conference on Computer-Aided Verification, 2003
22. K.L. McMillan and N. Amla. Automatic abstraction without counterexamples. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, April 2003
23. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Engineering an efficient SAT solver. In Design Automation Conference, pages 530-535, June 2001
24. Plaisted D.A., and Greenbaum S. A structure-preserving clause form translation. Journal of Symbolic Computation 2 3 (September 1986) 293-304
25. Pudlák P. Lower bounds for resolution and cutting planes proofs and monotone circuit computations. Journal of Symbolic Logic 62 3 (1997) 981-998
26. M. Sheeran, S. Singh, and G. Stalmarck. Checking safety properties using induction and a SAT solver. In International Conference on Formal Methods in Computer-Aided Design, 2000
27. O. Strichman. Tuning SAT checkers for bounded model checking. In International Conference on Computer-Aided Verification, July 2000
28. Tseitin G.S. On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic, Part II (1968) 115-125
29. L. Zhang and S. Malik. Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications. In Design, Automation and Test in Europe Conference, pages 10880-10885, March 2003