~/talk

Versioned E-Graphs

Talkat PLDI 2026 · 2026-06-15..06-19· [compilers-and-language-design]
links:none on file
links:none on file
slides:none on file

Introduces versioned e-graphs that store multiple conditional equivalence sets in one structure, implements a versioned union-find with propagation and version path compression, mechanizes correctness in Lean and ships a reusable Rust library supporting rebuilding, e‑class analyses, e‑matching and extraction. Evaluations use 25,000 random configs, 6,000 SMT‑LIB UF benchmarks and 300 Tety benchmarks; versioned e‑graphs cut memory by 5–30% and run up to 4× faster than cloning or naive persistent baselines.

AI-written summary · about

  1. 0:00Versioned e-graphs intro
  2. 2:12Program verification motivation
  3. 10:40Union-find design challenges
  4. 13:13Extending versioned e-graphs
  5. 17:22Summary and evaluation
  6. 18:25Q&A
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.