PLDI 2026 (series) / EGRAPHS 2026 (series) / EGRAPHS /
Rewrite System Showdown: Stochastic Search vs. EqSat
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 JunDisplayed time zone: Mountain Time (US & Canada) change
Mon 15 Jun
Displayed time zone: Mountain Time (US & Canada) change
13:40 - 15:20 | |||
13:40 25mTalk | 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 25mTalk | A Joint Approach to Instruction Scheduling and Algebraic Rewriting with E-Graphs EGRAPHS | ||
14:30 25mTalk | Answer Set Programming for Egg Extraction and More EGRAPHS Pre-print | ||
14:55 25mTalk | 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 | ||