Conditional must not aliasing for static race detection (2007)
| Venue: | In POPL |
| Citations: | 57 - 4 self |
BibTeX
@INPROCEEDINGS{Naik07conditionalmust,
author = {Mayur Naik and Alex Aiken},
title = {Conditional must not aliasing for static race detection},
booktitle = {In POPL},
year = {2007},
pages = {327--338},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract Race detection algorithms for multi-threaded programs using thecommon lock-based synchronization idiom must correlate locks with the memory locations they guard. The heart of a proof ofrace freedom is showing that if two locks are distinct, then the memory locations they guard are also distinct. This is an exampleof a general property we call conditional must not aliasing: Under the assumption that two objects are not aliased, prove that twoother objects are not aliased. This paper introduces and gives an algorithm for conditional must not alias analysis and discussesexperimental results for sound race detection of Java programs.
