Open AccessProceedings Article
An algorithm for reasoning about equality
Robert E. Shostak
- 22 Aug 1977
- pp 526-527
TL;DR: In this article, a simple technique for reasoning about equalities that is fast and complete for ground formulas with function symbols and equality is presented, and a proof of correctness is given as well.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Satisfiability Modulo Theories
Clark Barrett,Cesare Tinelli +1 more
- 01 Jan 2018
TL;DR: The architecture of a lazy SMT solver is discussed, examples of theory solvers are given, how to combine such solvers modularly is shown, and several extensions of the lazy approach are mentioned.
1.1K
Pattern Matching in Trees
TL;DR: Five new techniques for tree pattern matching are presented, analyzed for time and space complexity, and compared with previously known methods.
Compiling with proofs
George C. Necula,Peter Lee +1 more
- 01 Jan 1998
TL;DR: This dissertation shows how standard decision procedures can be adapted so that they can produce detailed proofs of the proved predicates and also how these proofs can be encoded compactly and checked efficiently.
A Practical Decision Procedure for Arithmetic with Function Symbols
TL;DR: A practical procedure is presented for an extension of quantifier-free Presburger arithmetic that permits arbitrary unmterpreted predicate and function symbols and is powerful enough to encode the semantics of array operators as well as MAX, MIN, and ABSVALUE.
Verification of scheduling in the presence of loops using uninterpreted symbolic simulation
P. Ashar,Anand Raghunathan,A. Gupta,S. Bhattacharya +3 more
- 08 Oct 1999
TL;DR: A novel procedure based on uninterpreted symbolic simulation for checking the scheduling step in high-level synthesis and its ability to efficiently handle loops and a wide range of loop transformations performed during scheduling is proposed.
123
References
Efficiency of a Good But Not Linear Set Union Algorithm
TL;DR: It is shown that, if t(m, n) is seen as the maximum time reqmred by a sequence of m > n FINDs and n -- 1 intermixed UNIONs, then kima(m), n is shown to be related to a functional inverse of Ackermann's functmn and as very slow-growing.
•Book
Introduction to mathematical logic
Hans Hermes,Diana Schmidt +1 more
- 01 Jan 1973
TL;DR: This book discusses the semantics of Predicate Logic, and some of theorems of A. Robinson, Craig and Beth's treatment of Peano's Axiom System.
1K
Fast decision algorithms based on union and find
Greg Nelson,Derek C. Oppen +1 more
- 30 Sep 1977
TL;DR: A simple algorithm for computing congruence closures of a relation on a graph in O(mn) time, where n is the number of vertices and m thenumber of edges in G.
28