Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory-Reference-Cited by-同舟云学术

Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory

Published:2020 Issue: Volume: Page:39-58
ISSN:0302-9743
Container-title:Formal Techniques for Distributed Objects, Components, and Systems
language:
Short-container-title:

Author:

Bila Eleni,Doherty Simon,Dongol Brijesh,Derrick John,Schellhorn Gerhard,Wehrheim Heike

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-50086-3_3

Reference38 articles.

1. Lecture Notes in Computer Science;A Armstrong,2017

2. Lecture Notes in Computer Science;A Armstrong,2017

3. Lecture Notes in Computer Science;H Attiya,2014

4. Ben-David, N., Blelloch, G.E., Friedman, M., Wei, Y.: Delay-free concurrency on faulty persistent memory. In: The 31st ACM Symposium on Parallelism in Algorithms and Architectures, pp. 253–264 (2019)

5. Bila, E., Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., Wehrheim, H.: Defining and verifying durable opacity: correctness for persistent software transactional memory (2020). https://arxiv.org/abs/2004.08200

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A verified durable transactional mutex lock for persistent x86-TSO;Formal Methods in System Design;2024-07-31

2. Intel PMDK Transactions: Specification, Validation and Concurrency;Lecture Notes in Computer Science;2024

3. A Fully Verified Persistency Library;Lecture Notes in Computer Science;2023-12-30

4. Modularising Verification Of Durable Opacity;Logical Methods in Computer Science;2022-07-28

5. View-Based Owicki–Gries Reasoning for Persistent x86-TSO;Programming Languages and Systems;2022