To detect data races that harm production systems, program analysis must target production runs. However, sound and precise data race detection adds too much run-time overhead for use in production systems. Even existing approaches that provide soundness or precision incur significant limitations. This work addresses the need for soundness (no missed races) and precision (no false races) by introducing novel, efficient production-time analyses that address each need separately. (1) Precise data race detection is useful for developers, who want to fix bugs but loathe false positives. We introduce a precise analysis called RaceChaser that provides low, bounded run-time overhead. (2) Sound race detection benefits analyses and tools whose correctness relies on knowledge of all potential data races. We present a sound, efficient approach called Caper that combines static and dynamic analysis to catch all data races in observed runs. RaceChaser and Caper are useful not only on their own; we introduce a framework that combines these analyses, using Caper as a sound filter for precise data race detection by RaceChaser. Our evaluation shows that RaceChaser and Caper are efficient and effective, and compare favorably with existing state-of-the-art approaches. These results suggest that RaceChaser and Caper enable practical data race detection that is precise and sound, respectively, ultimately leading to more reliable software systems.
Description
Lightweight data race detection for production runs
%0 Conference Paper
%1 Biswas:2017:LDR
%A Biswas, Swarnendu
%A Cao, Man
%A Zhang, Minjia
%A Bond, Michael D.
%A Wood, Benjamin P.
%B Proceedings of the 26th International Conference on Compiler Construction
%D 2017
%I ACM
%K JVM Java JikesRVM RaceDetection
%P 11--21
%R 10.1145/3033019.3033020
%T Lightweight Data Race Detection for Production Runs
%X To detect data races that harm production systems, program analysis must target production runs. However, sound and precise data race detection adds too much run-time overhead for use in production systems. Even existing approaches that provide soundness or precision incur significant limitations. This work addresses the need for soundness (no missed races) and precision (no false races) by introducing novel, efficient production-time analyses that address each need separately. (1) Precise data race detection is useful for developers, who want to fix bugs but loathe false positives. We introduce a precise analysis called RaceChaser that provides low, bounded run-time overhead. (2) Sound race detection benefits analyses and tools whose correctness relies on knowledge of all potential data races. We present a sound, efficient approach called Caper that combines static and dynamic analysis to catch all data races in observed runs. RaceChaser and Caper are useful not only on their own; we introduce a framework that combines these analyses, using Caper as a sound filter for precise data race detection by RaceChaser. Our evaluation shows that RaceChaser and Caper are efficient and effective, and compare favorably with existing state-of-the-art approaches. These results suggest that RaceChaser and Caper enable practical data race detection that is precise and sound, respectively, ultimately leading to more reliable software systems.
%@ 978-1-4503-5233-8
@inproceedings{Biswas:2017:LDR,
abstract = {To detect data races that harm production systems, program analysis must target production runs. However, sound and precise data race detection adds too much run-time overhead for use in production systems. Even existing approaches that provide soundness or precision incur significant limitations. This work addresses the need for soundness (no missed races) and precision (no false races) by introducing novel, efficient production-time analyses that address each need separately. (1) Precise data race detection is useful for developers, who want to fix bugs but loathe false positives. We introduce a precise analysis called RaceChaser that provides low, bounded run-time overhead. (2) Sound race detection benefits analyses and tools whose correctness relies on knowledge of all potential data races. We present a sound, efficient approach called Caper that combines static and dynamic analysis to catch all data races in observed runs. RaceChaser and Caper are useful not only on their own; we introduce a framework that combines these analyses, using Caper as a sound filter for precise data race detection by RaceChaser. Our evaluation shows that RaceChaser and Caper are efficient and effective, and compare favorably with existing state-of-the-art approaches. These results suggest that RaceChaser and Caper enable practical data race detection that is precise and sound, respectively, ultimately leading to more reliable software systems.},
added-at = {2017-02-09T14:02:00.000+0100},
author = {Biswas, Swarnendu and Cao, Man and Zhang, Minjia and Bond, Michael D. and Wood, Benjamin P.},
biburl = {https://www.bibsonomy.org/bibtex/2a679561eb0641b48aa2a590fe226396f/gron},
booktitle = {Proceedings of the 26th International Conference on Compiler Construction},
description = {Lightweight data race detection for production runs},
doi = {10.1145/3033019.3033020},
interhash = {2e0b77268b5c7da72c79ed61a580524a},
intrahash = {a679561eb0641b48aa2a590fe226396f},
isbn = {978-1-4503-5233-8},
keywords = {JVM Java JikesRVM RaceDetection},
location = {Austin, TX, USA},
numpages = {11},
pages = {11--21},
publisher = {ACM},
series = {CC 2017},
timestamp = {2017-02-09T14:02:00.000+0100},
title = {{Lightweight Data Race Detection for Production Runs}},
year = 2017
}