Fast Durably Linearizable Data Structures for Free
Open Access
- 16 June 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 40-48
Abstract
No abstract availableFunding Information
- Engineering and Physical Sciences Research Council (EP/Y036417/1,EP/Y036425/1,EP/X037142/1,EP/X015149/1,EP/V038915/1,EP/R025134/2)
- Royal Society (IES\R1\221226)
This publication has 23 references indexed in Scilit:
- A verified durable transactional mutex lock for persistent x86-TSOFormal Methods in System Design, 2024
- Intel PMDK Transactions: Specification, Validation and Concurrency2024
- A Fully Verified Persistency Library2023
- Recoverable Mutual Exclusion2023
- Flat-Combining-Based Persistent Data Structures for Non-volatile Memory2021
- Verifying correctness of persistent concurrent data structures: a sound and complete methodFormal Aspects of Computing, 2021
- Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory2020
- Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model2016
- Flat combining and the synchronization-parallelism tradeoff2010
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess ProgramsIEEE Transactions on Computers, 1979