Congruence closure with integer offsets

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2850, Issue , 2003, Pages 78-90

  Nieuwenhuis, Robert ^a   Oliveras, Albert ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ABSTRACTING; ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; FUNCTIONS; THEOREM PROVING;

ABSTRACT ALGORITHM; ARBITRARY INTEGER; ASYMPTOTIC COMPLEXITY; AUTOMATED DEDUCTION; CONGRUENCE CLOSURE; DECISION PROCEDURE; EQUATIONAL THEORY; FUNCTION SYMBOLS;

ALGORITHMS; INTEGER PROGRAMMING;

ASYMPTOTIC COMPLEXITY; AUTOMATED DEDUCTION; CIRCUIT VERIFICATION; UNINTERPRETED FUNCTIONS (EUF);

EID: 9444245078     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-39813-4_5     Document Type: Conference Paper

References (13)

1. J. R. Burch and D. L. Dill. Automatic verification of pipelined microprocessor control. In Proc. 6th International Computer Aided Verification Conference, pages 68-80, 1994.
2. R. Bryant, S. Lahiri, and S. Seshia. Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions. In E. Brinksma and K. G. Larsen, editors, Procs. 14th Intl. Conference on Computer Aided Verification (CAV), volume 2404 of Lecture Notes in Computer Science. Springer-Verlag, July 27-31 2002.
3. Leo Bachmair and Ashish Tiwari. Abstract congruence closure and specializations. In David McAllester, editor, Conference on Automated Deduction, CADE '2000, volume 1831 of Lecture Notes in Artificial Intelligence, pages 64-78, Pittsburgh, PA, June 2000. Springer-Verlag.
4. Leo Bachmair, Ashish Tiwari, and Laurent Vigneron. Abstract congruence closure. Journal of Automated Reasoning. To appear.
5. Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem-proving. Communications of the ACM, 5(7):394-397, July 1962.
6. Martin Davis and Hilary Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201-215, 1960.
7. Nachum Dershowitz and David Plaisted. Rewriting. In J.A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier Science Publishers and MIT Press, 2001.
8. 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.
9. Deepak Kapur. Shostak's congruence closure as completion. In H. Comon, editor, Proceedings of the 8th International Conference on Rewriting Techniques and Applications, volume 1232 of Lecture Notes in Computer Science. Springer-Verlag, 1997.
10. 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.
11. David A. Plaisted and Andrea Sattler-Klein. Proof lengths for equational completion. Information and Computation, 125(2):154-170, 15 March 1996.
12. Robert E. Shostak. Deciding combinations of theories. Journal of the ACM, 31(1):1-12, January 1984.
13. Wayne Snyder. An O(n log n) algorithm for generating reduced sets of ground rewrite rules equivalent to a set of ground equations E. In N. Dershowitz, editor, Rewriting Techniques and Applications, 3th International Conference, LNCS. Springer-Verlag, 1989.