A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Efficient algorithms for verifying memory consistency
2005
Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures - SPAA'05
One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It has been shown in prior work, however, that accurately verifying such compliance even of a single execution result is an NP-complete problem, for an unlimited number of processors. In this paper, we present a suite of post-mortem algorithms that perform the compliance check in an efficient, although not exhaustive,
doi:10.1145/1073970.1074011
dblp:conf/spaa/ManovitH05
fatcat:7ks4xzcrwvalfo3scljn57yblq