Citation Context

...bination of the two [16, 28, 39, 40, 54]. Static race detectors are eitherprimarily flow insensitive type-based systems [7, 8, 19, 20, 41, 44], flow sensitive static versions of the lockset algorithm =-=[12, 17, 47]-=-,or path sensitive model checkers [29, 42]. Despite significant advances in static race detection, state-of-the-art race detection tools are still predominantly dynamic. We set out to develop a static...

Citation Context

...binations have been proposed to reduce false positives or overhead [27, 29, 43]. Static data race detection techniques include race type-safe systems [3, 10], static-versions of the lockset algorithm =-=[8]-=- and model checking techniques [17]. As discussed in Section 1, all data race detection techniques, while useful, still have several limitations, primarily because not all concurrency bugs are data ra...

Citation Context

...Aiken and Gay [4] investigatestatic race detection in the context of SPMD programs. A variety of other approaches have also been developed, including model checking [7, 41, 25] and dataflow analysis =-=[12, 15]-=-, as well as scalable whole-program analyses [26, 40]. 7. Conclusions Race conditions are notoriously difficult to debug. Precise race detectors avoid the programmer-overhead of identifying and elimin...

Citation Context

...pproach. For static race detection, the most common approach is to employ compile-time analysis on the program source, reporting all potential races that could occur in any possible program execution =-=[10, 14, 32]-=-. The primary drawback of this approach is excessive false positives (reporting a potential data race when none exists), since the compile-time analysis is often unable to determine the precise set of...

Citation Context

... element of prom_phys_total instead of prom_prom_taken. This bug is a semantic error and, therefore, it cannot be easily detected by memory-related bug detection tools, including static checkers [9], =-=[10]-=-, [11], [12] or dynamic tools such as Purify [13], Valgrind [14], and CCured [15]. Besides this bug, CP-Miner has also detected many other 0098-5589/06/$20.00 ß 2006 IEEE Published by the IEEE Compute...

Citation Context

...are long and errorprone classes, since there is an explicit lock that must be held at the right places. With our constructs, synchronization wrappers are no longer needed. 5. Related Work Most static =-=[15, 28]-=- and dynamic race detectors [30, 33], as well as type systems [9, 19] and languages [5] that guarantee race freedom are based on the common definition of data races and therefore do not handle high-le...

Citation Context

...osed to infer type annotations by looking at concurrent executions. Other language based techniques for static race detection include nesC [24] and Guava [5]. Several static race detection techniques =-=[49, 19, 39]-=- based on lockset [43] have been proposed. An important advantage of the static techniques is that they could find all potential race conditions in a program. A primary limitation of these techniques ...

Citation Context

...ce detection has seen considerable theoretical progress using a variety of approaches (flow-insensitive type systems [3, 4,15, 16, 22, 36, 39], flow-sensitive versions of the static lockset algorithm =-=[6, 13, 42]-=-, or path sensitive model checkers [25, 37]) buts(A) after original stage (B) after may-happen-in-parallel stagelikely unlikely total hexts pairs hexts pairs hexts pairs hexts pairs philo 123344 926 0...