Efficient conflict analysis for finding all satisfying assignments of a Boolean circuit

Lecture Notes in Computer Science

Volumn 3440, Issue , 2005, Pages 287-300

  Jin, HoonSang ^a   Han, HyoJung ^a   Somenzi, Fabio ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTER HARDWARE; COMPUTER SOFTWARE; OPTIMIZATION; PROBLEM SOLVING;

BACKTRACKING; BOOLEAN CIRCUITS; CONFLICT ANALYSIS; PREPOSITIONAL SATISFIABILITY SOLVERS;

LOGIC CIRCUITS;

EID: 24644446561     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31980-1_19     Document Type: Conference Paper

References (29)

1. G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowicz, and R. Sebastiani. A SAT based approach for solving formulas over boolean and linear mathematical propositions. In International Conference on Automated Deduction, July 2002.
2. 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, March 1999. LNCS 1579.
3. R. K. Brayton et al. VIS: A system for verification and synthesis. In T. Henzinger and R. Alur, editors, Eighth Conference on Computer Aided Verification (CAV'96), pages 428-432. Springer-Verlag, Rutgers University, 1996. LNCS 1102.
4. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
5. D. Chai and A. Kuehlmann. A fast pseudo-Boolean constraint solver. In Proceedings of the Design Automation Conference, pages 830-835, Anaheim, CA, June 2003.
6. P. Chauhan, E. M. Clarke, and D. Kroening. Using SAT based image computation for reachability analysis. In Technical Report CMU-CS-03-151, 2003.
7. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394-397, 1962.
8. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, 7(3):201-215, July 1960.
9. 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, March 2002.
10. E. Goldberg and Y. Novikov. Verification of proofs of unsatisfiability for CNF formulas. In Design, Automation and Test in Europe (DATE'03), pages 886-891, Munich, Germany, March 2003.
11. E. Goldberg, M. Prasad, and R. Brayton. Using SAT for combinational equivalence checking. In Proceedings of the Conference on Design, Automation and Test in Europe, pages 114-121, June 2001.
12. O. Grumberg, A. Schuster, and A. Yadgar. Memory efficient all-solutions SAT solver and its application for reachability analysis. In Proceedings of FMCAD, Austin, TX, 2004. To appear.
13. M. K. Iyer, G. Parthasarathy, and K.-T. Cheng. SATORI - a fast sequential SAT engine for circuits. In Proceedings of the International Conference on Computer-Aided Design, pages 320-325, San Jose, CA, November 2003.
14. H. Jin, M. Awedh, and F. Somenzi. CirCUs: A satisfiability solver geared towards bounded model checking. In R. Alur and D. Peled, editors, Sixteenth Conference on Computer Aided Verification (CAV'04). Springer-Verlag, Berlin, July 2004. To appear.
15. H. Jin and F. Somenzi. CirCUs: A hybrid satisfiability solver. In International Conference on Theory and Applications of Satisfiability Testing (SAT 2004), Vancouver, Canada, May 2004.
16. H.-J. Kang and I.-C. Park. SAT-based unbounded symbolic model checking. In Proceedings of the Design Automation Conference, pages 840-843, Anaheim, CA, June 2003.
17. D. Kroening, J. Ouaknine, S. A. Seshia, and O. Strichman. Abstraction-based satisfiability solving of Presburger arithmetic. In Sixteenth Conference on Computer Aided Verification (CAV'04), pages 308-320, July 2004.
18. A. Kuehlmann, M. K. Ganai, and V. Paruthi. Circuit-based Boolean reasoning. In Proceedings of the Design Automation Conference, pages 232-237, Las Vegas, NV, June 2001.
19. B. Li, M. S. Hsiao, and S. Sheng. A novel SAT all-solutions for efficient preimage computation. In Proceedings of the Conference on Design, Automation and Test in Europe, pages 380-384, March 2004.
20. 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.
21. K. L. McMillan. Interpolation and SAT-based model checking. In W. A. Hunt, Jr. and F. Somenzi, editors, Fifteenth Conference on Computer Aided Verification (CAV'03), pages 1-13. Springer-Verlag, Berlin, July 2003. LNCS 2725.
22. 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.
23. G. Nam, F Aloul, K. Sakallah, and R. Rutenbar. A comparative study of two boolean formulations of FPGA detailed routing constaraints. In IEEE Transactions on Computer-Aided Design of Integrated Circuits, pages 688-696, June 2004.
24. K. Ravi and F. Somenzi. Minimal assignments for bounded model checking. In International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'04), pages 31-45, Barcelona, Spain, March-April 2004. LNCS 2988.
25. 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, November 1996.
26. URL: http://vlsi.colorado.edu/~vis.
27. H. Zhang. SATO: An efficient prepositional proven In Proceedings of the International Conference on Automated Deduction, pages 272-275, July 1997. LNAI 1249.
28. L. Zhang, C. Madigan, M. Moskewicz, and S. Malik. Efficient conflict driven learning in Boolean satisfiability solver. In Proceedings of the International Conference on Computer-Aided Design, pages 279-285, San Jose, CA, November 2001.
29. L. Zhang and S. Malik. Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications. In Design, Automation and Test in Europe (DATE'03), pages 880-885, Munich, Germany, March 2003.