Rebuilding a Tree from Its Traversals: A Case Study of Program Inversion
No abstract available.
DOI 10.1007/978-3-540-40018-9_18
Related papers
- Understanding idiomatic traversals backwards and forwards Haskell 2013
- Sound, fine-grained traversal fusion for heterogeneous trees PLDI 2019
- TreeFuser: a framework for analyzing and fusing general recursive tree traversals OOPSLA 2017
- Non-blocking interpolation search trees with doubly-logarithmic running time PPoPP 2020
- A traversal-based algorithm for higher-order model checking ICFP 2012
- Sparcl: a language for partially-invertible computation ICFP 2020
- Sparcl: A language for partially invertible computation JFP 2024
- Rooting for Efficiency: Mechanised Reasoning about Array-Based Trees in Separation Logic CPP 2024