Abstract
Race detection algorithms for multi-threaded programs using the common lock-based synchronization idiom must correlate locks with the memory locations they guard. The heart of a proof of race freedom is showing that if two locks are distinct, then the memory locations they guard are also distinct. This is an example of a general property we call
conditional must not aliasing
: Under the assumption that two objects are not aliased, prove that two other objects are not aliased. This paper introduces and gives an algorithm for conditional must not alias analysis and discusses experimental results for sound race detection of Java programs.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficient data race detection of async-finish programs using vector clocks;Proceedings of the Thirteenth International Workshop on Programming Models and Applications for Multicores and Manycores;2022-04-02
2. An Array Abstraction to Amortize Reasoning About Parallel Client Code;Lecture Notes in Networks and Systems;2021-07-13
3. SmartTrack: efficient predictive race detection;Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation;2020-06-06
4. Dependence-aware, unbounded sound predictive race detection;Proceedings of the ACM on Programming Languages;2019-10-10
5. A Value Set Analysis Refinement Approach Based on Conditional Merging and Lazy Constraint Solving;IEEE Access;2019