Mon 15 Jun 2026 13:40 - 14:05 at Meadows CD - Session 3

Equality saturation has become a dominant paradigm for equational program optimization. However, it has never been rigorously compared to another approach to the same problem, even though several exist, the most notable being stochastic search. In this paper, we compare equality saturation to stochastic search over five benchmarks to answer the question: are e-graphs actually good?

Mon 15 Jun

Displayed time zone: Mountain Time (US & Canada) change

13:40 - 15:20
Session 3EGRAPHS at Meadows CD
13:40
25m
Talk
Rewrite System Showdown: Stochastic Search vs. EqSat
EGRAPHS
Qiantan Hong Stanford University, Rupanshu Soi Stanford University, Yihong Zhang University of Washington, Alex Aiken Stanford University
Pre-print
14:05
25m
Talk
A Joint Approach to Instruction Scheduling and Algebraic Rewriting with E-Graphs
EGRAPHS
Qiantan Hong Stanford University, Rupanshu Soi Stanford University, Alex Aiken Stanford University
14:30
25m
Talk
Answer Set Programming for Egg Extraction and More
EGRAPHS
Ziyi Yang National University of Singapore, Ilya Sergey National University of Singapore
Pre-print
14:55
25m
Talk
CERES: Making Equality Saturation Memory-Scalable
EGRAPHS
Akash Pardeshi University of Illinois at Urbana-Champaign, Devansh Jain University of Illinois at Urbana-Champaign, Saatvik Lochan University of Illinois Urbana-Champaign, Mihir Tandon University of Illinois Urbana-Champaign, Marco Frigo University of Illinois at Urbana-Champaign, Chamika Sudusinghe University of Illinois at Urbana-Champaign, Damitha Lenadora University of Illinois at Urbana-Champaign, Charith Mendis University of Illinois at Urbana-Champaign