Efficient algorithms for verifying memory consistency
- 18 July 2005
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 245-252
- https://doi.org/10.1145/1073970.1074011
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A unified theory of shared memory consistencyJournal of the ACM, 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
- Verifying sequential consistency using vector clocksPublished by Association for Computing Machinery (ACM) ,2002
- Automatable verification of sequential consistencyPublished by Association for Computing Machinery (ACM) ,2001
- On testing cache-coherent shared memoriesPublished by Association for Computing Machinery (ACM) ,1994
- Access graphs: a model for investigating memory consistencyIEEE Transactions on Parallel and Distributed Systems, 1994
- Race-free interconnection networks and multiprocessor consistencyPublished by Association for Computing Machinery (ACM) ,1991
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978