Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory
- Submitting institution
-
The University of Sheffield
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 7852
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-030-50086-3_3
- Title of conference / published proceedings
- Formal Techniques for Distributed Objects, Components, and Systems. FORTE 2020. Lecture Notes in Computer Science
- First page
- 39
- Volume
- 12136
- Issue
- -
- ISSN
- 0302-9743
- Open access status
- Compliant
- Month of publication
- June
- Year of publication
- 2020
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
5
- Research group(s)
-
I - Verification
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The work came out of a series of EPSRC projects on the verification of concurrent algorithms (EP/J003727/1, EP/M017044/1 and EP/R032351/1) and national and international collaborations (Kent, Surrey, ARM, Paderborn and Augsburg). Software TM is seeing implementation in the latest chips, and running TM algorithms on the emerging and important non-volatile memory (NVM) architecture is going to be crucial. Here we not only develop new TM algorithms and new correctness criteria for NVM, we design a proof technique for correctness and show how to mechanise the proofs in Isabelle. The paper won best paper award at FORTE 2020.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -