The AETG System: An Approach to Testing Based on Combinatorial Design
IEEE Transactions on Software Engineering
Model-based testing in practice
Proceedings of the 21st international conference on Software engineering
Automatic symmetry breaking method combined with SAT
Proceedings of the 2001 ACM symposium on Applied computing
Covering Arrays of Strength Three
Designs, Codes and Cryptography
In-Parameter-Order: A Test Generation Strategy for Pairwise Testing
HASE '98 The 3rd IEEE International Symposium on High-Assurance Systems Engineering
Breaking Row and Column Symmetries in Matrix Models
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Constructing test suites for interaction testing
Proceedings of the 25th International Conference on Software Engineering
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 practical strategy for testing pair-wise coverage of network interfaces
ISSRE '96 Proceedings of the The Seventh International Symposium on Software Reliability Engineering
Generating Small Combinatorial Test Suites to Cover Input-Output Relationships
QSIC '03 Proceedings of the Third International Conference on Quality Software
Upper bounds for covering arrays by tabu search
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Designs, Codes and Cryptography
Comparing the Fault Detection Effectiveness of N-way and Random Test Suites
ISESE '04 Proceedings of the 2004 International Symposium on Empirical Software Engineering
Using Artificial Life Techniques to Generate Test Cases for Combinatorial Testing
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Journal of Combinatorial Theory Series B
Covering Arrays for Efficient Fault Characterization in Complex Configuration Spaces
IEEE Transactions on Software Engineering
Constraint Models for the Covering Test Problem
Constraints
Backtracking Algorithms and Search Heuristics to Generate Test Suites for Combinatorial Testing
COMPSAC '06 Proceedings of the 30th Annual International Computer Software and Applications Conference - Volume 01
IPOG: A General Strategy for T-Way Software Testing
ECBS '07 Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems
Vector sets for exhaustive testing of logic circuits
IEEE Transactions on Information Theory
A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
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
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
Information Sciences: an International Journal
A survey of methods for constructing covering arrays
Programming and Computing Software
Assignment-minimum clique coverings
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
Combinatorial testing is an important testing method. It requires the test cases to cover various combinations of parameters of the system under test. The test generation problem for combinatorial testing can be modeled as constructing a matrix which has certain properties. This paper first discusses two combinatorial testing criteria: covering array and orthogonal array, and then proposes a backtracking search algorithm to construct matrices satisfying them. Several search heuristics and symmetry breaking techniques are used to reduce the search time. This paper also introduces some techniques to generate large covering array instances from smaller ones. All the techniques have been implemented in a tool called EXACT (EXhaustive seArch of Combinatorial Test suites). A new optimal covering array is found by this tool.