Concurrent Test Generation Using Concolic Multi-trace Analysis

Razavi, Niloofar; Ivančić, Franjo; Kahlon, Vineet; Gupta, Aarti

doi:10.1007/978-3-642-35182-2_17

Cited by 13 publications

(7 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similar to (con) 2 colic testing, a recent related work [17], generates tests with the aim of increasing code coverage of concurrent programs. However, it uses an under-approximation of the program (i.e.…”

Section: Related Workmentioning

confidence: 99%

“…Like [17], they build a constraint system which includes local computation as well as global computation. Therefore, to reduce scalability issues, they focus only on program slices obtained from program executions.…”

Section: Related Workmentioning

confidence: 99%

“…Existing concurrency testing techniques can be divided into three categories of coverage guarantees (on program runs, inputs, code, assertions, etc.) that they provide: (i) No specific coverage guarantees: heuristic-based techniques [25,24,22,12,4,2,17] are based on the philosophy of using Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Con2colic testing

Farzan

Holzer

Razavi

et al. 2013

Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering

Self Cite

View full text Add to dashboard Cite

In this paper, we describe (con) 2 colic testing -a systematic testing approach for concurrent software. Based on concrete and symbolic executions of a concurrent program, (con) 2 colic testing derives inputs and schedules such that the execution space of the program under investigation is systematically explored. We introduce interference scenarios as key concept in (con) 2 colic testing. Interference scenarios capture the flow of data among different threads and enable a unified representation of path and interference constraints. We have implemented a (con) 2 colic testing engine and demonstrate the effectiveness of our approach by experiments.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Con2colic testing

Farzan

Holzer

Razavi

et al. 2013

Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…Dynamic (concolic) symbolic execution (DSE) executes a program to automatically generate input values to improve code coverage and expose software faults. Researchers have proposed various DSE techniques for concurrent programs [71][72][73][74]. However, DSE alone cannot generate OO tests [36,75].…”

Section: Test Generators For Concurrent Programsmentioning

confidence: 99%

Statically driven generation of concurrent tests for thread‐safe classes

Terragni

Pezzè

2021

Software Testing Verif & Rel

View full text Add to dashboard Cite

Concurrency testing is an important activity to expose concurrency faults in thread-safe classes. A concurrent test for a thread-safe class is a set of method call sequences that exercise the public interface of the class from multiple threads. Automatically generating fault-revealing concurrent tests within an affordable time budget is difficult due to the huge search space of possible concurrent tests. In this paper, we present DEPCON + , a novel approach that reduces the search space of concurrent tests by leveraging statically computed dependencies among public methods. DEPCON + exploits the intuition that concurrent tests can expose thread-safety violations that manifest exceptions or deadlocks, only if they exercise some specific method dependencies. DEPCON + provides an efficient way to identify such dependencies by statically analysing the code and relies on the computed dependencies to steer the test generation towards those concurrent tests that exhibit the computed dependencies. We developed a prototype DEPCON + implementation for Java and evaluated the approach on 19 known concurrency faults of thread-safe classes that lead to thread-safety violations of either exception or deadlock type. The results presented in this paper show that DEPCON + is more effective than state-of-the-art approaches in exposing the concurrency faults. The search space pruning of DEPCON + dramatically reduces the search space of possible concurrent tests, without missing any thread-safety violations.

show abstract

“…Other testing tools try to mutate observed interleavings to find bugs (e.g. [41], [42]). Our approach can be seen as a way to tune concurrency verification between concrete testing and fully symbolic verification.…”

Section: Related Workmentioning

confidence: 99%

Parallel bug-finding in concurrent programs via reduced interleaving instances

Nguyen

Schrammel

Fischer

et al. 2017

2017 32nd IEEE/ACM International Conference on Automated Software Engineering (ASE)

View full text Add to dashboard Cite

Concurrency poses a major challenge for program verification, but it can also offer an opportunity to scale when subproblems can be analysed in parallel. We exploit this opportunity here and use a parametrizable code-to-code translation to generate a set of simpler program instances, each capturing a reduced set of the original program's interleavings. These instances can then be checked independently in parallel. Our approach does not depend on the tool that is chosen for the final analysis, is compatible with weak memory models, and amplifies the effectiveness of existing tools, making them find bugs faster and with fewer resources. We use Lazy-CSeq as an off-the-shelf final verifier to demonstrate that our approach is able, already with a small number of cores, to find bugs in the hardest known concurrency benchmarks in a matter of minutes, whereas other dynamic and static tools fail to do so in hours.

show abstract

Concurrent Test Generation Using Concolic Multi-trace Analysis

Cited by 13 publications

References 24 publications

Con2colic testing

Con2colic testing

Statically driven generation of concurrent tests for thread‐safe classes

Parallel bug-finding in concurrent programs via reduced interleaving instances

Contact Info

Product

Resources

About