Efficient and precise datarace detection for multithreaded object-oriented programs

ChoiJong-Deok,; LeeKeunwoo,; LoginovAlexey,; O'CallahanRobert,; SarkarVivek,; Sridharan, Manu

doi:10.1145/543552.512560

Cited by 100 publications

(115 citation statements)

References 20 publications

Supporting

Mentioning

115

Contrasting

Order By: Relevance

“…When comparing this number to other works, where the reported slowdown by Eraser-like algorithms is around 2-3 (or even less), one has to take into account, that these results are obtained in environments where the program is always executed on a virtual machine like the Java VM (as in [2,12]) or Microsoft's Common Language Runtime (as in [16]). If run on Valgrind, the program is slowed down by a factor of 8-10 without instrumentation.…”

Section: Performancementioning

confidence: 97%

Fault Detection in Multi-Threaded C++ Server Applications

Mühlenfeld

Wotawa

2007

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

Due to increasing demands in processing power on the one hand, but the physical limit on CPU clock speed on the other hand, multi-threaded programming is becoming more important in current applications. Unfortunately, multi-threaded programs are prone to programming mistakes that result in hard to find defects, mainly race-conditions and deadlocks. The need for tools that help finding these faults is immanent, but currently available tools are either difficult to use because of the need for annotations, unable to cope with more than a few 10 kLOC, or issue too many false warnings. This paper describes experiments with the freely available tool Helgrind and results obtained by using it for debugging a server application comprising 500 kLOC. We present improvements to the runtime analysis of C++ programs that result in a dramatic reduction of false warnings.

show abstract

Section: Performancementioning

confidence: 97%

Fault Detection in Multi-Threaded C++ Server Applications

Mühlenfeld

Wotawa

2007

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…For datarace detection, the problem of false races has been addressed by using suitable combinations of the lockset algorithm and happens-before relation [9,60]. The JMPaX tool detects violations of properties expressed in a past time temporal logic and is able to analyze all executions that do not violate the causel dependency partial order of the execution under investigation.…”

Section: Improving Coveragementioning

confidence: 99%

Runtime verification of concurrency-specific correctness criteria

Qadeer

Tasiran

2011

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

We give an overview of correctness criteria specific to concurrent shared-memory programs and runtime verification techniques for verifying these criteria. We cover a spectrum of criteria, from ones focusing on low-level thread interference such as races to higher-level ones such as linearizability. We contrast these criteria in the context of runtime verification. We present the key ideas underlying the runtime verification techniques for these criteria and summarize the state of the art. Finally, we discuss the issue of coverage for runtime verification for concurrency and present techniques that improve the set of covered thread interleavings.

show abstract

“…This approach improves the performance of Eraser, but monitoring at the object level causes too many spurious warnings to be displayed. Choi et al [8] have developed a lock-based dynamic tool. They reduce the number of spurious alarms by using points-to-static analysis and by filtering out all the races that the static analysis did not discover.…”

Section: Dynamic Toolsmentioning

confidence: 99%

“…Because dataraces are a cause for concern, many works have dealt with the problem of detecting them. Most works rely on static [9,14,33] or dynamic [20,23,26] analysis to find dataraces, while others use model checking [11], or a combination of techniques [8,16] for better results.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Scaling model checking of dataraces using dynamic information

Shacham

Sagiv

Schuster

2007

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Dataraces in multithreaded programs often indicate severe bugs and can cause unexpected behaviors when different thread interleavings are executed. Because dataraces are a cause for concern, many works have dealt with the problem of detecting them. Works based on dynamic techniques either report errors only for dataraces that occur in the current interleaving, which limits their usefulness, or produce many spurious dataraces. Works based on model checking search exhaustively for dataraces and thus can reveal even those that occur in rarely executed paths. However, the applicability of model checking is limited because the large number of thread interleavings in realistic multithreaded programs causes state space explosion. In this work, we combine the two techniques in a hybrid scheme which overcomes these difficulties and enjoys the advantages of both worlds. Our hybrid technique succeeds in providing thread interleavings that prove the existence of dataraces in realistic programs. The programs we experimented with cannot be checked using either an ordinary industrial strength model checker or bounded model checking.

show abstract

Efficient and precise datarace detection for multithreaded object-oriented programs

Cited by 100 publications

References 20 publications

Fault Detection in Multi-Threaded C++ Server Applications

Fault Detection in Multi-Threaded C++ Server Applications

Runtime verification of concurrency-specific correctness criteria

Scaling model checking of dataraces using dynamic information

Contact Info

Product

Resources

About