Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages &Amp; Application 2013
DOI: 10.1145/2509136.2509539
|View full text |Cite
|
Sign up to set email alerts
|

Efficient concurrency-bug detection across inputs

Abstract: 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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0
1

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 23 publications
(6 citation statements)
references
References 74 publications
0
5
0
1
Order By: Relevance
“…There are techniques for ensuring safe programming using advanced typing [5], analyses for static race detection [44], approaches to concurrency bug fixing [32], tools that flag suspicious concurrency patterns [30,50], and much more. Additionally, dynamic techniques for concurrency bug detection [1,13,34,41,46] often benefit from symbolic reasoning, especially in approaches inspired by model checking or symbolic execution techniques [33,37,43]. Such past work is only superficially related to ours, since the aims, programming abstractions, and analysis techniques used are quite different.…”
Section: Related Workmentioning
confidence: 99%
“…There are techniques for ensuring safe programming using advanced typing [5], analyses for static race detection [44], approaches to concurrency bug fixing [32], tools that flag suspicious concurrency patterns [30,50], and much more. Additionally, dynamic techniques for concurrency bug detection [1,13,34,41,46] often benefit from symbolic reasoning, especially in approaches inspired by model checking or symbolic execution techniques [33,37,43]. Such past work is only superficially related to ours, since the aims, programming abstractions, and analysis techniques used are quite different.…”
Section: Related Workmentioning
confidence: 99%
“…There are techniques for ensuring safe programming using advanced typing [5], analyses for static race detection [43], approaches to concurrency bug fixing [31], tools that flag suspicious concurrency patterns [29,49], and much more. Additionally, dynamic techniques for concurrency bug detection [1,13,33,40,45] often benefit from symbolic reasoning, especially in approaches inspired by model checking or symbolic execution techniques [32,36,42]. Such past work is only superficially related to ours, since the aims, programming abstractions, and analysis techniques used are quite different.…”
Section: Related Workmentioning
confidence: 99%
“…First, we assume that predicates appearing in waituntil statements are expressible in some first-order theory (e.g., linear arithmetic). Hence, if the predicate corresponds to the result of a complicated function13…”
mentioning
confidence: 99%
“…Testing usually requires exploring as many interleavings as possible to amplify the chance of exposing faults. Recent work [22] reports that testing concurrent programs can introduce a 10x-100x slowdown for each test run. Such overhead increases as test suite size increases.…”
Section: Introductionmentioning
confidence: 99%