Improved SAT based bounded model checking

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

Volumn 3959 LNCS, Issue , 2006, Pages 611-620

  Zhou, Conghua ^a   Ding, Decheng ^a  

^a NANJING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOUNDARY CONDITIONS; COMPUTATION THEORY; ENCODING (SYMBOLS); INTEGER PROGRAMMING; MATHEMATICAL MODELS;

BOUNDED MODEL CHECKING(BMC); BOUNDED PATHS; BUG HUNTING;

COMPUTER SCIENCE;

EID: 33745844864     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11750321_58     Document Type: Conference Paper

References (14)

1. E. M. Clarke, O. Grumberg, and D. Peled. Model checking. MIT Press, Cambridge, MA, 2000.
2. M. Ben-Ari. Z. Manna, and A. Pnueli. The temporal logic of branching time. Acta Information, 20: 207-226, 1983.
3. A. Pnueli. A temporal logic of concurrent programs. Theoretical Computer Science, 13:45-60.
4. K. L. McMillan. Symbolic model checking. Kluwer Academic Publishers, 1993.
5. J. R. Burch, E. M. Clarke, and K. L. McMillan. Symbolic model checking: 1020 states and beyond. Information and Computation, 98: 142-170, 1992.
6. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35: 677-691, 1986.
7. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proceedings of Tools and Algorithms for the Analysis and Construction of Systems (TACAS99). LNCS, 1579, 193-207, Springer-Verlag,1999.
8. H. Jin, F. Somenzi. An incremental algorithm to check satisfiability for bounded model checking. Electronic Notes in Theoretical Computer Science 119:51-65, 2005.
9. H. Jin, M. Awedh, and F. Somenzi. CirCUs: A satisfiability solver geared towards bounded model checking. In CAV, 2004. LNCS 3114.
10. Timo Latvala, Armin Biere, Keijo Heljanko, and Tommi Junttila. Simple is better: Efficient bounded model checking for past LTL. In Proc. of the 6th International Conference on Verification, Model Checking and Abstract Interpretation(VMCAI'05), 2005. LNCS 3385.
11. Timo Latvala, Armin Biere, Keijo Heljanko, and Tommi Junttila. Simple bounded LTL model checking. In Proc. of the 5th International Conference on Formal Methods in Computer-Aided Design(FMCAD'04), 2004. LNCS 3312.
12. Alan Frisch, Daniel Sheridan, and Toby Walsh. A fixpoint based encoding for bounded model checking. In Proc. of the 3th International Conference on Formal Methods in Computer-Aided Design(FMCAD'02), 2002. LNCS 2517.
13. O. Shtrichman. Pruning techniques for the SAT-based Bounded Model Checking Problem. In Proc. of the 11th Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME'01), 2000.
14. O. Shtrichman. Tuning SAT checkers for Bounded Model-Checking. In CAV, 2000. LNCS 1855.