Abstract
The talk describes the method used for reasoning about quantifiers in the Simplify theorem-prover, which is the reasoning engine inside the Extended Static Checkers built for Java and for Modula-3 at the DEC/Compaq/HP Systems Research Center. The essence of the method is pattern-based heuristic instantiation. The two main novelties are
-
because matching is performed in the E-graph (a term-DAG augmented with a congruence-closed equivalence relation) instead of in an ordinary term DAG, the prover makes better use of equality information, and
-
two E-graph specific performance optimizations will be described, the “modtime optimization” and the “pattern-elements optimization”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nelson, G. (2003). Reasoning about Quantifiers by Matching in the E-graph. In: Baader, F. (eds) Automated Deduction – CADE-19. CADE 2003. Lecture Notes in Computer Science(), vol 2741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45085-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-45085-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40559-7
Online ISBN: 978-3-540-45085-6
eBook Packages: Springer Book Archive