10 citations · 12 across the 5 of their papers we have counts for
5 papers
E-Graphs as a Persistent Compiler Abstraction
Jules Merckx, Alexandre Lopoukhine, Samuel Coward +3
Recent algorithmic advances have made equality saturation an appealing technique for program optimization, avoiding the phase-ordering problem by separating the discovery of equiva…
eqsat: An Equality Saturation Dialect for Non-destructive Rewriting
Jules Merckx, Alexandre Lopoukhine, Samuel Coward +3
With recent algorithmic improvements and easy-to-use libraries, equality saturation is being picked up for hardware design, program synthesis, theorem proving, program optimization…
Verifying Peephole Rewriting In SSA Compiler IRs
Siddharth Bhat, Alex Keizer, Chris Hughes +2
There is an increasing need for domain-specific reasoning in modern compilers. This has fueled the use of tailored intermediate representations (IRs) based on static single assignm…
A shared compilation stack for distributed-memory parallelism in stencil DSLs
George Bisbas, Anton Lydike, Emilien Bauer +8
Domain Specific Languages (DSLs) increase programmer productivity and provide high performance. Their targeted abstractions allow scientists to express problems at a high level, pr…
Sidekick compilation with xDSL
Mathieu Fehr, Michel Weber, Christian Ulmann +5
Traditionally, compiler researchers either conduct experiments within an existing production compiler or develop their own prototype compiler; both options come with trade-offs. On…