Stepping forward with interpolates in unbounded model checking

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn , Issue , 2006, Pages 772-778

  Cabodi, Gianpiero ^a   Murciano, Marco ^a   Nocco, Sergio ^a   Quer, Stefano ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; BOOLEAN FUNCTIONS; DESIGN;

(PL) PROPERTIES; BUG HUNTING; COMPUTER-AIDED DESIGN; CRAIG INTERPOLANTS; EXPERIMENTAL RESULTS; INTERNATIONAL CONFERENCES; INTERPOLANT; INTERPOLANTS; PAPER ADDRESSES; REDUNDANCY REMOVAL; SATISFIABILITY (SAT) SOLVERS; STATE SETS; UNBOUNDED MODEL CHECKING;

MODEL CHECKING;

EID: 40549089117     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2006.320119     Document Type: Conference Paper

References (17)

1. M. Sheeran, S. Singh, and G. Stålmarck, Checking Safety Properties Using Induction and SAT Solver. In W. A. Hunt and S. D. Johnson, editors, Proc. Formal Methods in Computer-Aided Design, volume 1954 of LNCS, pages 108-125. Springer-Verlag, November 2000.
2. K. L. McMillan. Applying SAT Methods in Unbounded Symbolic Model Checking. In Ed Brinksma and Kim Guldstrand Larsen, editors, Proc. Computer Aided Verification, volume 2404 of LNCS, pages 250-264, Copenhagen, Denmark, 2002.
3. M. K. Ganai, A. Gupta, and P. Ashar. Efficient SAT-based Unbounded Symbolic Model Checking Using Circuit Cofactoring. In Proc. Int'l Conf. on Computer-Aided Design, San Jose, California, November 2004.
4. K. L. McMillan. Interpolation and SAT-Based Model Checking. In Warren A. Hunt Jr. and Fabio Somenzi, editors, Proc. Computer Aided Verification, volume 2725 of LNCS, pages 1-13, Boulder, CO, USA, 2003.
5. J. Marque-Silva. Improvements to the implementation of Interpolant-Based Model Checking. In D. Borrione and W. Paul, editors, Proc. Computer Aided Verification, volume 3725 of LNCS, pages 367-370, Edimburgh, Scotlan, UK, 2005.
6. Berkeley Logic Synthesis and Verification Group. ABC: A System for Sequential Synthesis and Verification, http://www.eecs.berkeley.edu/∼alanmi/ abc/.
7. K. L. McMillan and R. Jhala. Interpolation and SAT-Based Model Checking. In Proc. Computer Aided Verification, Edimburgh, Scotlan, UK, 2005.
8. B. Lin, C. Wang, and F. Sornenzi. A Satisfiability-Based Approach to Abstraction Refinement in Model Checking. In BMC'03: First International Workshop on Bounded Model Checking, Boulder, Colorado, July 2003.
9. 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 M. D. Aagaard and J. W. O'Leary, editors, Proc. Formal Methods in Computer-Aided Design, volume 2517 of LNCS, pages 35-51, November 2002.
10. V. Manquinho and J. Marques-Silva. Search Pruning Techniques in SAT-based Branch-and-Bound Algorithms for the Binate Covering Problem. IEEE Trans. on Computer-Aided Design, 21:505-516, 2002.
11. M. Berkelaar and K. van Eijk. Efficient and Effective Redundancy Removal for Million-Gate Circuits. In Proc. Design Automation & Test in Europe Conf., pages 1088-1088, Paris, Prance, March 2002.
12. A. Mishchenko and R. K. Brayton. Scalable Logic Synthesis using a Simple Circuit Structure. In Proc. Int'l Workshop on Logic Synthesis, Lake Tahoe, California, May 2006.
13. A. Mishchenko and R. K. Brayton. Improvements to Combinational Equivalence Checking. In Proc. Int'l Conf. on Computer-Aided Design, San Jose, California, November 2006.
14. P. A. Abdulla, P. Bjesse, and N. Een. Symbolic Reachability Analysis based on SAT-Solvers. In TACAS 2000 - Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science 1785, Springer Verlag, pages 411-425, Upsala University, Prover Technology, Chalmers University, Sweden, April 2000.
15. G. Cabodi, S. Nocco, and S. Quer. Circuit Based Quantification: Back to State Set Manipulation within Unbounded Model Checking. In Proc. Design Automation & Test in Europe Conf., Munich, Germany, March 2005.
16. N. Eén and N. Sörensson. Minisat SAT Solver, http://www.cs.chalmers.se/Cs/Research/Formal-Methods/MiniSat/.
17. IBM Formal Verification Benchmark Library. http://www.haifa.il.ibm.com/ projects/verification/-rb_homepage/fvbenchmarks.html.