Brief Announcement: Survey of Persistent Memory Correctness Conditions

Authors Naama Ben-David, Michal Friedman, Yuanhao Wei

Thumbnail PDF


  • Filesize: 0.49 MB
  • 4 pages

Document Identifiers

Author Details

Naama Ben-David
  • VMware Research, Palo Alto, CA, USA
Michal Friedman
  • ETH Zürich, Switzerland
Yuanhao Wei
  • Carnegie Mellon University, Pittsburgh, PA, USA

Cite AsGet BibTex

Naama Ben-David, Michal Friedman, and Yuanhao Wei. Brief Announcement: Survey of Persistent Memory Correctness Conditions. In 36th International Symposium on Distributed Computing (DISC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 246, pp. 41:1-41:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


In this brief paper, we survey existing correctness definitions for concurrent persistent programs.

Subject Classification

ACM Subject Classification
  • Hardware → Memory and dense storage
  • Theory of computation
  • Persistence
  • Correctness
  • Concurrency


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Marcos K Aguilera and Svend Frølund. Strict linearizability and the power of aborting. Technical Report HPL-2003-241, 2003. Google Scholar
  2. Hagit Attiya, Ohad Ben-Baruch, and Danny Hendler. Nesting-safe recoverable linearizability: Modular constructions for non-volatile memory. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, pages 7-16. ACM, 2018. Google Scholar
  3. Naama Ben-David, Guy E Blelloch, Michal Friedman, and Yuanhao Wei. Delay-free concurrency on faulty persistent memory. In The 31st ACM on Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 253-264. ACM, 2019. Google Scholar
  4. Naama Ben-David, Michal Friedman, and Yuanhao Wei. Survey of persistent memory correctness conditions. arXiv preprint, 2022. URL:
  5. Ryan Berryhill, Wojciech Golab, and Mahesh Tripunitara. Robust shared objects for non-volatile main memory. In 19th International Conference on Principles of Distributed Systems (OPODIS 2015). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2016. Google Scholar
  6. Michal Friedman, Maurice Herlihy, Virendra Marathe, and Erez Petrank. A persistent lock-free queue for non-volatile memory. In ACM SIGPLAN Notices, pages 28-40. ACM, 2018. Google Scholar
  7. Wojciech Golab and Aditya Ramaraju. Recoverable mutual exclusion. Distributed Computing, 32(6):535-564, 2019. Google Scholar
  8. Rachid Guerraoui and Ron R Levy. Robust emulations of shared memory in a crash-recovery model. In 24th International Conference on Distributed Computing Systems, 2004. Proceedings., pages 400-407. IEEE, 2004. Google Scholar
  9. Joseph Izraelevitz, Hammurabi Mendes, and Michael L Scott. Linearizability of persistent memory objects under a full-system-crash failure model. In International Symposium on Distributed Computing, pages 313-327. Springer, 2016. Google Scholar
  10. Nan Li and Wojciech Golab. Detectable sequential specifications for recoverable shared objects. In 35th International Symposium on Distributed Computing (DISC 2021). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2021. Google Scholar