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 fourth 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.
Tue 17 JunDisplayed time zone: Seoul change
09:00 - 10:10 | |||
09:00 20mTalk | Cut Tracing with E-Graphs for Boolean FHE Circuit Synthesis EGRAPHS | ||
09:20 20mTalk | Optimizing Optimizations: Case Study on Detecting Specific Types of Mathematical Optimization Constraints with E-Graphs in JijModeling EGRAPHS | ||
09:40 20mTalk | Using Equality Saturation and Stochastic Mutations for Molecular Dynamics Code Optimization EGRAPHS Oren Hecht Technion, Yotam M. Y. Feldman Tel Aviv University, Barak Hirshberg Tel Aviv University, Hila Peleg Technion | ||
10:30 - 12:00 | |||
10:30 20mTalk | eqsat: An Equality Saturation Dialect for Non-destructive Rewriting EGRAPHS Jules Merckx Ghent University, Alexandre Lopoukhine University of Cambridge, Samuel Coward Imperial College London, UK / Intel Corporation, Jianyi Cheng University of Edinburgh, UK, Bjorn De Sutter Ghent University, Belgium , Tobias Grosser University of Cambridge Pre-print | ||
10:50 20mTalk | Hatching Theory Instantiations with Yardbird EGRAPHS Cole Vick University of Texas at Austin, Samuel Thomas The University of Texas at Austin, Texas, USA | ||
11:10 20mTalk | Automated High-Level Synthesis Design Modularization via E-Graph Anti-Unification EGRAPHS Andy Wanna Georgia Institute of Technology, Cong "Callie" Hao Georgia Institute of Technology, Theo Drane AMD | ||
14:00 - 15:20 | |||
14:00 20mTalk | Destructive E-Graph Rewrites EGRAPHS Paul Zhang University of California, Los Angeles, Yisu Remy Wang University of California, Los Angeles | ||
14:20 20mTalk | Incremental Equality Saturation EGRAPHS Rupanshu Soi Stanford University, Benjamin Driscoll Stanford University, Ke Wang Visa Research, Alex Aiken Stanford University | ||
14:40 20mTalk | Oatlog: A performant ahead-of-time compiled e-graph engine EGRAPHS Loke Gustafsson Chalmers University of Technology, Erik Magnusson Chalmers University of Technology, Alejandro Luque Cerpa Chalmers University of Technology File Attached | ||
15:40 - 17:00 | |||
15:40 20mTalk | Equality Saturation Guided by Large Language Models EGRAPHS | ||
16:00 20mTalk | Machine Learning Guided Equality Saturation EGRAPHS Nicole Heinimann Technische Universität Berlin, Thomas Koehler CNRS - ICube Lab, Michel Steuwer Technische Universität Berlin | ||
16:20 20mTalk | Omelets Need Onions: E-graphs Modulo Theories via Bottom Up E-Matching EGRAPHS Philip Zucker Draper Pre-print | ||
Accepted Presentations
Call for Papers
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.
Deadline is in the anywhere-on-earth timezone.
| Thu 17 Apr 2025 Submission Deadline |
