Research in the EGRAPHS Community has recently exploded in both quantity and diversity. The data structure that powers SMT solvers is now seeing use in synthesis, optimization, and verification via equality saturation and related techniques. In addition to recent advances in the core data structure and techniques, researchers and practitioners are applying e-graphs to domains such as compilers, floating point accuracy, test generation, computational fabrication, automatic vectorization, deep learning compute graphs, symbolic computation, and more.
The fifth EGRAPHS workshop will bring together those working on and with e-graphs, providing a collaborative venue to share work that advances e-graphs as a broadly applicable technique in programming languages or other fields of computing. The program will contain a mix of invited speakers and work-in-progress talks. The symposium seeks papers on a diverse range of topics including (but not limited to):
- e-graphs as data structures and their related algorithms
- equality saturation and other e-graph based rewriting approaches
- applications of e-graphs and/or equality saturation, whether in programming languages or other fields
- tools/frameworks that facilitate the use of e-graphs and associated techniques
- investigations into the human-facing aspects using e-graph-based toolkits including error reporting, debugging, and visualization
- other frameworks for optimizing/analyzing programs in an equational manner
Accepted submissions will not be placed on the ACM DL, so we allow and encourage in-progress or already published relevant work to be presented.
See the call for submissions for more details.
This program is tentative and subject to change.
Mon 15 JunDisplayed time zone: Mountain Time (US & Canada) change
09:00 - 10:10 | |||
09:00 23mTalk | From Rewriting to Fixpoints: Solving Recursive Equations with E-Graphs EGRAPHS Samuel Coward University College London (UCL), Cheng Zhang Worcester Polytechnic Institute, Philip Zucker Draper, Alexandra Silva Cornell University | ||
09:23 23mTalk | Lifting E-Graphs: A Function Isn’t a Constant EGRAPHS Philip Zucker Draper Link to publication | ||
09:46 23mTalk | Predicate E-Graphs with Symbolic Conditional Rewriting EGRAPHS Anders Ågren Thuné Uppsala University, Johannes Borgström Uppsala University, Sweden, Lars-Henrik Eriksson Uppsala University, John Högberg Ericsson, Tjark Weber Uppsala University, Tobias Wrigstad Uppsala University | ||
10:10 - 10:40 | |||
10:10 30mCoffee break | Break Catering | ||
10:40 - 12:20 | |||
10:40 25mTalk | A Semi-Persistent E-Graph with Native AC Canonization and Leapfrog AC Matching. EGRAPHS Remi Delmas Amazon Web Services | ||
11:05 25mTalk | Associativity and Commutativity in Equality Saturation EGRAPHS Tarik Rosin Saarland University, Marcel Ullrich Saarland University, Saarland Informatics Campus, Sebastian Hack Saarland University, Saarland Informatics Campus Pre-print | ||
11:30 25mTalk | Augmenting Rewrite Rule Sets via Knuth-Bendix Completion EGRAPHS Michael Schifferer Saarland University, Marcel Ullrich Saarland University, Saarland Informatics Campus, Sebastian Hack Saarland University, Saarland Informatics Campus Pre-print | ||
11:55 25mTalk | E-graphs modulo theories EGRAPHS Sofia Brookie Chalmers University of Technology | ||
12:20 - 13:40 | |||
12:20 80mLunch | Lunch Catering | ||
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 | ||
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 | ||
15:20 - 15:50 | |||
15:20 30mCoffee break | Break Catering | ||
15:50 - 18:00 | |||
15:50 25mTalk | Relational E-matching in an SMT solver EGRAPHS Amar Shah Carnegie Mellon University, Marijn Heule Carnegie Mellon University, Bryan Parno Carnegie Mellon University, Max Willsey University of California at Berkeley | ||
16:15 25mTalk | E-Stitch: Top-Down Library Learning for E-Graphs EGRAPHS Kavi Gupta MIT, Maddy Bowers Massachusetts Institute of Technology, Armando Solar-Lezama Massachusetts Institute of Technology | ||
16:40 25mTalk | Optimizing Optimizations, Declaratively: Optimizing the Higher-Order Functions in Mathematical Optimization with egglog EGRAPHS Hiromi Ishii JIJ Pre-print | ||
17:05 25mTalk | Poseidon: Profile-Guided Numerical Rewriting at Full-Application Scale EGRAPHS Siyuan Brant Qian University of Illinois at Urbana-Champaign, Vimarsh Sathia University of Illinois Urbana Champaign, Ivan Ivanov Institute of Science Tokyo, Jan Hueckelheim Argonne National Laboratory, Paul Hovland Argonne National Laboratory, William S. Moses University of Illinois Urbana-Champaign | ||
Accepted Talks
Call for Presentations
We invite submissions for talks broadly, including talks that may cover already published or in-progress work. Submissions should be in the form of a 2 to 6 page extended abstract that describes the key problems addressed and/or reusable insights from the proposed talk. Links to preprints, repos, demos, or other media are encouraged!
We welcome submissions from academic, industrial, or independent researchers and practitioners. Talks are intended to foster discussion between members of the e-graph community. The program will include time for Q&A as well as open-ended discussion inspired by the talks.
Submissions and review will take place on HotCRP. Submissions are not anonymous.
At least one author is expected to attend the workshop and present in person.
Authors are encouraged to attend the workshop, but you may also give your presentation virtually.
Deadline is in the anywhere-on-earth timezone.
| Fri 17 Apr 2026 Submission Deadline |
