A new categorical framework and automated tool synthesize sound backward error bounds for a broad class of numerical programs including those with variable reuse.
Wilcox, and Zachary Tatlock
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
representative citing papers
A Monte Carlo estimator converts stateless optimal DPOR into an unbiased poly-time estimator for the number of Mazurkiewicz traces by sampling paths in the exploration tree and using stochastic enumeration to control variance.
A new abstract interpretation algorithm enables sound optimistic analysis of e-graphs during equality saturation, unifying it with non-destructive rewriting and improving precision on cyclic SSA programs.
Quarry improves Rocq proof automation success rates by 7-13% under 10-minute budgets via LLM-planned decompositions ranked by a proof-state difficulty model for CoqHammer solvability.
citing papers explorer
-
Synthesizing Backward Error Bounds, Backward
A new categorical framework and automated tool synthesize sound backward error bounds for a broad class of numerical programs including those with variable reuse.
-
State Space Estimation for DPOR-based Model Checkers(Extended Version)
A Monte Carlo estimator converts stateless optimal DPOR into an unbiased poly-time estimator for the number of Mazurkiewicz traces by sampling paths in the exploration tree and using stochastic enumeration to control variance.
-
Optimism in Equality Saturation
A new abstract interpretation algorithm enables sound optimistic analysis of e-graphs during equality saturation, unifying it with non-destructive rewriting and improving precision on cyclic SSA programs.
-
Planning to Hammer: Difficulty-Aware Decomposition for Automating Rocq Proofs
Quarry improves Rocq proof automation success rates by 7-13% under 10-minute budgets via LLM-planned decompositions ranked by a proof-state difficulty model for CoqHammer solvability.