On the verification problem for weak memory models
Authors:
Open Access
- 17 January 2010
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 45 (1) , 7-18
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Effective Program Verification for Relaxed Memory Models2008
- Implied Set Closure and Its Application to Memory Consistency Verification2008
- Expand, Enlarge and Check: New algorithms for the coverability problem of WSTSJournal of Computer and System Sciences, 2006
- A Complete Abstract Interpretation Framework for Coverability Properties of WSTS2005
- Verifying lossy channel systems has nonprimitive recursive complexityInformation Processing Letters, 2002
- Well-structured transition systems everywhere!Theoretical Computer Science, 2001
- Verifying Programs with Unreliable ChannelsInformation and Computation, 1996
- Shared memory consistency models: a tutorialComputer, 1996
- The complexity of propositional linear temporal logicsJournal of the ACM, 1985
- A variant of a recursively unsolvable problemBulletin of the American Mathematical Society, 1946