Name
Title | ||
|---|---|---|
Semi-Automatic Repair of Over-Constrained Models for Combinatorial Robustness Testing |
Abstract | ||
|---|---|---|
Combinatorial robustness testing is an approach to generate separate test inputs for positive and negative test scenarios. The test model is enriched with semantic information to distinguish valid from invalid values and value combinations. Unfortunately, it is easy to create over-constrained models and invalid values or invalid value combinations do not appear in the final test suite. In this paper, we extend previous work on manual repair and develop a technique to semi-automatically repair over-constrained models. The technique is evaluated with benchmark models and the results indicate a small computational overhead. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/APSEC48747.2019.00024 | 2019 26th Asia-Pacific Software Engineering Conference (APSEC) |
Keywords | Field | DocType |
Robustness Testing, Combinatorial Testing | Test suite,Overhead (computing),Robustness testing,Computer science,Semantic information,Real-time computing,Scenario testing,Combinatorial testing,Artificial intelligence,Machine learning | Conference |
ISSN | ISBN | Citations |
1530-1362 | 978-1-7281-4649-2 | 0 |
PageRank | References | Authors |
0.34 | 11 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Konrad Fögen | 1 | 5 | 2.15 |
| Horst Lichter | 2 | 252 | 51.53 |