On-the-fly resolve trace minimization

Proceedings - Design Automation Conference

Volumn , Issue , 2007, Pages 594-599

  Shacham, Ohad ^a   Yorav, Karen ^a  

^a IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

SAT solvers; SAT based verification; Unsatisfiable core

Indexed keywords

BOOLEAN FORMULAS; SAT SOLVERS; SAT-BASED VERIFICATION; UNSATISFIABILITY; UNSATISFIABLE CORE;

ALGORITHMS; COMPUTATIONAL EFFICIENCY; FUNCTION EVALUATION; PROBLEM SOLVING; THEOREM PROVING;

BOOLEAN FUNCTIONS;

EID: 34547270458     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DAC.2007.375233     Document Type: Conference Paper

References (16)

1. IBM Formal Verification Benchmarks Library.
2. IBM RuleBase Parallel Edition. 2004.
3. R. J. Jr. Bayardo and R. C. Schrag. Using CSP look-back techniques to solve real-world SAT instances. In IICAI, 1997.
4. D. Le Berre and L. Simon. SAT competition. 2005.
5. A. Biere, A. Cimatti, E. Clark, and Y. Zhu. Symbolic model checking Without BDDs. In TACAS, 1999.
6. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Comm. of the ACM, 5(7), 1962.
7. N. Een and N. Sorensson. An Extensible SAT-solver. In SAT, 2003.
8. J. P. Marques-Silva and K. A. Sakallah. GRASP: a search algorithm for propositional satisfiability. IEEE Trans. on Comp., 48(5), 1999.
9. K. L. McMillan. Interpolation and SAT-Based Model Checking. In CAV, 2003.
10. K. L. McMillan and N. Amla. Automatic Abstraction without Counterexamples. In TACAS, 2003.
11. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: engineering an efficient SAT solver. In DAC, 2001.
12. O. Strichman. Pruning Techniques for the SAT-Based Bounded Model Checking Problem. In CHARME, 2001.
13. C. Wang, H. Jin, G. D. Hachtel, and F. Somenzi. Refining the SAT Decision Ordering for Bounded Model Checking. In DAC, 2004.
14. J. Whittemore, J. Kim, and K. Sakallah. SATIRE: a new incremental satisfiability engine. In DAC, 2001.
15. L. Zhang, C. F. Madigan, M. W. Moskewicz, and S. Malik. Efficient conflict driven learning in Boolean satisfiability solver. In ICCAD, 2001.
16. L. Zhang and S. Malik. Extracting small unsatisfiable cores from unsatisfiable Boolean formulas. In SAT, 2003.