A programming language perspective on transactional memory consistency

DOI10.1145/2484239.2484267zbMath1323.68061OpenAlexW2133108345MaRDI QIDQ5176110

Hagit Attiya, Noam Rinetzky, Alexey Gotsman, Sandeep Hans

Publication date: 2 March 2015

Published in: Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2484239.2484267

zbMATH Keywords

transactional memoryobservational refinementatomic blocks

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic programming (68N17) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (5)

Last-use opacity: a strong safety property for transactional memory with prerelease support ⋮ Mechanized proofs of opacity: a comparison of two techniques ⋮ Checking opacity and durable opacity with FDR ⋮ Proving opacity of transactional memory with early release ⋮ Verifying Opacity of a Transactional Mutex Lock

This page was built for publication: A programming language perspective on transactional memory consistency