Orthogonal Latin squares: an application of experiment design to compiler testing
Communications of the ACM
A simple lower bound on edge coverings by cliques
Discrete Mathematics
Efficient transitive closure computation in large digraphs
Acta Polytechnica Scandinavica: Mathematics and Computing in Engineering
Approximation Algorithms for the k-Clique Covering Problem
SIAM Journal on Discrete Mathematics
Applying design of experiments to software testing: experience report
ICSE '97 Proceedings of the 19th international conference on Software engineering
Model-based testing in practice
Proceedings of the 21st international conference on Software engineering
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Covering edges by cliques with regard to keyword conflicts and intersection graphs
Communications of the ACM
An Investigation of the Applicability of Design of Experiments to Software Testing
SEW '02 Proceedings of the 27th Annual NASA Goddard Software Engineering Workshop (SEW-27'02)
Software Fault Interactions and Implications for Software Testing
IEEE Transactions on Software Engineering
Journal of Combinatorial Theory Series B
Interaction testing of highly-configurable systems in the presence of constraints
Proceedings of the 2007 international symposium on Software testing and analysis
Merging covering arrays and compressing multiple sequence alignments
Discrete Applied Mathematics
Algorithms to locate errors using covering arrays
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
SIAM Journal on Discrete Mathematics
Controlling size when aligning multiple genomic sequences with duplications
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Vector sets for exhaustive testing of logic circuits
IEEE Transactions on Information Theory
Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
SIAM Journal on Discrete Mathematics
Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
Theoretical Computer Science
Finding the best CAFE is NP-hard
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
| Hi-index | 5.23 |
Covering arrays (CAs) can be used to detect the existence of faulty pairwise interactions between parameters or components in a software system. The generalization considered here applies to the situation in which some input combinations are invalid, a requirement quite common in software testing. In this paper, we study covering arrays avoiding forbidden edges (CAFEs), where certain pairwise interactions are forbidden while all others must be covered, and we aim to minimize the number of tests. We establish a theoretical framework for this problem, by providing connections to the edge clique covering problem, lower and upper bounds, complexity results and a recursive construction. We also give an algorithm for the case of binary alphabets.