Data Structure Free Compilation
No abstract available.
DOI 10.1007/978-3-540-49051-7_1
Related papers
- Every data structure deserves lock-free memory reclamation OOPSLA 2018
- Adaptive lock-free maps: purely-functional to scalable ICFP 2015
- A context-free markup language for semi-structured text PLDI 2010
- Compiler-Assisted Crash Consistency for PMEM ISMM 2025
- Snapshot-free, transparent, and robust memory reclamation for lock-free data structures PLDI 2021
- Relaxed Linear References for Lock-free Data Structures ECOOP 2017
- Cruiser: concurrent heap buffer overflow monitoring using lock-free data structures PLDI 2011
- A practical wait-free simulation for lock-free data structures PPoPP 2014