Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
From MaRDI portal
Publication:3058530
DOI10.1137/080730706zbMath1210.94126WikidataQ61734795 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
algorithms; group testing; software testing; detecting arrays; combinatorial designs; covering arrays; locating arrays; error locating arrays; component interaction testing
05B30: Other designs, configurations
94C12: Fault detection; testing in circuits and networks
94C30: Applications of design theory to circuits and networks
05C99: Graph theory
Related Items
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, An adaptive algorithm for group testing for complexes, Hardness results for covering arrays avoiding forbidden edges and error-locating arrays, The equivalence between optimal detecting arrays and super-simple OAs, Cover starters for covering arrays of strength two, Covering arrays avoiding forbidden edges, On a combinatorial framework for fault characterization, Algorithmic methods for covering arrays of higher index, Arrays for combinatorial interaction testing: a review on constructive approaches, Disjoint Spread Systems and Fault Location
