Abstract Interpretation on E-Graphs
Logic in Computer Science
2022-03-30 v1 Computation and Language
Abstract
Recent e-graph applications have typically considered concrete semantics of expressions, where the notion of equivalence stems from concrete interpretation of expressions. However, equivalences that hold over one interpretation may not hold in an alternative interpretation. Such an observation can be exploited. We consider the application of abstract interpretation to e-graphs, and show that within an e-graph, the lattice meet operation associated with the abstract domain has a natural interpretation for an e-class, leading to improved precision in over-approximation. In this extended abstract, we use Interval Arithmetic (IA) to illustrate this point.
Keywords
Cite
@article{arxiv.2203.09191,
title = {Abstract Interpretation on E-Graphs},
author = {Samuel Coward and George A. Constantinides and Theo Drane},
journal= {arXiv preprint arXiv:2203.09191},
year = {2022}
}