Covering Arrays Avoiding Forbidden Edges

Authors:
Peter Danziger;Eric Mendelsohn;Lucia Moura;Brett Stevens
Affiliations:
Ryerson University,;University of Toronto,;University of Ottawa,;Carleton University,
Venue:
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Year:
2008

Citing 14
Cited 0

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
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
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)
A Measure for Component Interaction Test Coverage

AICCSA '01 Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications
Software Fault Interactions and Implications for Software Testing

IEEE Transactions on Software Engineering
Covering arrays on graphs

Journal of Combinatorial Theory Series B
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Interaction testing of highly-configurable systems in the presence of constraints

Proceedings of the 2007 international symposium on Software testing and analysis
Iterative exhaustive pattern generation for logic testing

IBM Journal of Research and Development
Algorithms to locate errors using covering arrays

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. In this paper, we study covering arrays avoiding forbidden edges (CAFEs), where certain pairwise interactions are forbidden while all others must be covered. We study the complexity of the problem and give an algorithm for the case of binary alphabets.