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
Vector sets for exhaustive testing of logic circuits
IEEE Transactions on Information Theory
Strength Two Covering Arrays Construction Using a SAT Representation
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Binary Covering Arrays and Existentially Closed Graphs
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Information and Software Technology
Covering and radius-covering arrays: Constructions and classification
Discrete Applied Mathematics
A logic-based approach to combinatorial testing with constraints
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
A survey of combinatorial testing
ACM Computing Surveys (CSUR)
Memetic algorithms for constructing binary covering arrays of strength three
EA'09 Proceedings of the 9th international conference on Artificial evolution
Verification of general and cyclic covering arrays using grid computing
Globe'10 Proceedings of the Third international conference on Data management in grid and peer-to-peer systems
A Formal Logic Approach to Constrained Combinatorial Testing
Journal of Automated Reasoning
MiTS: a new approach of tabu search for constructing mixed covering arrays
MICAI'10 Proceedings of the 9th Mexican international conference on Artificial intelligence conference on Advances in soft computing: Part II
Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
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
Construction of mixed covering arrays of variable strength using a tabu search approach
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
A heuristic approach for constructing ternary covering arrays using trinomial coefficients
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
Evaluating improvements to a meta-heuristic search for constrained interaction testing
Empirical Software Engineering
A survey of methods for constructing covering arrays
Programming and Computing Software
The Minimal Failure-Causing Schema of Combinatorial Testing
ACM Transactions on Software Engineering and Methodology (TOSEM)
Using binary decision diagrams for combinatorial test design
Proceedings of the 2011 International Symposium on Software Testing and Analysis
New bounds for binary covering arrays using simulated annealing
Information Sciences: an International Journal
Optimal shortening of covering arrays
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Randomized post-optimization of covering arrays
European Journal of Combinatorics
Supercomputing and grid computing on the verification of covering arrays
The Journal of Supercomputing
T-wise combinatorial interaction test suites construction based on coverage inheritance
Software Testing, Verification & Reliability
An orchestrated survey of methodologies for automated software test case generation
Journal of Systems and Software
Hi-index | 0.04 |
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.