Proving Opacity of a Pessimistic {STM}
From MaRDI portal
Publication:3174968
DOI10.4230/LIPICS.OPODIS.2016.35zbMath1432.68070OpenAlexW2565252139MaRDI QIDQ3174968
Simon Doherty, Brijesh Dongol, John Derrick, Gerhard Schellhorn, Heike Wehrheim
Publication date: 18 July 2018
Full work available at URL: https://bura.brunel.ac.uk/bitstream/2438/13508/1/Fulltext.pdf
Formal languages and automata (68Q45) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items (3)
Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory ⋮ Checking opacity and durable opacity with FDR ⋮ Verifying correctness of persistent concurrent data structures: a sound and complete method
Uses Software
This page was built for publication: Proving Opacity of a Pessimistic {STM}
