Last-use opacity: a strong safety property for transactional memory with prerelease support

DOI10.1007/s00446-022-00420-2zbMath1489.68052arXiv1506.06275OpenAlexW4224046843MaRDI QIDQ2146873

Konrad Siek, Paweł T. Wojciechowski

Publication date: 21 June 2022

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.06275

zbMATH Keywords

consistencyconcurrency controltransactional memorysafety property

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• SAMOA
• AtomCaml
• JudoSTM

Cites Work

• Unnamed Item
• Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)
• Towards formally specifying and verifying transactional memory
• AtomCaml
• Elastic Transactions
• The serializability of concurrent database updates
• Proving the Correctness of Multiprocess Programs
• Formal Aspects of Serializability in Database Concurrency Control
• A theory of reliability in database systems
• A programming language perspective on transactional memory consistency
• The semantics of progress in lock-based transactional memory
• Software transactional memory