Fast and Generalized Polynomial Time Memory Consistency Verification
- 1 January 2006
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 503-516
- https://doi.org/10.1007/11817963_46
Abstract
No abstract availableKeywords
Other Versions
This publication has 11 references indexed in Scilit:
- Efficient algorithms for verifying memory consistencyPublished by Association for Computing Machinery (ACM) ,2005
- TSOtool: a program for verifying memory systems using the memory consistency modelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Constraint graph analysis of multithreaded programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- QB or Not QB: An Efficient Execution Verification Tool for Memory OrderingsLecture Notes in Computer Science, 2004
- The complexity of verifying memory coherencePublished by Association for Computing Machinery (ACM) ,2003
- The complexity of sequential consistencyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Memory consistency and event ordering in scalable shared-memory multiprocessorsPublished by Association for Computing Machinery (ACM) ,1998
- Shared memory consistency models: a tutorialComputer, 1996
- Loop ParallelizationPublished by Springer Science and Business Media LLC ,1994
- A Theorem on Boolean MatricesJournal of the ACM, 1962