Name
Abstract | ||
|---|---|---|
In this article, we present a new algorithm that combines contextual unfoldings and dynamic symbolic execution to systematically test multithreaded programs. The approach uses symbolic execution to limit the number of input values and unfoldings to thus limit the number of thread interleavings that are needed to cover reachable local states of threads in the program under test. We show that the use of contextual unfoldings allows interleavings of threads to be succinctly represented. This can in some cases lead to a substantial reduction in the number of needed test executions when compared to previous approaches.
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.1145/2810000 | ACM Trans. Embedded Comput. Syst. |
Keywords | Field | DocType |
Testing, contextual unfoldings, dynamic symbolic execution | Computer science,Parallel computing,Thread (computing),Theoretical computer science,Symbolic execution | Journal |
Volume | Issue | ISSN |
17 | 1 | 1539-9087 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kari Kähkönen | 1 | 29 | 3.07 |
| Keijo Heljanko | 2 | 751 | 47.90 |