E-Graph Research, Applications, Practices, and Human-factors SymposiumEGRAPHS 2023
Research on and around e-graphs 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 second 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
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.
This program is tentative and subject to change.
Sun 18 JunDisplayed time zone: Eastern Time (US & Canada) change
09:00 - 11:00
EGRAPHS: OptimizationEGRAPHS at Magnolia 18
|Automating Constraint-Aware Datapath Optimization using E-Graphs|
Samuel Coward Imperial College London, UK / Intel Corporation, George A. Constantinides Imperial College London, UK, Theo Drane Intel Corporation, USAPre-print
|egglog In Practice: Automatically Improving Floating-point Error|
Oliver Flatt University of Washington, Yihong Zhang University of Washington
|Optimizing Stateful Dataflow with Local Rewrites|
Shadaj Laddad University of California at Berkeley, Conor Power University of California at Berkeley, Tyler Hou University of California, Berkeley, Alvin Cheung University of California at Berkeley, Joseph M. Hellerstein University of California, Berkeley
|Egg-smol Python: A Pythonic Library for E-graphs|
11:20 - 12:30
EGRAPHS: VerificationEGRAPHS at Magnolia 18
|KestRel: Relational Verification using E-Graphs for Program Alignment|
Robert Dickerson Purdue University, Benjamin Delaware Purdue University
|Partially Complete Quantifier Elimination|
Isabel Garcia-Contreras University of Waterloo, Hari Govind V K University of Waterloo, Sharon Shoham Tel Aviv University, Arie Gurfinkel University of Waterloo
|Ensuring the termination of equality saturation for terminating term rewriting systems|
Yihong Zhang University of Washington, Oliver Flatt University of Washington
14:00 - 15:30
EGRAPHS: Invited TalkEGRAPHS at Magnolia 18
|ægraphs: Acyclic E-graphs for Efficient Optimization in a Production CompilerInvited Talk|
Chris Fallin Fastly
16:00 - 17:50
EGRAPHS: Binding & ExtractionEGRAPHS at Magnolia 18
|Optimizing bindings in e-graphs|
Emmanuel Anaya-Gonzalez UCSD, Cole Kurashige UCSD, Aditya Giridharan UCSD, Nadia Polikarpova University of California at San Diego
|Improving Term Extraction with Acyclic Constraints|
Deyuan (Mike) He Princeton University, Haichen Dong Princeton University, Sharad Malik Princeton University, Aarti Gupta Princeton University
|E-graph Extraction Using ZDDs|
Eli Rosenthal Google
Call for Presentations
We invite submission 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.