From Total Store Order to Sequential Consistency: A Practical Reduction Theorem
- 1 January 2010
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Reasoning about the Implementation of Concurrency Abstractions on x86-TSOPublished by Springer Nature ,2010
- On Validity of Program Transformations in the Java Memory ModelPublished by Springer Nature ,2008
- Effective Program Verification for Relaxed Memory ModelsPublished by Springer Nature ,2008
- Formalising Java’s Data Race Free GuaranteePublished by Springer Nature ,2007
- Operational Reasoning for Concurrent Caml Programs and Weak Memory ModelsPublished by Springer Nature ,2007
- Isabelle/HOLPublished by Springer Nature ,2002
- Shared memory consistency models: a tutorialComputer, 1996