Effective static race detection for Java
Mayur Naik, Alex Aiken, John Whaley · ACM SIGPLAN Notices · 2006
We present a novel technique for static race detection in Java programs, comprised of a series of stages that employ a combination of static analyses to successively reduce the pairs of memory accesses potentially involved in a race. We have implemented our technique and applied it to a suite of multi-threaded Java programs. Our experiments show that it is precise, scalable, and useful, reporting tens to hundreds of serious and previously unknown concurrency bugs in large, widely-used programs with few false alarms.
Cited by 408 works. doi:10.1145/1133255.1134018 Open-access PDF
Authors
References
- Time, clocks, and the ordering of events in a distributed system
- Graph-Based Algorithms for Boolean Function Manipulation
- The nesC language
- The nesC language
- Eraser
- Type-based race detection for Java
- The Java memory model
- Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
- Reduction
- An empirical comparison of monitoring algorithms for access anomaly detection