Bonsai compiles queries to pruned tree traversals by deriving pruning conditions with extended symbolic interval analysis and fusing compound queries into single traversals.
Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages & Applications , pages =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Verifying sequential consistency with at most π preemptions is polynomial-time for single-writer programs, NP-hard for two-writer programs, and has an ETH-based conditional lower bound for three-writer programs.
Consistency testing for release-acquire C11 is in P with one writer per location but NP-hard with two writers and ETH-hard for subexponential time with three writers.
citing papers explorer
-
Bonsai: Compiling Queries to Pruned Tree Traversals
Bonsai compiles queries to pruned tree traversals by deriving pruning conditions with extended symbolic interval analysis and fusing compound queries into single traversals.
-
Verifying Sequential Consistency under Bounded Preemptions
Verifying sequential consistency with at most π preemptions is polynomial-time for single-writer programs, NP-hard for two-writer programs, and has an ETH-based conditional lower bound for three-writer programs.
-
Complexity of Consistency Testing for the Release-Acquire Semantics
Consistency testing for release-acquire C11 is in P with one writer per location but NP-hard with two writers and ETH-hard for subexponential time with three writers.