Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)

Volumn 27, Issue 2, 1980, Pages 356-364

  Nelson, Greg ^a   Oppen, Derek C ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

congruence closure; decision procedure; graph algorithms; mechanical theorem proving; program verification; theory of equality; theory of recursive data types

Indexed keywords

COMPUTER PROGRAMMING;

EID: 0019003680     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322186.322198     Document Type: Article

References (9)

1. Ackermann, W Solvable Cases of the Decision Problem North-Holland, Amsterdam, 1954.
2. Aho, A V, Hopcroft, J E, and Ullmann, J D The Design and Analysis of Computer Algorithms Addison-Wesley, Reading, Mass 1974.
3. DOWNEY, P. J., SETHI, R, and TARJAN, R E. Variations on the common subexpression problem To appear in J. ACM.
4. KOZEN, D. Complexity of finitely represented algebras. Proc. 9th Annual ACM Symp. on Theory of Comptg., Boulder, Colo., May 1977, pp. 164-177.
5. NELSON, C G., and OPPEN, D. C. Fast decision procedures based on UNION and FIND. Proc Eighteenth Annual Symp on Foundations of Comptr. Sci, Providence, R1., 1977 (This is an earlier version of the present paper.).
6. NELSON, C G., and OPPEN, D. C. Simplification by cooperating decision procedures To be published.
7. OPPEN, D C. Reasoning about recursively defined data structures Proc 5th ACM Symp on Principles of Programming Languages, Tucson, Anz, January 1978, pp 151-157.
8. SHOSTAK, R An algorithm for reasoning about equality Comm ACM 21, 7 (July 1978), 583-585.
9. TARJAN, R. E. Efficiency of a good but not linear set union algorithm J ACM 22, 2 (April 1975), 215-225.