A bisimulation-invariant synthesis framework for optimal predicate pushdown in fold-based UDFs produces correct transformations that speed up 150 real pipelines by 2.4x on average.
Jackson, Shaz Qadeer, Sriram K
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 2
dataset 1
citation-polarity summary
fields
cs.PL 4representative citing papers
Full verification of compiler optimizations requires roughly an order of magnitude more development effort than credible compilation when implemented by a coding agent.
Underapproximate types with symbolic traces guide synthesis of test generators that outperform defaults in property-based testing and model checking for effectful programs.
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.
citing papers explorer
-
Optimal Predicate Pushdown Synthesis
A bisimulation-invariant synthesis framework for optimal predicate pushdown in fold-based UDFs produces correct transformations that speed up 150 real pipelines by 2.4x on average.
-
Quantitative Comparison of Credible Compilation and Verification In Coding Agent Compiler Development
Full verification of compiler optimizations requires roughly an order of magnitude more development effort than credible compilation when implemented by a coding agent.
-
Trace-Guided Synthesis of Effectful Test Generators
Underapproximate types with symbolic traces guide synthesis of test generators that outperform defaults in property-based testing and model checking for effectful programs.
-
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.