Characterizing Transactional Memory Consistency Conditions Using Observational Refinement

DOI10.1145/3131360MaRDI QIDQ3177890zbMATHOpenAlexFDO

Authors Hagit Attiya, Alexey Gotsman, S. Hans, Noam Rinetzky

Publication date 2 August 2018

Published in Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

atomicityopacitytransactionsTMScorrectness conditionsSTMSstrong transactional memory specificationtransactional memory specification

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 7075871
• A programming language perspective on transactional memory consistency
• Perspectives on Transactional Memory
• Towards a formal account for software transactional memory
• On the liveness of transactional memory
• Towards formally specifying and verifying transactional memory

Cited in

(5)

• Checking robustness between weak transactional consistency models
• Correctness of concurrent executions of closed nested transactions in transactional memory systems
• scientific article; zbMATH DE number 7075871 (Why is no real title available?)
• Proving opacity of transactional memory with early release
• A programming language perspective on transactional memory consistency

This page was built for publication: Characterizing Transactional Memory Consistency Conditions Using Observational Refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177890)