Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory - Formal Techniques for Distributed Objects, Components, and Systems Access content directly
Conference Papers Year : 2020

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

Abstract

Non-volatile memory (NVM), aka persistent memory, is a new paradigm for memory that preserves its contents even after power loss. The expected ubiquity of NVM has stimulated interest in the design of novel concepts ensuring correctness of concurrent programming abstractions in the face of persistency. So far, this has lead to the design of a number of persistent concurrent data structures, built to satisfy an associated notion of correctness: durable linearizability.In this paper, we transfer the principle of durable concurrent correctness to the area of software transactional memory (STM). Software transactional memory algorithms allow for concurrent access to shared state. Like linearizability for concurrent data structures, opacity is the established notion of correctness for STMs. First, we provide a novel definition of durable opacity extending opacity to handle crashes and recovery in the context of NVM. Second, we develop a durably opaque version of an existing STM algorithm, namely the Transactional Mutex Lock (TML). Third, we design a proof technique for durable opacity based on refinement between TML and an operational characterisation of durable opacity by adapting the TMS2 specification. Finally, we apply this proof technique to show that the durable version of TML is indeed durably opaque. The correctness proof is mechanized within Isabelle.
Fichier principal
Vignette du fichier
495615_1_En_3_Chapter.pdf (267.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03283234 , version 1 (09-07-2021)

Licence

Attribution

Identifiers

Cite

Eleni Bila, Simon Doherty, Brijesh Dongol, John Derrick, Gerhard Schellhorn, et al.. Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory. 40th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2020, Valletta, Malta. pp.39-58, ⟨10.1007/978-3-030-50086-3_3⟩. ⟨hal-03283234⟩
47 View
7 Download

Altmetric

Share

Gmail Facebook X LinkedIn More