Practical static race detection for Java parallel loops

Despite significant progress in recent years, the im- portant problem of static race detection remains open. Previous techniques took a general approach and looked for races by analyzing the effects induced by low-level concurrency constructs (e.g., java.lang.Thread). But constructs and libraries for express- ing parallelism at a higher level (e.g. fork-join, futures, parallel loops) are becoming available in all major programming lan- guages. We claim that specializing an analysis to take advantage of the extra semantic information provided by the use of these constructs and libraries improves precision and scalability. We present ITERACE, a set of techniques that are specialized to use the intrinsic thread, safety, and data-flow structure of collections and of the new loop-parallelism mechanism to be introduced in Java8. Our evaluation shows that ITERACE is efficient, running in under 100 seconds even for programs of hundreds of thousands of lines of code. Also, it is precise, reporting no false positives in 5 out of the 7 case studies.unpublishe