Paper Info
Title
A Two-Step Heuristic Algorithm for Generating Constrained Detecting Arrays for Combinatorial Interaction Testing
Abstract
Constrained Covering Arrays (CCAs) and Constrained Detecting Arrays (CDAs) are mathematical objects used as test suites in Combinatorial Interaction Testing (CIT). CCAs are able to detect faults in systems from the test results, while CDAs can not only detect faults but also locate them. In spite of this added value of CDAs, the existing algorithm for generating CDAs does not scale well, being hardly able to handle even moderate-size problems. In this paper, we propose a heuristic algorithm for faster CDA generation. We prove a property that relates CCAs and CDAs and design the algorithm by making use of it. Specifically, the algorithm first generates a CCA and then transforms the CCA to a CDA based on this property. Experimental results show that the new algorithm can solve much larger problems than can the existing algorithm.
Year
DOI
Venue
2020
10.1109/WETICE49692.2020.00050
2020 IEEE 29th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE)
Keywords
DocType
ISSN
combinatorial interaction testing,constrained detecting arrays,constrained covering arrays,heuristic algorithm
Conference
1524-4547
ISBN
Citations 
PageRank 
978-1-7281-6976-7
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Hao Jin162.05
Tatsuhiro Tsuchiya245552.76