Proving Opacity via Linearizability: A Sound and Complete Method

DOI10.1007/978-3-319-60225-7_4zbMath1489.68138OpenAlexW2617069544MaRDI QIDQ5082190

Alasdair Armstrong, Brijesh Dongol, Simon Doherty

Publication date: 15 June 2022

Published in: Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01658425/file/446833_1_En_4_Chapter.pdf

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14) Formalization of mathematics in connection with theorem provers (68V20)

Related Items

Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory ⋮ Checking opacity and durable opacity with FDR ⋮ Unnamed Item

Uses Software

• Isabelle