Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
sav07_lecture_26 [2007/07/01 22:58] feride.cetin |
sav07_lecture_26 [2007/07/02 01:37] feride.cetin |
||
---|---|---|---|
Line 127: | Line 127: | ||
* Ignoring the effects of reflection and dynamic class loading. | * Ignoring the effects of reflection and dynamic class loading. | ||
+ | == Extentions presented in popl07 paper == | ||
+ | * Conditional must not aliasing, a new aliasing property and analysis. -> Distinct blocks should be protected by distinct locks. | ||
+ | * Disjoint reachability, a new lightweight shape property and analysis that can be used to compute conditional must not aliasing facts. | ||
+ | * A new race detection algorithm based on conditional must not aliasing that is sound(no annotations) and effective in practice. | ||
[[Chord notes]] | [[Chord notes]] | ||
Line 143: | Line 146: | ||
===== Goldilocks ===== | ===== Goldilocks ===== | ||
+ | == Introduction == | ||
+ | Goldilocks is a lockset-based algorithm for precisely computing the happens-before relation and detecting data-races at runtime(dynamic race detection). | ||
+ | |||
+ | == Dynamic race detection == | ||
+ | 1. Vector clocks | ||
+ | * precisely compute the happens-before relation | ||
+ | * have significantly more overhead | ||
+ | 2. Locksets | ||
+ | * imprecise | ||
+ | |||
+ | |||
+ | == References == | ||
* [[http://iacoma.cs.uiuc.edu/iacoma-papers/asid06.pdf|Accurate and Efficient Filtering for the Intel Thread Checker Race Detector]] | * [[http://iacoma.cs.uiuc.edu/iacoma-papers/asid06.pdf|Accurate and Efficient Filtering for the Intel Thread Checker Race Detector]] | ||
* [[http://www.vs.inf.ethz.ch/publ/papers/VirtTimeGlobStates.pdf]] | * [[http://www.vs.inf.ethz.ch/publ/papers/VirtTimeGlobStates.pdf]] |