LIPIcs.CONCUR.2024.2.pdf
- Filesize: 261 kB
- 1 pages
Document
Principles of Persistent Programming (Invited Talk)
Author
-
Part of:
Volume:
35th International Conference on Concurrency Theory (CONCUR 2024)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Concurrency Theory (CONCUR) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-08-29
Cite AsGet BibTex
Azalea Raad. Principles of Persistent Programming (Invited Talk). In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.CONCUR.2024.2
https://doi.org/10.4230/LIPIcs.CONCUR.2024.2
Abstract
Persistent programming is the art of developing programs that operate on persistent (non-volatile) states that survive program termination, be it planned or abrupt (e.g. due to a power failure). Persistent programming poses several important challenges: 1) persistent systems have complex - and often unspecified - semantics in that operations do not generally persist in their execution order; 2) software bugs in persistent settings can lead to permanent data corruption; and 3) traditional testing techniques are inapplicable in persistent settings. Can formal methods come to the rescue?
Subject Classification
ACM Subject Classification
- Theory of computation → Program verification
Keywords
- Persistent Programming
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads