A survey of binary covering arrays

zbMath1298.05048MaRDI QIDQ540079

Yu Lei, D. Richard Kuhn, Raghu N. Kacker, James F. Lawrence, Michael A. Forbes

Publication date: 1 June 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p84.html

zbMATH Keywords

software testingsearch techniques

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30)

Related Items (16)

Non-uniform covering array with symmetric forbidden edge constraints ⋮ Attribute-efficient learning of Boolean functions from Post closed classes ⋮ Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search ⋮ Suitable Permutations, Binary Covering Arrays, and Paley Matrices ⋮ Partial covering arrays for data hiding and quantization ⋮ Chromatic numbers of copoint graphs of convex geometries ⋮ New optimal covering arrays using an orderly algorithm ⋮ Forbidden configurations and repeated induction ⋮ Parameterized and approximation complexity of \textsc{Partial VC Dimension} ⋮ Constructions and nonexistence results for suitable sets of permutations ⋮ New covering array numbers ⋮ Suitable sets of permutations, packings of triples, and Ramsey's theorem ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Factorials experiments, covering arrays, and combinatorial testing ⋮ A survey on the problems and algorithms for covering arrays via set covers ⋮ MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays

This page was built for publication: A survey of binary covering arrays