A randomized dynamic program analysis technique for detecting real deadlocks

JoshiPallavi,; ParkChang-Seo,; SenKoushik,; NaikMayur,

doi:10.1145/1543135.1542489

Cited by 57 publications

(64 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Exploring such infeasible executions not only wastes time but may also make the whole system reach a deadlock. Such a deadlock due to active thread control is referred to as thrashing [11]. ASSETFUZZER conducts a vulnerable window lockset analysis in Phase I, and then uses the computed lockset information to prune these infeasible executions in Phase II.…”

Section: Outline Of Assetfuzzermentioning

confidence: 99%

See 1 more Smart Citation

Detecting atomic-set serializability violations in multithreaded programs through active randomized testing

Lai

Cheung

Chan

2010

Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1

View full text Add to dashboard Cite

Concurrency bugs are notoriously difficult to detect because there can be vast combinations of interleavings among concurrent threads, yet only a small fraction can reveal them. Atomic-set serializability characterizes a wide range of concurrency bugs, including data races and atomicity violations. In this paper, we propose a two-phase testing technique that can effectively detect atomic-set serializability violations. In Phase I, our technique infers potential violations that do not appear in a concrete execution and prunes those interleavings that are violation-free. In Phase II, our technique actively controls a thread scheduler to enumerate these potential scenarios identified in Phase I to look for real violations. We have implemented our technique as a prototype system ASSETFUZZER and applied it to a number of subject programs for evaluating concurrency defect analysis techniques. The experimental results show that ASSETFUZZER can identify more concurrency bugs than two recent testing tools RACEFUZZER and ATOMFUZZER.

show abstract

Section: Outline Of Assetfuzzermentioning

confidence: 99%

“…Consequently, the thread scheduler could not make any progress. Such a deadlock due to active thread manipulation is referred to as thrashing [11]. RACEFUZZER uses a daemon thread to break the tie by randomly selecting a thread that is suspended by the testing engine to execute (t1 in this example).…”

Section: Alleviating Thrashingmentioning

confidence: 99%

Detecting atomic-set serializability violations in multithreaded programs through active randomized testing

Lai

Cheung

Chan

2010

Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1

View full text Add to dashboard Cite

show abstract

“…Many tools are designed to detect data races [7,15,42,49,50,69], atomicity violations [6,14,31,32,61,65], and other types of concurrency bugs [25,33,59,67,70]. Since concurrency-bug detection often involves monitoring many memory accesses across threads and complicated concurrency analysis, most of these tools incur large overhead.…”

Section: Related Workmentioning

confidence: 99%

Efficient concurrency-bug detection across inputs

Deng

Zhang

2013

Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages &Amp; Application

View full text Add to dashboard Cite

In the multi-core era, it is critical to efficiently test multithreaded software and expose concurrency bugs before software release. Previous work has made significant progress in detecting and validating concurrency bugs under a given input. Unfortunately, software testing always faces large sets of test inputs, and existing techniques are still too expensive to be applied to every test input in practice.In this paper, we use open-source software to study how existing concurrency-bug detection tools work for a set of inputs. The study shows that an interleaving pattern, such as a data race or an atomicity violation, can often be exposed by many inputs. Consequently, existing bug detectors would inevitably waste their bug detection effort to generate duplicate bug reports, when applied to a set of inputs.Guided by the above study, we propose a coverage metric, Concurrent Function Pairs (CFP), to efficiently approximate how interleavings overlap across inputs. Using CFP, we have designed a new approach to detecting data races and atomicity-violation bugs for a set of inputs.Our evaluation on open-source C/C++ applications shows that our CFP-guided approach can effectively accelerate concurrency-bug detection for a set of inputs by reducing redundant detection effort across inputs.

show abstract

“…In [1], a support for semaphores and wait-notify synchronisation was added. The recent work [37] modified the original algorithm so that runtime lock trees are not constructed. Instead, the algorithm uses a stack to handle the so-called lock dependency relation.…”

Section: Detection Of Deadlocksmentioning

confidence: 99%

A Uniform Classification of Common Concurrency Errors

Fiedor

Bohuslav

ena

et al. 2012

Computer Aided Systems Theory – EUROCAST 2011

View full text Add to dashboard Cite

Abstract. Nowadays, multi-threaded programs are quite common and so are concurrency errors. Many works devoted to detection of concurrency errors have been published in recent years and many of them presented definitions of concurrency errors that the proposed algorithms are able to handle. These definitions are usually expressed in different terms suitable for a description of the particular considered algorithms and they surprisingly often differ from each other in the meaning they assign to particular errors. To help understanding the errors and developing techniques for detecting them, this report strives to provide a uniform taxonomy of concurrency errors common in current programs, with a stress on those written in Java, together with a brief overview of techniques so far proposed for detecting such errors.

show abstract

A randomized dynamic program analysis technique for detecting real deadlocks

Cited by 57 publications

References 34 publications

Detecting atomic-set serializability violations in multithreaded programs through active randomized testing

Detecting atomic-set serializability violations in multithreaded programs through active randomized testing

Efficient concurrency-bug detection across inputs

A Uniform Classification of Common Concurrency Errors

Contact Info

Product

Resources

About