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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
baseline 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
baseline 1polarities
baseline 1representative citing papers
Case study shows that CHC transformations eliminating inductive data structures enable effective verification of partial correctness and arithmetic properties for several sorting algorithms using existing solvers.
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.
-
Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification
Case study shows that CHC transformations eliminating inductive data structures enable effective verification of partial correctness and arithmetic properties for several sorting algorithms using existing solvers.