An algorithm for reasoning about equality

Authors:
Robert E. Shostak
Affiliations:
Stanford Research Institute, Menlo Park, CA
Venue:
Communications of the ACM
Year:
1978

Citing 2
Cited 38

Introduction to mathematical logic (3rd ed.)

Introduction to mathematical logic (3rd ed.)
Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)

Equality-based binary resolution

Journal of the ACM (JACM)
Automatic recognition of tractability in inference relations

Journal of the ACM (JACM)
Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)
Variations on the Common Subexpression Problem

Journal of the ACM (JACM)
Pattern Matching in Trees

Journal of the ACM (JACM)
Deciding Combinations of Theories

Journal of the ACM (JACM)
Polynomial-time computation via local inference relations

ACM Transactions on Computational Logic (TOCL)
On the complexity analysis of static analyses

Journal of the ACM (JACM)
What You Always Wanted to Know about Rigid E-Unification

Journal of Automated Reasoning
Theorem Proving for Verification

MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Using Decision Procedures with a Higher-Order Logic

TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
A Rewrite Rule Based Framework for Combining Decision Procedures

FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
On the Connections between Rewriting and Formal Language Theory

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Combining Shostak Theories

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Theorem proving for verification

Modeling and verification of parallel processes
Constructing decision procedures in equational clausal logic

Fundamenta Informaticae
Fast congruence closure and extensions

Information and Computation
Deduction, Strategies, and Rewriting

Electronic Notes in Theoretical Computer Science (ENTCS)
Path constraints in semistructured data

Theoretical Computer Science
New results on rewrite-based satisfiability procedures

ACM Transactions on Computational Logic (TOCL)
EufDpll - A Tool to Check Satisfiability of Equality Logic Formulas

Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems

Fundamenta Informaticae
Automated deduction for verification

ACM Computing Surveys (CSUR)
Equality reasoning in clause graphs

IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
The management of heuristic search in boolean experiments with RUE resolution

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Equational binary decision diagrams

LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
A tutorial on satisfiability modulo theories

CAV'07 Proceedings of the 19th international conference on Computer aided verification
On theorem proving for program checking: historical perspective and recent developments

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Congruence closure of compressed terms in polynomial time

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Inference systems for logical algorithms

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
A BDD-Representation for the logic of equality and uninterpreted functions

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Yet another decision procedure for equality logic

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Proof-producing congruence closure

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems

Fundamenta Informaticae
Constructing Decision Procedures in Equational Clausal Logic

Fundamenta Informaticae
Reachability In Some Classes Of Acyclic Petri Nets

Fundamenta Informaticae
On Rewriting Rules in Mizar

Journal of Automated Reasoning
"Decision Procedures: An Algorithmic Point of View," by Daniel Kroening and Ofer Strichman, Springer-Verlag, 2008

Journal of Automated Reasoning

Quantified Score

Hi-index	48.22

Visualization

Abstract

A simple technique for reasoning about equalities that is fast and complete for ground formulas with function symbols and equality is presented. A proof of correctness is given as well.