Abstract
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. Copyright © 2006 ACM.
Author supplied keywords
Cite
CITATION STYLE
Naik, M., Aiken, A., & Whaley, J. (2006). Effective static race detection for java. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) (Vol. 2006, pp. 308–319). https://doi.org/10.1145/1133255.1134018
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.