Visualizing Potential Deadlocks in Multithreaded Programs

Kim, Byung-Chul; Jun, Sang-Woo; Hwang, Dae-Joon; Jun, Yong-Kee

doi:10.1007/978-3-642-03275-2_32

Cited by 9 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There has been much research on detecting concurrency violation patterns, involving data races [67,68], atomicity violations [69,70] and order violations [71,72]. However, as described in Section 1, these techniques target a specific type of bug.…”

Section: Concurrency Fault Detectionmentioning

confidence: 99%

Effective fault localization and context‐aware debugging for concurrent programs

Chu

Hayes

et al. 2021

Software Testing Verif & Rel

View full text Add to dashboard Cite

Concurrent programs are difficult to debug because concurrency faults usually occur under specific inputs and thread interleavings. Fault localization techniques for sequential programs are often ineffective because the root causes of concurrency faults involve memory accesses across multiple threads rather than single statements. Previous research has proposed techniques to analyse passing and failing executions obtained from running a set of test cases for identifying faulty memory access patterns. However, stand-alone access patterns do not provide enough contextual information, such as the path leading to the failure, for developers to understand the bug. We present an approach, Coadec, to automatically generate interthread control flow paths that can link memory access patterns that occurred most frequently in the failing executions to better diagnose concurrency bugs. Coadec consists of two phases. In the first phase, we use feature selection techniques from machine learning to localize suspicious memory access patterns based on failing and passing executions. The patterns with maximum feature diversity information can point to the most suspicious pattern. We then apply a data mining technique and identify the memory access patterns that occurred most frequently in the failing executions. Finally, Coadec identifies faulty program paths by connecting both the frequent patterns and the suspicious pattern. We also evaluate the effectiveness of fault localization using test suites generated from different test adequacy criteria. We introduce and have evaluated Coadec on 10 real-world multithreaded Java applications. Results indicate that Coadec outperforms state-of-the-art approaches for localizing concurrency faults and that Coadec's context debugging can help developers understand concurrency fault by inspecting a small percentage of code.

show abstract

Section: Concurrency Fault Detectionmentioning

confidence: 99%

Effective fault localization and context‐aware debugging for concurrent programs

Chu

Hayes

et al. 2021

Software Testing Verif & Rel

View full text Add to dashboard Cite

show abstract

“…There has been a great deal of research on basic techniques for testing concurrent programs for data races [14], actual deadlock [19], [30], and potential deadlock [20], [31]. Some techniques have been applied to large systems (e.g., Apache, Mozilla) [32], [33], [34].…”

Section: Related Workmentioning

confidence: 99%

An empirical comparison of the fault-detection capabilities of internal oracles

Srisa-an

Rothermel

2013

2013 IEEE 24th International Symposium on Software Reliability Engineering (ISSRE)

View full text Add to dashboard Cite

Modern computer systems are prone to various classes of runtime faults due to their reliance on features such as concurrency and peripheral devices such as sensors. Testing remains a common method for uncovering faults in these systems, but many runtime faults are difficult to detect using typical testing oracles that monitor only program output. In this work we empirically investigate the use of internal test oracles: oracles that detect faults by monitoring aspects of internal program and system states. We compare these internal oracles to each other and to output-based oracles for relative effectiveness and examine tradeoffs between oracles involving incorrect reports about faults (false positives and false negatives). Our results reveal several implications that test engineers and researchers should consider when testing for runtime faults.

show abstract

“…One problem of multithreading computing is deadlock which results from round waiting to gain resources. Researchers have developed various techniques for deadlock detection [8,9,10]. The situation when a memory location is accessed by two threads (one of them writes in the location) without synchronization is called data race.…”

Section: Related Workmentioning

confidence: 99%

Dead code elimination based pointer analysis for multithreaded programs

El-Zawawy

2012

Journal of the Egyptian Mathematical Society

View full text Add to dashboard Cite

This paper presents a new approach for optimizing multitheaded programs with pointer constructs. The approach has applications in the area of certified code (proof-carrying code) where a justification or a proof for the correctness of each optimization is required. The optimization meant here is that of dead code elimination.Towards optimizing multithreaded programs the paper presents a new operational semantics for parallel constructs like join-fork constructs, parallel loops, and conditionally spawned threads. The paper also presents a novel type system for flow-sensitive pointer analysis of multithreaded programs. This type system is extended to obtain a new type system for live-variables analysis of multithreaded programs. The live-variables type system is extended to build the third novel type system, proposed in this paper, which carries the optimization of dead code elimination. The justification mentioned above takes the form of type derivation in our approach.

show abstract

Visualizing Potential Deadlocks in Multithreaded Programs

Cited by 9 publications

References 9 publications

Effective fault localization and context‐aware debugging for concurrent programs

Effective fault localization and context‐aware debugging for concurrent programs

An empirical comparison of the fault-detection capabilities of internal oracles

Dead code elimination based pointer analysis for multithreaded programs

Contact Info

Product

Resources

About