Name
Abstract | ||
|---|---|---|
Software testing is still the most established and scalable quality-assurance technique in practice. However, generating effective test suites remains computationally expensive, consisting of repetitive reachability analyses for multiple test goals according to a coverage criterion. This situation is even worse when testing entire software product lines, i.e., families of similar program variants, requiring a sufficient coverage of all derivable program variants. Instead of considering every product variant one-by-one, family-based approaches are variability-aware analysis techniques in that they systematically explore similarities among the different variants. Based on this principle, we present a novel approach for automated product-line test-suite generation incorporating extensive reuse of reachability information among test cases derived for different test goals and/or program variants. We present a tool implementation on top of CPA/TIGER which is based on CPACHECKER, and provide evaluation results obtained from various experiments, revealing a considerable increase in efficiency compared to existing techniques. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-662-46675-9_6 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Software Product Lines,Automated Test Generation,Symbolic Model Checking,CPACHECKER,CPA/TIGER | Test suite,Programming language,Reuse,Computer science,Reachability,Software,Test case,CPAchecker,Scalability,Software testing | Conference |
Volume | ISSN | Citations |
9033 | 0302-9743 | 12 |
PageRank | References | Authors |
0.48 | 23 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johannes Bürdek | 1 | 66 | 4.69 |
| Malte Lochau | 2 | 548 | 35.64 |
| Stefan Bauregger | 3 | 17 | 1.32 |
| Andreas Holzer | 4 | 197 | 13.62 |
| Alexander von Rhein | 5 | 316 | 11.35 |
| Sven Apel | 6 | 3980 | 184.13 |
| Dirk Beyer | 7 | 1736 | 100.85 |