Abstract Interpretation on E-Graphs

03/17/2022
by   Samuel Coward, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

research
05/30/2022

Combining E-Graphs with Abstract Interpretation

E-graphs are a data structure that compactly represents equivalent expre...
research
08/16/2017

A fix-point characterization of Herbrand equivalence of expressions in data flow frameworks

The problem of determining Herbrand equivalence of terms at each program...
research
06/22/2022

Decoupling the ascending and descending phases in Abstract Interpretation

Abstract Interpretation approximates the semantics of a program by mimic...
research
08/07/2023

Abstract Domains for Database Manipulating Processes

Database manipulating systems (DMS) formalize operations on relational d...
research
11/17/2022

Completeness in static analysis by abstract interpretation, a personal point of view

Static analysis by abstract interpretation is generally designed to be ”...
research
01/10/2020

A computational interpretation of Zorn's lemma

We give a computational interpretation to an abstract instance of Zorn's...
research
03/29/2019

A Provable Defense for Deep Residual Networks

We present a training system, which can provably defend significantly la...

Please sign up or login with your details

Forgot password? Click here to reset