Practical static race detection for Java parallel loops

Radoi, Cosmin

Permalink

https://hdl.handle.net/2142/46761 Copy

Description

Title

Practical static race detection for Java parallel loops

Author(s)

Radoi, Cosmin

Issue Date

2014-01-16T18:01:33Z

Director of Research (if dissertation) or Advisor (if thesis)

Dig, Daniel

Department of Study

Computer Science

Discipline

Computer Science

Degree Granting Institution

University of Illinois at Urbana-Champaign

Degree Name

M.S.

Degree Level

Thesis

Keyword(s)

• Java
• static race detection
• static analysis
• synchronization

Abstract

Despite significant progress in recent years, the important 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 expressing parallelism at a higher level (e.g., fork-join, futures, parallel loops) are becoming available in all major programming languages. 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 fast and precise enough to be practical. It scales to programs of hundreds of thousands of lines of code and it reports few race warnings, thus avoiding a common pitfall of static analyses. The tool revealed six bugs in real-world applications. We reported four of them, one had already been fixed, and three were new and the developers confirmed and fixed them.

Graduation Semester

2013-12

Permalink

http://hdl.handle.net/2142/46761

Copyright and License Information

Copyright 2013 Cosmin Radoi

Owning Collections