Roux-type constructions for covering arrays of strengths three and four

Authors:
Charles J. Colbourn;Sosina S. Martirosyan;Tran Trung;Robert A. Walker, II
Affiliations:
Computer Science and Engineering, Arizona State University, Tempe, USA 85287;Mathematical Sciences, University of Houston-Clear Lake, Houston, USA 77058;Institut für Experimentelle Mathematik, Universität Duisburg-Essen, Essen, Germany 45326;Computer Science and Engineering, Arizona State University, Tempe, USA 85287
Venue:
Designs, Codes and Cryptography
Year:
2006

Citing 8
Cited 12

Explicit construction of exponential sized families of K-independent sets

Discrete Mathematics
The AETG System: An Approach to Testing Based on Combinatorial Design

IEEE Transactions on Software Engineering
Perfect hash families: probabilistic methods and explicit constructions

Journal of Combinatorial Theory Series A
Covering Arrays of Strength Three

Designs, Codes and Cryptography
Upper bounds for covering arrays by tabu search

Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
On t-Covering Arrays

Designs, Codes and Cryptography
New Constructions for IPP Codes

Designs, Codes and Cryptography
Constraint-Based approaches to the covering test problem

CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints

Explicit constructions for perfect hash families

Designs, Codes and Cryptography
Covering arrays of strength 3 and 4 from holey difference matrices

Designs, Codes and Cryptography
Linear hash families and forbidden configurations

Designs, Codes and Cryptography
Merging covering arrays and compressing multiple sequence alignments

Discrete Applied Mathematics
Binary Covering Arrays and Existentially Closed Graphs

IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Bad pairs in software testing

TAIC PART'10 Proceedings of the 5th international academic and industrial conference on Testing - practice and research techniques
Covering arrays generation methods survey

ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
A survey of methods for constructing covering arrays

Programming and Computing Software
New bounds for binary covering arrays using simulated annealing

Information Sciences: an International Journal
Constructions of covering arrays of strength five

Designs, Codes and Cryptography
Randomized post-optimization of covering arrays

European Journal of Combinatorics
A post-optimization strategy for combinatorial testing: test suite reduction through the identification of wild cards and merge of rows

MICAI'12 Proceedings of the 11th Mexican international conference on Advances in Computational Intelligence - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

A covering array CA(N;t,k,v) is an N 脳 k array such that every N 脳 t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t-sets of component interactions. Recursive constructions for covering arrays of strengths 3 and 4 are developed, generalizing many "Roux-type" constructions. A numerical comparison with current construction techniques is given through existence tables for covering arrays.