A Verification-Based Approach to Memory Fence Insertion in Relaxed Memory Systems
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature
- p. 144-160
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- x86-TSOCommunications of the ACM, 2010
- An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models2010
- A Better x86 Memory Model: x86-TSO2009
- State-space exploration for concurrent algorithms under weak memory orderingsACM SIGARCH Computer Architecture News, 2008
- Effective Program Verification for Relaxed Memory Models2008
- CheckFence2007
- The power of QDDs (extended abstract)1997
- Partial-Order Methods for the Verification of Concurrent Systems1996
- Symbolic verification with periodic sets1994
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess ProgramsIEEE Transactions on Computers, 1979