Combining abstraction refinement and SAT-based model checking

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

Volumn 4424 LNCS, Issue , 2007, Pages 405-419

  Amla, Nina ^a   McMillan, Kenneth L ^a  

^a CADENCE DESIGN SYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; BENCHMARKING; HEURISTIC METHODS; INTERPOLATION; MODEL CHECKING; PROBLEM SOLVING;

ABSTRACTION REFINEMENT; BOOLEAN SATISFIABILITY; DOMINATING RUNTIME; ORDER-OF-MAGNITUDE REDUCTIONS; ABSTRACTION METHODS; HYBRID APPROACH; MAGNITUDE REDUCTION; SAT-BASED MODEL CHECKING; SEQUENTIAL ATPG; UNBOUNDED MODEL CHECKING;

BOOLEAN FUNCTIONS; MODEL CHECKING;

EID: 37149051045     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71209-1_31     Document Type: Conference Paper

References (28)

1. N. Amla, X. Du, A. Kuehlmann, R. Kurshan, and K. McMillan. An analysis of SAT-based model checking techniques in an industrial environment. In CHARME, 2005.
2. N. Amia and K. McMillan. A hybrid of counterexample-based and proof-based abstraction. In FMCAD, 2004.
3. M. Awedh and F. Somenzi. Increasing the robustness of bounded model checking by computing lower bounds on the reachable states. In FMCAD, 2004.
4. A. Biere, C. Artho, and V. Schuppan. Liveness checking as safety checking. Electronic Notes in Theoretical Computer Science, 66(2), 2002.
5. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In TACAS, 1999.
6. R. E. Bryant. Graph-based algorithms for boolean function manipulations. IEEE Transactions on Computers, 1986.
7. 20 states and beyond. In LICS, 1990.
8. G. Cabodi, S. Nocco, and S. Quer. Improving SAT-based bounded model checking by means of bdd-based approximate traversals. In DATE, 2003.
9. E.M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Workshop on Logics of Programs, 1981.
10. E. A. Emerson. Temporal and modal logic. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics, 1990.
11. E. Goldberg and Y. Novikov. BerkMin: A fast and robust SAT-solver. In DATE, 2002.
12. A. Gupta, M. Ganai, C. Wang, Z. Yang, and P. Ashar. Learning from BDDs in SAT-based bounded model checking. In DAC, 2003.
13. A. Gupta, M. Ganai, Z. Yang, and P. Ashar. Iterative abstraction using SAT-based BMC with proof analysis. In ICCAD, 2003.
14. A. Gupta and O. Strichman. Abstraction refinement for bounded model checking. In CAV, 2005.
15. C.Y. Huang, B. Yang, H.C. Tsai, and K.T. Cheng. Static property checking using atpg versus bdd techniques. In ITC, 2000.
16. M. Iyer, G. Parthasarathy, and K.T. Cheng. SATORI- an efficient sequential SAT solver for circuits. In ICCAD, 2003.
17. O. Kupferman and M. Vardi. Model checking of safety properties. In Formal Methods in System Design, 2001.
18. B. Li and F. Somenzi. Efficient abstraction refinement in interpolation-based unbounded model checking. In TACAS, 2006.
19. B. Li, C. Wang, and F. Somenzi. Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure. In STTT, 2005.
20. J. Marques-Silva. Improvements to the implementation of interpolant-based model checking. In CHARME, 2005.
21. J. Marques-Silva and K. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEETC: IEEE Transactions on Computers, 48, 1999.
22. K. McMillan. Interpolation and SAT-based model checking. In CAV, 2003.
23. K. McMillan and N. Amla. Automatic abstraction without counterexamples. In TACAS, 2003.
24. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In DAC, 2001.
25. M. Prasad, A. Biere, and A. Gupta. A survey of recent advances in SAT-based formal verification. In STTT, 2005.
26. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proc. of the 5th International Symposium on Programming, 1982.
27. K. Ravi and F. Somenzi. Minimal assignments for bounded model checking. In TACAS, 2004.
28. J. Whittemore, J. Kim, and K. Sakallah. SATIRE: A new incremental satisfiability engine. In DAC, 2001.