DPLL(T): Fast decision procedures

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

Volumn 3114, Issue , 2004, Pages 175-188

  Ganzinger, Harald ^a   Hagen, George ^b   Nieuwenhuis, Robert ^c   Oliveras, Albert ^c   Tinelli, Cesare ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b University of Iowa   (United States)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONGRUENCE CLOSURE; DECISION PROCEDURE; LOGIC OF EQUALITIES; NEW APPROACHES; UNINTERPRETED FUNCTIONS;

COMPUTER AIDED ANALYSIS;

EID: 35048870724     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27813-9_14     Document Type: Article

References (27)

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 CADE-18, LNCS 2392, pages 195-210, 2002.
2. A. Armando, C. Castellini, and E. Giunchiglia. SAT-based procedures for temporal reasoning. In Procs. of the 5th European Conference on Planning, LNCS 1809, pages 97-108. Springer, 2000.
3. J. R. Burch and D. L. Dill. Automatic verification of pipelined microprocessor control. In Procs. 6th Int. Conf. Computer Aided Verification (CAV), LNCS 818, pages 68-80, 1994.
4. C. Barrett, D. L. Dill, and J. Levitt. Validity checking for combinations of theories with equality. In Procs. 1st Intl. Conference on Formal Methods in Computer Aided Design, LNCS 1166, pages 187-201, 1996.
5. G. Barrett, D. Dill, and A. Stump. Checking satisfiability of first-order formulas by incremental translation into sat. In Procs. 14th Intl. Conf. on Computer Aided Verification (CAV), LNCS 2404, 2002.
6. R. E. Bryant, S. German, and M. N. Velev. Processor verification using efficient reductions of the logic of uninterpreted functions to prepositional logic. ACM Trans. Computational Logic, 2(1):93-134, 2001.
7. R. E. Bryant, S. Lahiri, and S. Seshia. Deciding CLU logic formulas via boolean and pseudo-boolean en codings. In Procs. 1st Int. Workshop on Constraints in Formal Verification, 2002.
8. R. E. Bryant, S. Lahiri, and S. Seshia. Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions. In Procs. of CAV'02, LNCS 2404, 2002.
9. L. Bachmair and A. Tiwari. Abstract congruence closure and specializations. In Conf. Autom. Deduction, CADE, LNAI 1831, pages 64-78, 2000.
10. R. E. Bryant and M. N. Velev. Boolean satisfiability with transitivity constraints. ACM Trans. Computational Logic, 3(4):604-627, 2002.
11. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. CACM, 5(7):394-397, 1962.
12. L. de Moura and H. Rueß. Lemmas on demand for satisfiability solvers. In Procs. 5th Int. Symp. on the Theory and Applications of Satisfiability Testing, SAT'02, pages 244-251, 2002.
13. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201-215, 1960.
14. P. J. Downey, R. Sethi, and R. E. Tarjan. Variations on the common subexpressions problem. JACM 27(4):758-771, 1980.
15. C. Flanagan, R. Joshi, X. Ou, and J. B. Saxe. Theorem proving using lazy proof explanation. In Procs. 15th Int. Conf. on Computer Aided Verification (CAV), LNCS 2725, 2003.
16. E. Goldberg and Y. Novikov. BerkMin: A fast and robust SAT-solver. In Design, Automation, and Test in Europe (DATE '02), pages 142-149, 2002.
17. D. Kapur. Shostak's congruence closure as completion. In Procs. 8th Int. Conf. on Rewriting Techniques and Applications, LNCS 1232, 1997.
18. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In Proc. 38th Design Automation Conference (DAC'01), 2001.
19. G. Nelson and D. C. Oppen. Fast decision procedures bases on congruence closure. JACM, 27(2):356-364, 1980.
20. R. Nieuwenhuis and A. Oliveras. Congruence closure with integer offsets. In 10th Int. Conf. Logic for Programming, Artif. Intell. and Reasoning (LPAR), LNAI 2850, pages 78-90, 2003.
21. A. Pnueli, Y. Rodeh, O. Shtrichman, and M. Siegel. Deciding equality formulas by small domains instantiations. In Procs. 11th Int. Conf. on Computer Aided Verification (CAV), LNCS 1633, pages 455-469, 1999.
22. S. Seshia, S. Lahiri, and R. Bryant. A hybrid SAT-based decision procedure for separation logic with uninterpreted functions. In Procs. 40th Design Automation Conference (DAC), pages 425-430, 2003.
23. O. Strichman, S. A. Seshia, and R. E. Bryant. Deciding separation formulas with SAT. In Procs. 14th Intl. Conference on Computer Aided Verification (CAV), LNCS 2404, pages 209-222, 2002.
24. C. Tinelli. A DPLL-based calculus for ground satisfiability modulo theories. In Procs. 8th European Conf. on Logics in Artificial Intelligence, LNAI 2424, pages 308-319, 2002.
25. A. Tiwari and L. Vigneron. Implementation of Abstract Congruence Closure, 2001. At www.csl.sri.com/users/tiwari.
26. M, N. Velev and R. E. Bryant. Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. Journal of Symbolic Computation, 35(2):73-106, 2003.
27. L. Zhang, C. F. Madigan, M. W. Moskewicz, and S. Malik. Efficient conflict driven learning in a Boolean satisfiability solver. In Int. Conf. on Computer-Aided Design (ICCAD'01), pages 279-285, 2001.