A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Assertional reasoning about data races in relaxed memory models
2008
Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming - PPoPP '08
Preserved Fulltext
We describe the ideas behind a method to use assertional reasoning to statically show that all sequentially consistent executions of a concurrent program are free from data races.
doi:10.1145/1345206.1345249
dblp:conf/ppopp/SandersK08
fatcat:nl5rjqget5ch7nwo2ixhg57ymu