8 citations · 15 across the 17 of their papers we have counts for
3 papers · 1 filter
E-Graphs as a Persistent Compiler Abstraction
Jules Merckx, Alexandre Lopoukhine, Samuel Coward +3
Recent algorithmic advances have made equality saturation an appealing technique for program optimization, avoiding the phase-ordering problem by separating the discovery of equiva…
eqsat: An Equality Saturation Dialect for Non-destructive Rewriting
Jules Merckx, Alexandre Lopoukhine, Samuel Coward +3
With recent algorithmic improvements and easy-to-use libraries, equality saturation is being picked up for hardware design, program synthesis, theorem proving, program optimization…
Small Proofs from Congruence Closure
Oliver Flatt, Samuel Coward, Max Willsey +2
Satisfiability Modulo Theory (SMT) solvers and equality saturation engines must generate proof certificates from e-graph-based congruence closure procedures to enable verification…