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.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
PEQUOD verifies relational properties on JVM bytecode by simultaneously synthesizing invariants and finding synchronization points guided by those invariants.
PrevaRank ranks plausible patches from APR tools using similarity to historic fix features, improving correct fix placement in top ranks on Defects4J bugs.
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.
-
Relational Verification via Invariant-Guided Synchronization
PEQUOD verifies relational properties on JVM bytecode by simultaneously synthesizing invariants and finding synchronization points guided by those invariants.
-
Ranking Plausible Patches by Historic Feature Frequencies
PrevaRank ranks plausible patches from APR tools using similarity to historic fix features, improving correct fix placement in top ranks on Defects4J bugs.