A survey of methods for constructing covering arrays

DOI10.1134/S0361768811030029zbMath1242.68069MaRDI QIDQ763563

A. A. Petukhov, V. V. Kuliamin

Publication date: 12 March 2012

Published in: Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

survey article; covering array construction

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

68-02: Research exposition (monographs, survey articles) pertaining to computer science

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

Attribute-efficient learning of Boolean functions from Post closed classes, Constructing new covering arrays from LFSR sequences over finite fields, Mixed optimization combinatorial method for constructing covering arrays, Perfect sets of paths in the full graph of SDN switches, Improved covering arrays using covering perfect hash families with groups of restricted entries, Problems and algorithms for covering arrays via set covers, 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, CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH

Uses Software

• AETG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering and radius-covering arrays: constructions and classification
• Roux-type constructions for covering arrays of strengths three and four
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Constructing strength three covering arrays with augmented annealing
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• Constructions of difference covering arrays.
• Upper bounds for covering arrays by tabu search.
• Problems and algorithms for covering arrays
• On \(t\)-covering arrays
• Strength two covering arrays: existence tables and projection
• On the state of strength-three covering arrays
• Randomized Postoptimization of Covering Arrays
• Vector sets for exhaustive testing of logic circuits
• The Mathematics of the Pentium Division Bug
• Group construction of covering arrays
• t-Covering Arrays: Upper Bounds and Poisson Approximations
• Covering arrays and intersecting codes
• Products of mixed covering arrays of strength two