SAT-based unbounded symbolic model checking

Proceedings - Design Automation Conference

Volumn , Issue , 2003, Pages 840-843

  Kang, Hyeong Ju ^a   Park, In Cheol ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Boolean satisfiability checking; Formal verification; Symbolic model checking; Unbounded symbolic model checking

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTER AIDED LOGIC DESIGN; ITERATIVE METHODS;

QUANTIFICATION METHODS;

SYSTEMS ANALYSIS;

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

References (12)

1. E. M. Clarke, O. Grumberg, and D. A. Peled, Model Checking, MIT Press, MA: Cambridge, 1999.
2. 20 states and beyond," in Proc. Symp. Logic in Comput. Sci., 1990, pp. 428-439.
3. A. Biere, A. Cimatti, E. M. Clarke, Y. Zhu, "Symbolic model checking without BDDs," in Proc. Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems, vol. 1579 of Lecture Notes in Comput. Sci., 1999, pp. 193-207.
4. M. Davis and H. Putnam, "A computing procedure for quantification theory," Journal of the ACM, vol. 7, pp. 201-205, 1960.
5. M. W. Moskevicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering and efficient SAT solver," in Proc. ACM/IEEE Design Automation Conf., 2001, pp. 530-535.
6. K. L. McMillan, "Applying SAT methods in unbounded symbolic model checking," in Proc. Int. Conf. Computer Aided Verification, vol. 2404 of Lecture Notes in Comput. Sci., 2002, pp. 250-264.
7. A. Gupta, Z. Yang, P. Ashar, and A. Gupta, "SAT-based image computation with application in reachability analysis," in Proc. Int. Conf. Formal Methods in Computer Aided Design of Electron. Circuits, vol. 1954 of Lecture Notes in Comput. Sci., 2000, pp. 354-371.
8. P. F. Williams, A. Biere, E. M. Clarke, and A. Gupta, "Combining decision diagrams and SAT procedures for efficient symbolic model checking," in Proc. Int. Conf. Computer Aided Verification, vol. 1855 of Lecture Notes in Comput. Sci., 2000, pp. 124-138.
9. P. A. Abdulla, P. Bjesse, and N. Eén, "Symbolic reachability analysis based on SAT-solvers," in Proc. Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems, vol. 1785 of Lecture Notes in Comput. Sci., 2000, pp. 411-425.
10. Espresso.[Online]. Available: http://www-cad.eecs.Berkeley.edu/Software/software.html
11. The VIS Group. VIS 1.4. [Online]. Available: http://vlsi.colorado.edu/̃vis/.
12. B. Yang. SMV 2.4b. [Online]. Available: http://www-2.cs.cmu.edu/̃bwolen.