Automatic static detection of data races is one of the most basic problems in reasoning about concurrency. We present RacerD—a static program analysis for detecting data races in Java programs which is fast, can scale to large code, and has proven effective in an industrial software engineering scenario.
RacerD is the first inter-procedural, compositional data race detector which has been empirically shown to have non-trivial precision and impact.
We present RacerDÐa static program analysis for detecting data races in Java programs which is fast, can scale to large code, and has proven effective in an ...
We present RacerD—a static program analysis for detecting data races in Java programs which is fast, can scale to large code, and has proven effective in an ...
RacerD statically analyzes Java code to detect potential concurrency bugs. This analysis does not attempt to prove the absence of concurrency issues.
Oct 19, 2017 · RacerD, our new open source race detector, searches for data races — unsynchronized memory accesses, where one is a write — in Java programs ...
We present RacerD—a static program analysis for detecting data races in Java programs which is fast, can scale to large code, and has proven effective in an ...
Apr 20, 2024 · We present RacerD—a static program analysis for detecting data races in Java programs which is fast, can scale to large code, and has proven ...
We show that conventional thread-sensitive static analysis (with some tuning and care) is highly effective for finding races, even more effective than RacerD. A ...
Oct 27, 2024 · We present RacerD—a static program analysis for detecting data races in Java programs which is fast, can scale to large code, and has proven ...