Avery Laird
where else to find them
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
all 6 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Panel: Compilation Frameworks | Sparse 2024 | 2024-06-25 |
Discussion shows a concrete path for quantify over bitwidth proofs: Lean supports quantifying bitwidth but only offers high‑performance automation for fixed… | ||
| SpEQ: Translation of Sparse Codes using Equivalences | EGRAPHS 2024 | 2024-06-24 |
SpEQ is a tool (PLDI 2024) that detects when code matches small reference C implementations by translating LLVM IR into e-graphs, adding memory-version returns… | ||
| SpEQ: Translation of Sparse Codes using Equivalences | EGRAPHS 2024 | 2024-06-24 |
SpEQ detects sparse-data semantics via equivalence checks that prove a CSR-style loop is equivalent to a dense reference, then uses e-graphs (equality… | ||
| SpEQ: Translation of Sparse Codes using Equivalences | PLDI 2024 | 2024-06-24 |
SpEQ detects implicit sparse storage, symbolically reconstructs a dense semantics, and uses an equivalence check plus lightweight runtime guards to guarantee… | ||
| nothing matches | ||