Applying sat methods in unbounded symbolic model checking

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

Volumn 2404, Issue , 2002, Pages 250-264

  McMillan, Ken L ^a  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; COMPUTER AIDED ANALYSIS;

BENCH-MARK PROBLEMS; COMPOSITIONAL VERIFICATION; CONJUNCTIVE NORMAL FORMS; MICROPROCESSOR DESIGNS; QUANTIFIER ELIMINATION; SAT-BASED; SYMBOLIC MODEL CHECKING;

MODEL CHECKING;

EID: 70350777567     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45657-0_19     Document Type: Conference Paper

References (17)

1. P. A. Abdulla, P. Bjesse, and N. Een. Symbolic reachability analysis based on SAT-solvers. In TACAS 2000, volume 1785 of LNCS. Springer-Verlag, 2000.
2. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In TACAS 1999, pages 193-207, 1999.
3. P. Bjesse. Symbolic model checking with sets of states represented as formulas. Technical Report CS-1999-100, Department of Computer Science, Chalmers technical university, March 1999.
4. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8), 1986.
5. J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic model checking with partitioned transition relations. In A. Halaas and P. B. Denyer, editors, VLSI’91, Edinburgh, Scotland, August 1991.
6. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and J. Hwang. Symbolic model checking: 102 ◦ states and beyond. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, June 1990.
7. O. C C. Berthet, and J.-C. Madre. Verification of synchronous sequential machines based on symbolic execution. In Joseph Sifakis, editor, Automatic Verification Methods for Finite State Systems, International Workshop, Grenoble, France, volume 407 of Lecture Notes in Computer Science. Springer-Verlag, June 1989.
8. E. M. Clarke and E. A. Emerson. Synthesis of synchronization skeletons for branching time temporal logic. In Dexter Kozen, editor, Logic of Programs: Workshop, volume 131 of Lecture Notes in Computer Science, Yorktown Heights, New York, May 1981. Springer-Verlag.
9. A. Gupta, Z. Yang, P. Ashar, and A. Gupta. SAT-based image computation with application in reachability analysis. In FMCAD 2000, pages 354-371, 2000.
10. R. Jhala and K. L. McMillan. Microarchitecture verification by compositional model checking. 2001.
11. A. Kuehlmann and F. Krohm. Equivalence checking using cuts and heaps. In Design Automation Conf., pages 263-268, 1997.
12. K. L. McMillan. Symbolic Model Checking. Kluwer, 1993.
13. M. W. Moskewicz, C. F. Madigan, Y. Z.L. Z., and S. Malik. Chaff: Engineering an efficient SAT solver. In Design Automation Conference, pages 530-535, 2001.
14. R. Rudell. Dynamic variable ordering for binary decision diagrams. In Proc. Intl. Conf. on Computer-Aided Design, pages 42-47, 1993.
15. M. Sheeran, S. Singh, and G. Stalmarck. Checking safety properties using induction and a sat-solver. In Formal Methods in Computer Aided Design, 2000.
16. J. P. M. Silva and K. A. Sakallah. Grasp-a new search algorithm for satisfiability. In Proceedings of the International Conference on Computer-Aided Design, November 1996, 1996.
17. P. F. Williams, A. Biere, E. M. Clarke, and A. Gupta. Combining decision diagrams and SAT procedures for efficient symbolic model checking. In Computer Aided Verification, pages 124-138, 2000.