.png){kind=icon}
.png){kind=icon}
Return
Contextual Equality Saturation
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-07106-4_3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Equality saturation is a semantics-based technique for automatically and efficiently proving that two programs are equivalent modulo a fixed set of equality axioms. In this paper, we extend the equality saturation technique with contextual reasoning in order to perform rewriting under assumptions that are locally valid inside a conditional branch. This is based on a new notion of cyclic e-graphs with contextual annotations. We experimentally validate the efficiency and scalability of this new technique by proving equivalence of several families of programs where contextual reasoning is required.
Keywords:
Equality saturation
Contextual reasoning
Program equivalence
E-graphs
Rewriting systems
Journal
S
IF:
0
Papers:
14
Citations:
0