Defining Data Structures via Böhm-Out
Abstract
Abstract We show that any recursively enumerable subset of a data structure can be regarded as the solution set to a Böhm-out problem.
Related papers
- Interaction Equivalence POPL 2025
- Quantitative relaxation of concurrent data structures POPL 2013
- Data Races and Static Analysis for Interrupt-Driven Kernels ESOP 2019
- Array regrouping and structure splitting using whole-program reference affinity PLDI 2004
- The Bologna Optimal Higher-Order Machine JFP 1996
- A practical wait-free simulation for lock-free data structures PPoPP 2014
- Out of Control: Reducing Probabilistic Models by Control-State Elimination VMCAI 2022
- Towards understanding the costs of avoiding out-of-thin-air results OOPSLA 2018