Assertional reasoning about data races in relaxed memory models

Authors:
Beverly A. Sanders;KyungHee Kim
Affiliations:
University of Florida, Gainesville, FL, USA;University of Florida, Gainesville, FL, USA
Venue:
Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
Year:
2008

Citing 3
Cited 0

Verifying properties of parallel programs: an axiomatic approach

Communications of the ACM
The Java memory model

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A theory of memory models

Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.