The AETG System: An Approach to Testing Based on Combinatorial Design
IEEE Transactions on Software Engineering
Tabu Search
A Test Generation Strategy for Pairwise Testing
IEEE Transactions on Software Engineering
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
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
Cell Formation with Alternative Routings and Capacity Considerations: A Hybrid Tabu Search Approach
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
New bounds for binary covering arrays using simulated annealing
Information Sciences: an International Journal
An improved memetic algorithm for the antibandwidth problem
EA'11 Proceedings of the 10th international conference on Artificial Evolution
| Hi-index | 0.00 |
Software systems have been increasingly used by our society, so a failure in them can lead to large losses. To reduce the failures of a software it is necessary to carry out the testing process appropriately. The combinatorial testing helps in the testing process by providing structures with a test set of small size, like Mixed Covering Arrays (MCAs). However, the problem of constructing an optimal test set is an NP-complete problem leading to the development of non exhaustive approaches to solve it. This paper proposes a new approach of Tabu Search (TS) called MiTS (that stands for Mixed Tabu Search) which focuses on constructing MCAs. The approach is based on the use of a mixture of neighborhood functions and a fine tuning process to improve the performance of the TS. Experimental evidence shows a poor performance when a single neighborhood function is used. In the other side, the TS (using a mixture of neighborhood functions) is competitive in the construction of MCAs over a known benchmark reported in the literature.