Debugging multi-threaded programs is notoriously hard. Probably the worst type of bug occurring in multi-threaded programs is a data race. There is therefore a great need for tools to automatically detect data races during execution. This article presents, TRaDe, a novel approach to detect races in object-oriented languages using a topological approach. An implementation of TRaDe based on the Sun JVM 1.2.1 is compared with existing tools. TRaDe proves to be a factor 1.6 faster than any known race detection tool for Java and has memory requirements similar to the best competing tools
Data races often result in unexpected and erroneous behavior. In addition to causing data corruption...
Subtle concurrency errors in multithreaded libraries that arise because of incorrect or inadequate s...
Wide applicability of concurrent programming practices in developing various software applications l...
Debugging multi-threaded programs is notoriously hard. Probably the worst type of bug occurring in m...
Abstract We present a novel technique for static race detection in Java pro-grams, comprised of a se...
We present a novel technique for static race detection in Java pro-grams, comprised of a series of s...
Dynamic race detectors operate by analyzing execution traces of programs to detect races in multithr...
Despite significant progress in recent years, the important problem of static race detection remains...
Bugs in multi-threaded programs often arise due to data races. Numerous static and dynamic program a...
Finding concurrency bugs in complex software is difficult. As a contribution to coping with this pro...
This paper presents a static race-detection analysis for multithreaded shared-memory programs, focus...
Happens-before relation is widely used to detect data races dynam-ically. However, it could easily h...
Despite significant progress in recent years, the im- portant problem of static race detection remai...
Researchers have proposed always-on data-race exceptions as a way to avoid the ill effects of data r...
Detection of data races in Java programs remains a difficult problem. The best static techniques pro...
Data races often result in unexpected and erroneous behavior. In addition to causing data corruption...
Subtle concurrency errors in multithreaded libraries that arise because of incorrect or inadequate s...
Wide applicability of concurrent programming practices in developing various software applications l...
Debugging multi-threaded programs is notoriously hard. Probably the worst type of bug occurring in m...
Abstract We present a novel technique for static race detection in Java pro-grams, comprised of a se...
We present a novel technique for static race detection in Java pro-grams, comprised of a series of s...
Dynamic race detectors operate by analyzing execution traces of programs to detect races in multithr...
Despite significant progress in recent years, the important problem of static race detection remains...
Bugs in multi-threaded programs often arise due to data races. Numerous static and dynamic program a...
Finding concurrency bugs in complex software is difficult. As a contribution to coping with this pro...
This paper presents a static race-detection analysis for multithreaded shared-memory programs, focus...
Happens-before relation is widely used to detect data races dynam-ically. However, it could easily h...
Despite significant progress in recent years, the im- portant problem of static race detection remai...
Researchers have proposed always-on data-race exceptions as a way to avoid the ill effects of data r...
Detection of data races in Java programs remains a difficult problem. The best static techniques pro...
Data races often result in unexpected and erroneous behavior. In addition to causing data corruption...
Subtle concurrency errors in multithreaded libraries that arise because of incorrect or inadequate s...
Wide applicability of concurrent programming practices in developing various software applications l...