CirCUs: A hybrid satisfiability solver

Lecture Notes in Computer Science

Volumn 3542, Issue , 2005, Pages 211-223

  Jin, HoonSang ^a   Somenzi, Fabio ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION MAKING; HEURISTIC METHODS; INFORMATION ANALYSIS; PROBLEM SOLVING;

AND-INVERTER-GRAPH (AIG),; BINARY DECISION DIAGRAMS (BDDS); CONJUNCTIVE NORMAL FORM (CNF) CLAUSES; HYPERGRAPHS;

GRAPH THEORY;

EID: 26444549823     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11527695_17     Document Type: Conference Paper

References (42)

1. F. A. Aloul, I. L. Markov, and K. A. Sakallah. Mince: A static global variable-ordering for SAT and BDD. Presented at IWLS01, June 2001.
2. F. A. Aloul, I. L. Markov, and K. A. Sakallah. FORCE: A fast and easy-to-implement variable-ordering heuristic. In Proceedings of the Great Lakes Symposium on VLSI, pages 116-119, Washington, DC, Apr. 2003.
3. C. W. Barrett, D. L. Dill, and A. Stump. Checking satisfiability of first-order formulas by incremental translation to SAT. In E. Brinksma and K. G. Larsen, editors, Fourteenth Conference on Computer Aided Verification (CAV'02), pages 236-249. Springer-Verlag, Berlin, July 2002. LNCS 2404.
4. 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.
5. 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.
6. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, Aug. 1986.
7. J. R. Burch, E. M. Clarke, and D. E. Long. Representing circuits more efficiently in symbolic model checking. In Proceedings of the Design Automation Conference, pages 403-407, San Francisco, CA, June 1991.
8. J. R. Burch and V. Singhal. Tight integration of combinational verification methods. In Proceedings of the International Conference on Computer-Aided Design, pages 570-576, San Jose, CA, Nov. 1998.
9. R. Damiano and J. Kukula. Checking satisfiability of a conjunction of BDDs. In Proceedings of the Design Automation Conference, pages 818-823, June 2003.
10. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394-397, 1962.
11. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, 7(3):201-215, July 1960.
12. J. Franco, M. Kouril, J. Schlipf, J. Ward, S. Weaver, M. Dransfield, and W. M. Vanfleet. SBSAT: A state-based, BDD-based satisfiability solver. In International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), Portofino, Italy, May 2003.
13. M. K. Ganai, P. Ashar, A. Gupta, L. Zhang, and S. Malik. Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver. In Proceedings of the Design Automation Conference, pages 747-750, New Orleans, LA, June 2002.
14. 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.
15. A. Gupta, M. Ganai, C. Wang, Z. Yang, and P. Ashar. Learning from BDDs in SAT-based bounded model checking. In Proceedings of the Design Automation Conference, pages 824-829, June 2003.
16. A. Gupta, A. Gupta, Z. Yang, and P. Ashar. Dynamic detection and removal of inactive clauses in SAT with application in image computation. In Proceedings of the Design Automation Conference, pages 536-541, Las Vegas, NV, June 2001.
17. A. Gupta, Z. Yang, P. Ashar, and A. Gupta. SAT-based image computation with application in reachability analysis. In W. A. Hunt, Jr. and S. D. Johnson, editors, Formal Methods in Computer Aided Design, pages 354-271. Springer-Verlag, Nov. 2000. LNCS 1954.
18. M. Herbstritt and B. Becker. Conflict-based selection of branching rules. In Sixth International Conference on Theory and Application in Satisfiability Testing (SAT2003), pages 441-451, Portofino, Italy, May 2003. Springer. LNCS 2919.
19. A. J. Hu and D. Dill. Efficient verification with BDDs using implicitly conjoined invariants. In C. Courcoubetis, editor, Fifth Conference on Computer Aided Verification (CAV '93), pages 3-14. Springer-Verlag, Berlin, 1993. LNCS 697.
20. S.-W. Jeong and F. Somenzi. A new algorithm for 0-1 programming based on binary decision diagrams. In T. Sasao, editor, Logic Synthesis and Optimization, chapter 7, pages 145-165. Kluwer Academic Publishers, Boston, MA, 1993.
21. 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.
22. H. Jin, A. Kuehlmann, and F. Somenzi. Fine-grain conjunction scheduling for symbolic reachability analysis. In International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'02), pages 312-326, Grenoble, France, Apr. 2002. LNCS 2280.
23. H. Jin and F. Somenzi. CirCUs: Speeding up circuit SAT with BDD-based implications. Submitted for publication, Apr. 2004.
24. 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.
25. A. Kuehlmann and F. Krohm. Equivalence checking using cuts and heaps. In Proceedings of the Design Automation Conference, pages 263-268, Anaheim, CA, June 1997.
26. P. Liberatore. On the complexity of choosing the branching literal in DPLL. Artificial Intelligence, 116(1-2):315-326, 2000.
27. S.-I. Minato. Fast generation of irredundant sums-of-products forms from binary decision diagrams. In SASIMI '92, pages 64-73, Kyoto, Japan, Apr. 1992.
28. S.-I. Minato. Zero-suppressed BDDs for set manipulation in combinatorial problems. In Proceedings of the Design Automation Conference, pages 212-211, Dallas, TX, June 1993.
29. I.-H. Moon, G. D. Hachtel, and F. Somenzi. Border-block triangular form and conjunction schedule in image computation. In W. A. Hunt, Jr. and S. D. Johnson, editors, Formal Methods in Computer Aided Design, pages 73-90. Springer-Verlag, Nov. 2000. LNCS 1954.
30. I.-H. Moon, J. H. Kukula, K. Ravi, and F. Somenzi. To split or to conjoin: The question in image computation. In Proceedings of the Design Automation Conference, pages 23-28, Los Angeles, CA, June 2000.
31. E. Morreale. Recursive operators for prime implicant and irredundant normal form determination. IEEE Transactions on Computers, C-19(6):504-509, June 1970.
32. 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.
33. N. R. Quinn. The placement problem as viewed from the physics of classical mechanics. In Proceedings of the Design Automation Conference, pages 173-178, Boston, MA, June 1975.
34. URL: http://www.lri.fr/~simon/contest/results.
35. J. P. M. Silva. The impact of branching heuristics in prepositional satisfiability algorithms. In Proceedings of the 9th Portuguese Conference on Artificial Intelligence (EPIA), Sept. 1999.
36. 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.
37. F. Somenzi. CUDD: CU Decision Diagram Package. University of Colorado at Boulder, ftp://vlsi.colorado.edu/pub/.
38. F. Somenzi and K. Ravi. Extracting simple invariants from BDDs. Unpublished manuscript, May 2002.
39. H. Touati, H. Savoj, B. Lin, R. K. Brayton, and A. Sangiovanni- Vincentelli. Implicit enumeration of finite state machines using BDD's. In Proceedings of the IEEE International Conference on Computer Aided Design, pages 130-133, Nov. 1990.
40. M. N. Velev. Exploiting signal unobservability for efficient translation to CNF in formal verification of microprocessor. In In the Proceedings of the IEEE/ACM Design, Automation and Test in Europe Conference (DATE), pages 10266-10271, Feb. 2004.
41. URL: http://vlsi.colorado.edu/~vis.
42. H. Zhang. SATO: An efficient prepositional prover. In Proceedings of the International Conference on Automated Deduction, pages 272-275, July 1997. LNAI 1249.