PLDI 2025
Mon 16 - Fri 20 June 2025 Seoul, South Korea
Tue 17 Jun 2025 14:20 - 14:40 at Orchid - Performance

We introduce a new equality saturation algorithm that efficiently optimizes terms available at different points in time using a single (incremental) e-graph, thereby extending the structure sharing benefits of standard equality saturation temporally.

Tue 17 Jun

Displayed time zone: Seoul change

14:00 - 15:20
PerformanceEGRAPHS at Orchid
14:00
20m
Talk
Destructive E-Graph Rewrites
EGRAPHS
Paul Zhang University of California, Los Angeles, Yisu Remy Wang University of California, Los Angeles
Media Attached
14:20
20m
Talk
Incremental Equality Saturation
EGRAPHS
Rupanshu Soi Stanford University, Benjamin Driscoll Stanford University, Ke Wang Visa Research, Alex Aiken Stanford University
Pre-print Media Attached
14:40
20m
Talk
Oatlog: A performant ahead-of-time compiled e-graph engineRecorded
EGRAPHS
Loke Gustafsson Chalmers University of Technology, Erik Magnusson Chalmers University of Technology, Alejandro Luque Cerpa Chalmers University of Technology
Media Attached File Attached