TY - GEN
T1 - Partitioned search with column resampling for locating array construction
AU - Lanus, Erin
AU - Colbourn, Charles J.
AU - Montgomery, Douglas C.
N1 - Funding Information:
Research of EL is supported by a National Physical Science Consortium (NPSC) Fellowship. Research of CJC was supported in part by the National Science Foundation under Grant No. 1421058 and Grant No. 1813729.
Publisher Copyright:
© 2019 IEEE.
PY - 2019/4
Y1 - 2019/4
N2 - Locating arrays are designs used in combinatorial testing with the property that every set of d t-way interactions appears in a unique set of tests. Using a locating array to conduct fault testing ensures that faulty interactions can be located when there are d or fewer faults. Locating arrays are fairly new and few techniques have been explored for their construction. Most of the available work is limited to finding only one fault. Known general methods require a covering array of strength t+d and produce many more tests than are needed. We present Partitioned Search with Column Resampling (PSCR), a randomized computational search algorithmic framework to verify if an array is (d, t)-locating by partitioning the search space to decrease the number of comparisons. If a candidate array is not locating, random resampling is performed until a locating array is constructed or an iteration limit is reached. Results are compared against known locating array constructions from covering arrays of higher strength and against published results of mixed level locating arrays for parameters of real-world systems. The use of PSCR to build larger locating arrays from a variety of ingredient arrays is explored.
AB - Locating arrays are designs used in combinatorial testing with the property that every set of d t-way interactions appears in a unique set of tests. Using a locating array to conduct fault testing ensures that faulty interactions can be located when there are d or fewer faults. Locating arrays are fairly new and few techniques have been explored for their construction. Most of the available work is limited to finding only one fault. Known general methods require a covering array of strength t+d and produce many more tests than are needed. We present Partitioned Search with Column Resampling (PSCR), a randomized computational search algorithmic framework to verify if an array is (d, t)-locating by partitioning the search space to decrease the number of comparisons. If a candidate array is not locating, random resampling is performed until a locating array is constructed or an iteration limit is reached. Results are compared against known locating array constructions from covering arrays of higher strength and against published results of mixed level locating arrays for parameters of real-world systems. The use of PSCR to build larger locating arrays from a variety of ingredient arrays is explored.
KW - Combinatorial testing
KW - Fault location
KW - Locating array
KW - Randomized algorithm
UR - http://www.scopus.com/inward/record.url?scp=85068234992&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85068234992&partnerID=8YFLogxK
U2 - 10.1109/ICSTW.2019.00056
DO - 10.1109/ICSTW.2019.00056
M3 - Conference contribution
AN - SCOPUS:85068234992
T3 - Proceedings - 2019 IEEE 12th International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2019
SP - 214
EP - 223
BT - Proceedings - 2019 IEEE 12th International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 12th IEEE International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2019
Y2 - 22 April 2019 through 27 April 2019
ER -