167 citations · 176 across the 13 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.PL2022
Small Proofs from Congruence Closure
Oliver Flatt, Samuel Coward, Max Willsey +2
Satisfiability Modulo Theory (SMT) solvers and equality saturation engines must generate proof certificates from e-graph-based congruence closure procedures to enable verification…
cs.SC2022
Synthesizing Mathematical Identities with E-Graphs
Ian Briggs, Pavel Panchekha
Identities compactly describe properties of a mathematical expression and can be leveraged into faster and more accurate function implementations. However, identities must currentl…
cs.PL2022
Optimal Heap Limits for Reducing Browser Memory Use
Marisa Kirisame, Pranav Shenoy, Pavel Panchekha
Garbage-collected language runtimes carefully tune heap limits to reduce garbage collection time and memory usage. However, there's a trade-off: a lower heap limit reduces memory u…