Locating and detecting arrays for interaction faults
From MaRDI portal
Publication:2426663
DOI10.1007/s10878-007-9082-4zbMath1149.90090OpenAlexW2082467688MaRDI QIDQ2426663
Charles J. Colbourn, Daniel W. McClary
Publication date: 23 April 2008
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/2240/
Orthogonal arrayCover-free familyCovering arrayFactorial designDisjunct matrixDefecting arrayLocating array
Related Items (24)
On a combinatorial framework for fault characterization ⋮ An exploration of combinatorial testing-based approaches to fault localization for explainable AI ⋮ Lower bound and construction of mixed-level locating arrays ⋮ Unnamed Item ⋮ Detecting arrays for effects of single factors ⋮ Consecutive detecting arrays for interaction faults ⋮ Constructing heterogeneous hash families by puncturing linear transversal designs ⋮ Detecting arrays and their optimality ⋮ Optimal locating arrays for at most two faults ⋮ Optimum mixed level detecting arrays ⋮ The equivalence between optimal detecting arrays and super-simple OAs ⋮ Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) ⋮ Existence of super-simple \(\mathrm{OA}_\lambda (3,5,v)\)'s ⋮ D-optimal designs with interaction coverage ⋮ A construction of variable strength covering arrays ⋮ Bipartite locating array ⋮ Covering arrays: using prior information for construction, evaluation and to facilitate fault localization ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Disjoint Spread Systems and Fault Location ⋮ Cover starters for covering arrays of strength two ⋮ Factorials experiments, covering arrays, and combinatorial testing ⋮ Optimality and constructions of locating arrays ⋮ Algorithmic methods for covering arrays of higher index ⋮ Optimum detecting arrays for independent interaction faults
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal 2-coverings of a finite affine space based on GF(2)
- Roux-type constructions for covering arrays of strengths three and four
- Tabu search for covering arrays using permutation vectors
- On qualitatively independent partitions and related problems
- On sets of Boolean \(n\)-vectors with all \(k\)-projections surjective
- Families of finite sets in which no set is covered by the union of \(r\) others
- On the maximum number of qualitative independent partitions
- Qualitative independence and Sperner problems for directed graphs
- Approximating probability distributions using small sample spaces
- Orthogonal arrays. Theory and applications
- Covering arrays of strength three
- Sets pooling designs
- On the upper bound of the size of the \(r\)-cover-free families
- Capacities: From information theory to extremal set theory
- Searching probabilities for nonzero effects in search designs for the noisy case
- Trivial two-stage group testing for complexes using almost disjunct matrices.
- Upper bounds for covering arrays by tabu search.
- Problems and algorithms for covering arrays
- On \(t\)-covering arrays
- Sperner capacities
- Orthogonal arrays of strength 3 and small run sizes
- Two applications (for search theory and truth functions) of Sperner type theorems
- Families of \(k\)-independent sets
- On greedy algorithms in coding theory
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Iterative Exhaustive Pattern Generation for Logic Testing
- Vector sets for exhaustive testing of logic circuits
- Simple Constructions of Almost k-wise Independent Random Variables
- Theory & Methods: Comparison of Four New General Classes of Search Designs
- t-Covering Arrays: Upper Bounds and Poisson Approximations
- A Comparative Analysis of the Performance of Taguchi's Linear Graphs for the Design of Two-Level Fractional Factorials
- Covering arrays and intersecting codes
- Compressing inconsistent data
- Perfect Hash Families: Constructions and Existence
- Nonrandom binary superimposed codes
- Products of mixed covering arrays of strength two
- Recent Advances in Constraints
- Indépendance d'ensembles et prolongement de mesures (Résultats et problèmes)
- Almost \(k\)-wise independent sample spaces and their cryptologic applications
- Two general classes of search designs for factor screening experiments with factors at three levels
This page was built for publication: Locating and detecting arrays for interaction faults
