Name
Abstract | ||
|---|---|---|
Loops can represent an infinite number of possible execution paths and therefore purse a major challenge for current static analysis frameworks and test input generators. In this paper, we introduce a new loop exploration algorithm to examine different iteration orders (i.e. loop paths) in order to test distinct loop behaviour. To reduce the complexity of testing all possible combinations of iterations, we introduce a criterion to group different paths into equivalence classes and show how to specifically generate test cases that cover the different equivalence classes. We demonstrate how this approach helps to achieve higher coverage rates and helps to find software failures that are not discovered by current test case generation frameworks. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-22969-0_9 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Loop exploration,Dependency analysis,Test case generation | Computer science,Static analysis,Loop tiling,Theoretical computer science,Software,Test case,Equivalence class | Conference |
Volume | ISSN | Citations |
9276 | 0302-9743 | 1 |
PageRank | References | Authors |
0.36 | 18 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stefan Huster | 1 | 1 | 0.70 |
| Sebastian Burg | 2 | 2 | 2.77 |
| Hanno Eichelberger | 3 | 8 | 2.89 |
| Jo Laufenberg | 4 | 1 | 0.36 |
| Jürgen Ruf | 5 | 122 | 23.04 |
| Thomas Kropf | 6 | 326 | 59.09 |
| Wolfgang Rosenstiel | 7 | 1462 | 212.32 |