The AETG System: An Approach to Testing Based on Combinatorial Design
IEEE Transactions on Software Engineering
Tabu Search
In-Parameter-Order: A Test Generation Strategy for Pairwise Testing
HASE '98 The 3rd IEEE International Symposium on High-Assurance Systems Engineering
Determination of Test Configurations for Pair-Wise Interaction Coverage
TestCom '00 Proceedings of the IFIP TC6/WG6.1 13th International Conference on Testing Communicating Systems: Tools and Techniques
Constructing test suites for interaction testing
Proceedings of the 25th International Conference on Software Engineering
A practical strategy for testing pair-wise coverage of network interfaces
ISSRE '96 Proceedings of the The Seventh International Symposium on Software Reliability Engineering
Software Fault Interactions and Implications for Software Testing
IEEE Transactions on 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
A framework of greedy methods for constructing interaction test suites
Proceedings of the 27th international conference on Software engineering
Constraint Models for the Covering Test Problem
Constraints
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
Pseudo-Exhaustive Testing for Software
SEW '06 Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop
One-test-at-a-time heuristic search for interaction test suites
Proceedings of the 9th annual conference on Genetic and evolutionary computation
The density algorithm for pairwise interaction testing: Research Articles
Software Testing, Verification & Reliability
A backtracking search tool for constructing combinatorial test suites
Journal of Systems and Software
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
A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Upper bounds for covering arrays by tabu search
Discrete Applied Mathematics
Supercomputing and grid computing on the verification of covering arrays
The Journal of Supercomputing
| Hi-index | 0.00 |
The development of a new system involves extensive tests on the software functionality in order to identify possible failures. Also, a system already built requires a fine tuning of its configurable options to give the best performance in the environment it is going to work. Both cases require a finite set of tests that avoids testing all the possible combinations (which is time consuming); to this situation Mixed Covering Arrays (MCAs) are a feasible alternative. MCAs are combinatorial structures represented as matrices having a test case per row. MCAs are small, in comparison with brute force, and guarantees a level of interaction among the parameters involved (a difference with random testing). We present a Tabu Search (TS) algorithm to construct MCAs; the novelty in the algorithm is a mixture of three neighborhood functions. We also present a new benchmark for the MCAs problem. The experimental evidence showed that the TS algorithm improves the results obtained by other approaches reported in the literature, finding the optimal solution in some the solved cases.