Name
Abstract | ||
|---|---|---|
A locating array is a mathematical object that is intended to be used for fault localization in combinatorial interaction testing. However, applying it to a real-world testing is difficult because a system under test often has constraints among test parameter values. Test cases must satisfy such constraints to be executed; but the definition of locating arrays does not consider constraints. Hence directly using a locating array as a test suite results in interactions that are not tested as well as faulty interactions that cannot be identified. In this paper, we propose a method of generating Constrained Locating Arrays (CLAs), which are a constraint-aware extension of locating arrays. The proposed method uses a Satisfiability Modulo Theories (SMT) solver to search for a CLA. Experimental results show that the proposed method is often fast enough to find a minimum CLA for a nontrivial case. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/ICSTW.2018.00062 | 2018 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW) |
Keywords | Field | DocType |
constrained locating array,SMT solver,Interaction faults,constraint handling | Test suite,System under test,Microsoft Windows,Mathematical object,Computer science,Satisfiability,Algorithm,Test case,Solver,Satisfiability modulo theories | Conference |
ISSN | ISBN | Citations |
2159-4848 | 978-1-5386-6353-0 | 1 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hao Jin | 1 | 6 | 2.05 |
| Takashi Kitamura | 2 | 51 | 6.97 |
| Eun Hye Choi | 3 | 4 | 2.06 |
| Tatsuhiro Tsuchiya | 4 | 455 | 52.76 |