A high-level semantics for program execution under total store order memory

DOI10.1007/978-3-642-39718-9_11zbMATH Open1405.68174OpenAlexW119039509MaRDI QIDQ2851906FDOQ2851906

Authors: Brijesh Dongol, Oleg Travkin, John Derrick, Heike Wehrheim 

Publication date: 4 October 2013

Published in: Theoretical Aspects of Computing – ICTAC 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39718-9_11

Recommendations

• Reasoning algebraically about refinement on TSO architectures
• From total store order to sequential consistency: a practical reduction theorem
• A load-buffer semantics for total store ordering
• Reasoning about TSO programs using reduction and abstraction
• Deciding Robustness against Total Store Ordering

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Cited In (4)

• Parallelized sequential composition and hardware weak memory models
• From total store order to sequential consistency: a practical reduction theorem
• A denotational semantics for SPARC TSO
• Reasoning algebraically about refinement on TSO architectures

Uses Software

• Checkfence

This page was built for publication: A high-level semantics for program execution under total store order memory

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