On the maximum number of qualitatively independent partitions
Journal of Combinatorial Theory Series A
The AETG System: An Approach to Testing Based on Combinatorial Design
IEEE Transactions on Software Engineering
Lower Bounds for Transversal Covers
Designs, Codes and Cryptography
Covering arrays
Experimental designs in software engineering: d-optimal designs and covering arrays
Proceedings of the 2004 ACM workshop on Interdisciplinary software engineering research
A framework of greedy methods for constructing interaction test suites
Proceedings of the 27th international conference on Software engineering
Test prioritization for pairwise interaction coverage
A-MOST '05 Proceedings of the 1st international workshop on Advances in model-based testing
Constraint Models for the Covering Test Problem
Constraints
Roux-type constructions for covering arrays of strengths three and four
Designs, Codes and Cryptography
Interaction testing of highly-configurable systems in the presence of constraints
Proceedings of the 2007 international symposium on Software testing and analysis
One-test-at-a-time heuristic search for interaction test suites
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A backtracking search tool for constructing combinatorial test suites
Journal of Systems and Software
Computational cost of the Fekete problem I: The Forces Method on the 2-sphere
Journal of Computational Physics
A systematic review of search-based testing for non-functional system properties
Information and Software Technology
Merging covering arrays and compressing multiple sequence alignments
Discrete Applied Mathematics
| Hi-index | 0.00 |
A t-covering array is a collection of k vectors in a discrete space with the property that, in any t coordinate positions, all combinations of the coordinate values occur at least once. Such arrays have applications, for example, in software testing and data compression. Covering arrays are sometimes also called t-surjective arrays or qualitatively t-independent families; when t=2 covering arrays are also called group covering designs or transversal covers. In an optimal covering array the number of vectors is minimized. Constructions for optimal covering arrays are known when t= 2 and the vectors are binary vectors, but in the other cases only upper and lower bounds are known. In this work a tabu search heuristic is used to construct covering arrays that improve on the previously known upper bounds on the sizes of optimal covering arrays.