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 third 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.
Mon 24 JunDisplayed time zone: Windhoek change
09:00 - 10:10 | |||
09:00 10mTalk | Welcome EGRAPHS Max Willsey UC Berkeley | ||
09:10 30mTalk | E-graphs and Automated Reasoning: Looking back to look forward EGRAPHS Philip Zucker Draper Pre-print Media Attached | ||
09:40 30mTalk | Equivalence Hypergraphs: E-Graphs for Monoidal TheoriesRemote EGRAPHS Aleksei Tiurin University of Birmingham, Chris Barrett University of Oxford, Dan Ghica Huawei Research and University of Birmingham Pre-print Media Attached | ||
10:40 - 12:20 | |||
10:40 25mTalk | Slotted E-Graphs EGRAPHS Pre-print Media Attached | ||
11:05 25mTalk | Towards Relational Contextual Equality Saturation EGRAPHS Tyler Hou University of California, Berkeley, Shadaj Laddad University of California at Berkeley, Joseph M. Hellerstein UC Berkeley Pre-print Media Attached | ||
11:30 25mTalk | Performant Dynamically Typed E-Graphs in Pure Julia EGRAPHS Pre-print Media Attached | ||
11:55 25mTalk | EGSTRA: E-Graph-Based Strategy for Test Suite Reduction and Abstraction EGRAPHS Sabrina Reis Lawrence Livermore National Laboratory, Matthew Sottile Lawrence Livermore National Laboratory Media Attached File Attached | ||
16:00 - 17:40 | |||
16:00 25mTalk | Automated Proof Generation for Associative and Distributive Rewriting with E-Graphs EGRAPHS Adrian Lehmann University of Chicago, Ben Caldwell University of Chicago, John Reppy University of Chicago, USA, Robert Rand University of Chicago Media Attached | ||
16:25 25mTalk | superVer: Verifying Probabilistic Independence of Systems of Expressions using Equality Saturation EGRAPHS Alexander Treff University of Lübeck, Pajam Pauls University of Lübeck, Maximilian Orlt TU Darmstadt, Marc Gourjon Hamburg University of Technology and NXP Semiconductors Germany GmbH Media Attached | ||
16:50 25mTalk | Bridging Syntax and Semantics of Lean Expressions in E-Graphs EGRAPHS Pre-print Media Attached | ||
17:15 25mTalk | Disequalities in E-Graphs: An Experiment EGRAPHS George Zakhour University of St. Gallen, Pascal Weisenburger University of St. Gallen, Guido Salvaneschi University of St. Gallen Pre-print Media Attached | ||
Accepted Papers
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.
Deadline is in the anywhere-on-earth timezone.
| Mon 24 Jun 2024 Workshop |
| Fri 3 May 2024 Author Notifications |
| Fri 12 Apr 2024 Submission Deadline |
