Deriving small unsatisfiable cores with dominators

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

Volumn 4144 LNCS, Issue , 2006, Pages 109-122

  Gershman, Roman ^a   Koifman, Maya ^a   Strichman, Ofer ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; THEOREM PROVING;

INTERNAL NODES; M CLAUSES; RESOLUTION GRAPHS; UNSATISFIABLE CORES;

GRAPH THEORY;

EID: 33749851241     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_13     Document Type: Conference Paper

References (16)

1. N. Amla and K. McMillan. Automatic abstraction without counterexamples. In H. Garavel and J. Hatcliff, editors, TACAS'03, volume 2619 of Lect. Notes in Comp. Sci., 2003.
2. R. Bruni. Approximating minimal unsatisfiable subformulae by means of adaptive core search. Discrete Appl. Math., 130(2):85-100, 2003.
3. th Annual European Symposium on Algorithms (ESA 2004), volume 3221 of LNCS, pages 677-688, 2004.
4. O. Grumberg, F. Lerda, O. Strichman, and M. Theobald. Proof-guided underapproximation-widening for multi-process systems. In POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT sysposium on Principles of programming languages, pages 122-131. ACM Press, 2005.
5. A. Gupta. Learning Abstractions for Model Checking. PhD thesis, Carnegie Mellon University, 2006. (to be published).
6. th Asia and South Pacific Design Automation Conference (ASP-DAC), pages 432-437, 2005.
7. M. Koifman. An approach to extracting a small unsatisfiable core. M.sc. thesis, Technion - I.I.T., Israel, Haifa, (to be published) 2006.
8. th Intl. Conference on Computer Aided Verification (CAV'04), number 3114 in Lect. Notes in Comp. Sci., pages 308-320, Boston, MA, July 2004. Springer-Verlag.
9. T. Lengauer and R. E. Tarjan. A fast algorithm for finding dominators in a flow-graph. ACM Trans. Program. Lang. Syst., 1(1):121-141, 1979.
10. I. Lynce and J. Marques-Silva. On computing minimum unsatisfiable cores. In Proceedings of the International Symposium on Theory and Applications of Satisfiability Testing, pages 305-310, 2004.
11. Y. Oh, M. N. Mneimneh, Z. S. Andraus, K. A. Sakallah, and I. L. Markov. Amuse: a minimally-unsatisfiable subformula extractor. In DAC '04, pages 518-523, 2004.
12. C. H. Papadimitriou and D. Wolfe. The complexity of facets resolved. J. Comput. Syst. Sci., 37(1):2-13, 1988.
13. R. Prosser. Applications of boolean matrices to the analysis of flow diagrams. In Proceedings of the Eastern Joint Computer Conference, pages 133-138, 1959.
14. O. Shtrichman. Prunning techniques for the SAT-based bounded model checking problem. In proc. of the 11th Conference on Correct Hardware Design and Verification Methods (CHARME'01), Edinburgh, Sept. 2001.
15. th Intl. Conference on Computer Aided Verification (CAV'02), 2002.
16. L. Zhang and S. Malik. Extracting small unsatisfiable cores from unsatisfiable boolean formula. In Theory and Applications of Satisfiability Testing, 2003.