Goldilocks:  A Race-Aware Java Runtime
By Tayfun Elmas, Shaz Qadeer, and Serdar Tasiran

november 2010 | vol. 53 | no. 11 | communications of the acm 85

 

Abstract
 We present Goldilocks, a Java runtime that monitors program executions and throws a DataRaceException when a data race is about to occur. This prevents racy accesses from taking place, and allows race conditions to
be handled before they cause errors that may be difficult to diagnose later. The DataRaceException is a valuable debugging tool, and, if supported with reasonable computational overhead, can be an important safety feature for
deployed programs. Experiments by us and others on raceaware Java runtimes indicate that the DataRaceException
may be a viable mechanism to enforce the safety of executions of multithreaded Java programs.
 An important benefit of DataRaceException is that executions in our runtime are guaranteed to be race free
and thus sequentially consistent as per the Java Memory Model. This strong guarantee provides an easy-to-use, clean semantics to programmers, and helps to rule out many concurrency-related possibilities as the cause of errors. To support the DataRaceException, our runtime incorporates the novel Goldilocks algorithm for precise dynamic race detection. The Goldilocks algorithm is general, intuitive, and can handle different synchronization patterns uniformly.

1. INTRODUCTION