Automatic invariant strengthening to prove properties in bounded model checking

Proceedings - Design Automation Conference

Volumn , Issue , 2006, Pages 1073-1076

  Awedh, Mohammad ^a   Somenzi, Fabio ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

Bounded model checking; SAT

Indexed keywords

BYPRODUCTS; COMPUTATION THEORY; MATHEMATICAL MODELS; REQUIREMENTS ENGINEERING;

BOUNDED MODEL CHECKING; PREIMAGE COMPUTATIONS; SAT; TERMINATION CHECKS;

MODEL CHECKING;

EID: 34547169076     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1146909.1147180     Document Type: Conference Paper

References (15)

1. R. Armoni, L. Fix, R. Fraer, S. Huddleston, N. Piterman, and M. Vardi. SAT-based induction for temporal safety properties. In BMC, Boston, MA, July 2004.
2. M. Awedh and F. Somenzi. Increasing the robustness of bounded model checking by computing lower bounds on the reachable states. In FMCAD, pages 230-244, Austin, TX, Nov. 2004. Springer. LNCS 3312.
3. M. Awedh and F. Somenzi. Proving more properties with bounded model checking. In R. Alur and D. Peled, editors, CAV, pages 96-108. Springer-Verlag, Berlin, July 2004. LNCS 3114.
4. M. Awedh and F. Somenzi. Termination criteria for bounded model checking: Extensions and comparison. In BMC, Edimburgh, UK, July 2005. To appear in Electronic Notes in Theoretical Computer Science.
5. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In TACAS, pages 193-207, Amsterdam, The Netherlands, Mar. 1999. LNCS 1579.
6. R. K. Brayton et al. VIS: A system for verification and synthesis. In T. Henzinger and R. Alur, editors, CAV'96, pages 428-432. Springer-Verlag, Rutgers University, 1996. LNCS 1102.
7. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, Aug. 1986.
8. E. Clarke, D. Kröning, J. Ouaknine, and O. Strichman. Completeness and complexity of bounded model checking. In VMCAI, pages 85-96, Venice, Italy, Jan. 2004. Springer. LNCS 2937.
9. H. Jin, M. Awedh, and F. Somenzi. CirCUs: A satisfiability solver geared towards bounded model checking. In R. Alur and D. Peled, editors, CAV, pages 519-522. Springer-Verlag, Berlin, July 2004. LNCS 3114.
10. H. Jin, H. Han, and F. Somenzi. Efficient conflict analysis for finding all satisfying assignments of a Boolean circuit. In TACAS, pages 287-300, Apr. 2005. LNCS 3440.
11. H. Jin and F. Somenzi. Prime clauses for fast enumeration of satisfying assignments to Boolean circuits. In DAC, pages 750-753, Anaheim, CA, June 2005.
12. K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In E. Brinksma and K. G. Larsen, editors, CAV, pages 250-264. Springer-Verlag, Berlin, July 2002. LNCS 2404.
13. K. L. McMillan. Interpolation and SAT-based model checking. In W. A. Hunt, Jr. and F. Somenzi, editors, CAV, pages 1-13. Springer-Verlag, Berlin, July 2003. LNCS 2725.
14. M. Sheeran, S. Singh, and G. Stålmarck. Checking safety properties using induction and a SAT-solver. In W. A. Hunt, Jr. and S. D. Johnson, editors, FMCAD, pages 108-125. Springer-Verlag, Nov. 2000. LNCS 1954.
15. URL: http://vlsi.colorado.edu/~vis.