Proof-producing congruence closure

Lecture Notes in Computer Science

Volumn 3467, Issue , 2005, Pages 453-468

  Nieuwenhuis, Robert ^a   Oliveras, Albert ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; EQUIVALENCE CLASSES; LINEAR PROGRAMMING; SET THEORY;

CONGRUENCE CLOSURES; EQUATIONAL REASONING;

COMPUTER SCIENCE;

EID: 24944515509     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32033-3_33     Document Type: Conference Paper

References (21)

1. +02] G. Audemaxd, 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. [BDS02] Clarke Barrett, David Dill, and Aaron 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.
3. [BT00] L. Bachmair and A. Tiwari. Abstract congruence closure and specializations. In Conf. Autom. Deduction, CADE, LNAI1831, pages 64-78, 2000.
4. [CLR90] Thomas T. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to algorithms. MIT Press, 1990.
5. [DLL62] Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem-proving. Comm. of the ACM, 5(7):394-397, 1962.
6. [dMR02] Leonardo de Moura and Harald 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.
7. [dMRS04] L. de Moura, H. Rueß, and N. Shankar. Justifying equality. In Proc. of the Second Workshop on Pragmatics of Decision Procedures in Automated Reasoning, Cork, Ireland, 2004.
8. [DP60] Martin Davis and Hilary Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201-215, 1960.
9. [DST80] Peter J. Downey, Ravi Sethi, and Robert E. Tarjan. Variations on the common subexpressions problem. J. of the Association for Computing Machinery, 27(4):758-771, 1980.
10. [FJOS03] 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.
11. +04] Harald Ganzinger, George Hagen, Robert Nieuwenhuis, Albert Oliveras, and Cesare Tinelli. DPLL(T): Fast decision procedures. In R. Alur and D. Peled, editors, Proceedings of the 16th International Conference on Computer Aided Verification, CAV'04 (Boston, Massachusetts), volume 3114 of Lecture Notes in Computer Science, pages 175-188. Springer, 2004.
12. [Kap97] Deepak Kapur. Shostak's congruence closure as completion. In Procs. 8th Int. Conf. on Rewriting Techniques and Applications, LNCS 1232, 1997.
13. [KS04] Robert Klapper and Aaron Stump. Validated proof-producing decision procedures. In Proceedings of the Second Workshop on Pragmatics of Decision Procedures in Automated Reasoning, Cork, Ireland, 2004.
14. +01] Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an Efficient SAT Solver. In Proc. 38th Design Automation Conference (DAC'01), 2001.
15. [NO80] Greg Nelson and Derek C. Oppen. Fast decision procedures bases on congruence closure. Journal of the Association for Computing Machinery, 27(2):356-364, April 1980.
16. [NO03] Robert Nieuwenhuis and Albert Oliveras. Congruence closure with integer offsets. In 10h Int. Conf. Logic for Programming, Artif. Intell. and Reasoning (LPAR), LNAI 2850, pages 78-90, 2003.
17. [SD99] Aaron Stump and David L. Dill. Generating proofs from a decision procedure. In A. Pnueli and P. Traverso, editors, Proceedings of the FLoC Workshop on Run-Time Result Verification, Trento, Italy, 1999.
18. [Sho78] Robert E. Shostak. An algorithm for reasoning about equality. Commun. ACM, 21(7), 1978.
19. [Tar75] Robert Endre Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM (JACM), 22(2):215-225, April 1975.
20. [Tar79] Robert Endre Tarjan. A class of algorithms that require nonlinear time to maintain disjoint sets. J. Comput. and Sys. Sci., 18(2): 110-127, 1979.
21. [TV01] Ashish Tiwari and Laurent Vigneron. Implementation of Abstract Congruence Closure with randomly generated CC problem instances, 2001. At www.csl.sri.com/users/tiwari.