DPLL(T) with exhaustive theory propagation and its application to difference logic

Lecture Notes in Computer Science

Volumn 3576, Issue , 2005, Pages 321-334

  Nieuwenhuis, Robert ^a   Oliveras, Albert ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

SCALING PROPERTIES; THEORY SOLVERS;

FORMAL LOGIC;

EID: 26444452555     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11513988_33     Document Type: Conference Paper

References (26)

1. [ACG00] A. Armando, C. Castellini, and E. Giunchiglia. SAT-based procedures for temporal reasoning. In Procs 5th European Conf. on Planning (Durham, UK), LNCS 1809 pages 97-108. Springer, 2000.
2. [ACGM04] A. Armando, C. Castellini, E. Giunchiglia, and M. Maratea. A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints. In 7th Int. Conf. Theory and Appl. of Sat Testing (SAT 2004). LNCS, 2004.
3. [BB04] C. Barrett and S. Berezin. CVC lite: A new implementation of the cooperating validity checker. In 16th Int. Conf. Computer Aided Verification, CAV'04 LNCS 3114, pages 515-518. Springer, 2004.
4. +05] M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P.v. Rossum, S. Schulz, and R. Sebastiani. An incremental and layered procedure for the satisfiability of linear arithmetic logic. In TACAS'05, 2005.
5. [BDS02] C. 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. [BLS02] R. Bryant, S. Lahiri, and S. Seshia. Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions. In Procs. 14th Intl. Conference on Computer Aided Verification (CAV), LNCS 2404, 2002.
7. [BV02] R. Bryant and M. Velev. Boolean satisfiability with transitivity constraints. ACM Trans. Computational Logic, 3(4):604-627, 2002.
8. [CAMN04] S. Cotton, E. Asarin, O. Maler, and P. Niebert. Some progress in satisfiability checking for difference logic. In FORMATS 2004 and FTRTFT 2004, LNCS 3253, pages 263-276, 2004.
9. [DLL62] M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Comm. of the ACM, 5(7):394-397, 1962.
10. [dMR02] 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.
11. [dMR04] L. de Moura and H. Ruess. An experimental evaluation of ground decision procedures. In 16th Int. Conf. on Computer Aided Verification, CAV'04, LNCS 3114, pages 162-174. Springer, 2004.
12. [DP60] M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201-215, 1960.
13. [DST80] P. Downey, R. Sethi, and R. Tarjan. Variations on the common subexpressions problem. Journal of the ACM, 27(4):758-771, 1980.
14. [FJOS03] C. Flanagan, R. Joshi, X. Ou, and J. Saxe. Theorem proving using lazy proof explanation. In Procs. 15th Int. Conf. on Computer Aided Verification (CAV), LNCS 2725, 2003.
15. +04] H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast decision procedures. In 16th Int. Conf. on Computer Aided Verification, CAV'04, LNCS 3114, pp 175-188, 2004.
16. [GN02] 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. [LS04] S. Lahiri and S. Seshia. The UCLID Decision Procedure. In Computer Aided Verification, 16th International Conference, (CAV'04), Lecture Notes in Computer Science, pages 475-478. Springer, 2004.
18. +01] M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In Proc. 38th Design Automation Conference (DAC'01), 2001.
19. [MSS99] J. Marques-Silva and K. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Trans. Comput., 48(5):506-521, 1999.
20. [NO03] Robert Nieuwenhuis and Albert Oliveras. Congruence closure with integer offsets. In M Vardi and A Voronkov, eds, 10h Int. Conf. Logic for Programming, Artif. Intell. and Reasoning (LPAR), LNAI 2850, pp 78-90, 2003.
21. [NOT05] R. Nieuwenhuis, A. Oliveras, and C. Tinelli. Abstract DPLL and Abstract DPLL Modulo Theories. In 11h Int. Conf. Logic for Programming, Artif. Intell. and Reasoning (LPAR), LNAI 3452, 2005.
22. [PRSS99] 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.
23. [Sch87] A. Schrijver. Theory of Linear and Integer Programming. John Wiley and Sons, New York, 1987.
24. [SLB03] 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.
25. [SSB02] O. Strichman, S. Seshia, and R. Bryant. Deciding separation formulas with SAT. In Procs. 14th Intl. Conference on Computer Aided Verification (CAV), LNCS 2404, pages 209-222, 2002.
26. [TSSP04] M. Talupur, N. Sinha, O. Strichman, and A. Pnueli. Range allocation for separation logic. In 16th Int. Conf. on Computer Aided Verification, CAV'04, LNCS 3114, pp 148-161, 2004.