Minimal Assignments for Bounded Model Checking

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

Volumn 2988, Issue , 2004, Pages 31-45

  Ravi, Kavita ^a,b   Somenzi, Fabio ^a,b  

^a CADENCE DESIGN SYSTEMS   (United States)

^b UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MODEL CHECKING;

BOOLEAN FORMULAE; BOUNDED MODEL CHECKING; HUMAN UNDERSTANDING; LINEAR TIME; SAFETY PROPERTY; SAT SOLVERS; SATISFYING ASSIGNMENTS; TWO-STAGE ALGORITHM;

BOOLEAN ALGEBRA;

EID: 35048820043     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24730-2_3     Document Type: Article

References (15)

1. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Fifth International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'99), pages 193-207, Amsterdam, The Netherlands, Mar. 1999. LNCS 1579.
2. R. K. Brayton et al. VIS: A system for verification and synthesis. Technical Report UCB/ERL M95/104, Electronics Research Lab, Univ. of California, Dec. 1995.
3. R. K. Brayton and F. Somenzi. An exact minimizer for Boolean relations. In Proceedings of the IEEE International Conference on Computer Aided Design, pages 316-319, Santa Clara, CA, Nov. 1989.
4. E. Clarke, A. Gupta, J. Kukula, and O. Strichman. SAT based abstraction-refinement using ILP and machine learning. In E. Brinksma and K. G. Larsen, editors, Fourteenth Conference on Computer Aided Verification (CAV 2002), pages 265-279. Springer-Verlag, July 2002. LNCS 2404.
5. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394-397,1962.
6. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, 7(3):201-215, July 1960.
7. E. Goldberg and Y. Novikov. BerkMin: A fast and robust SAT-solver. In Proceedings of the Conference on Design, Automation and Test in Europe, pages 142-149, Paris, France, Mar. 2002.
8. H. Jin, K. Ravi, and F. Somenzi. Fate and free will in error traces. In International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'02), pages 445459, Grenoble, France, Apr. 2002. LNCS 2280.
9. K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In E. Brinksma and K. G. Larsen, editors, Fourteenth Conference on Computer Aided Verification (CAV'02), pages 250-264. Springer-Verlag, Berlin, July 2002. LNCS 2404.
10. M. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the Design Automation Conference, pages 530-535, Las Vegas, NV, June 2001.
11. G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. Wiley, New York, 1988.
12. 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, pages 220-227, San Jose, CA, Nov. 1996.
13. C. Wang, B. Li, H. Jin, G. D. Hachtel, and F. Somenzi. Improving Ariadne's bundle by following multiple threads in abstraction refinement. In Proceedings of the International Conference on Computer-Aided Design, pages 408-415, Nov. 2003.
14. H. Zhang. SATO: An efficient prepositional proven In Proceedings of the International Conference on Automated Deduction, pages 272-275, July 1997. LNAI 1249.
15. L. Zhang and S. Malik. The quest for efficient Boolean satisfiability solvers. In Fourteenth International Conference on Computer Aided Verification, (CAV'02), pages 17-36, Copenhagen, Denmark, 2002. LNCS 2404.