Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms

DOI10.1137/080730706zbMath1210.94126OpenAlexW2058248146WikidataQ61734795 ScholiaQ61734795MaRDI QIDQ3058530

Daniel Panario, Conrado Martínez, Brett Stevens, Lucia Moura

Publication date: 3 December 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080730706

zbMATH Keywords

algorithmsgroup testingsoftware testingdetecting arrayscombinatorial designscovering arrayslocating arrayserror locating arrayscomponent interaction testing

Mathematics Subject Classification ID

Other designs, configurations (05B30) Fault detection; testing in circuits and networks (94C12) Applications of design theory to circuits and networks (94C30) Graph theory (05C99)

Related Items (14)

On a combinatorial framework for fault characterization ⋮ Lower bound and construction of mixed-level locating arrays ⋮ Unnamed Item ⋮ Detecting arrays for effects of single factors ⋮ Constructing heterogeneous hash families by puncturing linear transversal designs ⋮ Optimal locating arrays for at most two faults ⋮ Hardness results for covering arrays avoiding forbidden edges and error-locating arrays ⋮ The equivalence between optimal detecting arrays and super-simple OAs ⋮ An adaptive algorithm for group testing for complexes ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Disjoint Spread Systems and Fault Location ⋮ Cover starters for covering arrays of strength two ⋮ Covering arrays avoiding forbidden edges ⋮ Algorithmic methods for covering arrays of higher index

This page was built for publication: Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms