Bonsai compiles queries to pruned tree traversals by deriving pruning conditions with extended symbolic interval analysis and fusing compound queries into single traversals.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.PL 2years
2025 2verdicts
UNVERDICTED 2representative citing papers
Allegro applies multi-stage programming to PBT generators and pairs it with faster randomness to achieve up to 13x faster bug discovery while exactly preserving generator semantics.
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.
-
Fail Faster: Staging and Fast Randomness for High-Performance PBT
Allegro applies multi-stage programming to PBT generators and pairs it with faster randomness to achieve up to 13x faster bug discovery while exactly preserving generator semantics.