The grid
Quality Engineering Using Robust Design
Quality Engineering Using Robust Design
Efficient Evaluation of Multifactor Dependent System Performance Using Fractional Factorial Design
IEEE Transactions on Software Engineering
Augmenting Simulated Annealing to Build Interaction Test Suites
ISSRE '03 Proceedings of the 14th International Symposium on Software Reliability 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
Covering Arrays for Efficient Fault Characterization in Complex Configuration Spaces
IEEE Transactions on Software Engineering
Pseudo-Exhaustive Testing for Software
SEW '06 Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop
Practical Combinatorial Testing: Beyond Pairwise
IT Professional
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
Covering arrays from cyclotomy
Designs, Codes and Cryptography
Memetic algorithms for constructing binary covering arrays of strength three
EA'09 Proceedings of the 9th international conference on Artificial evolution
Factor interaction on service delivery in mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Supercomputing and grid computing on the verification of covering arrays
The Journal of Supercomputing
| Hi-index | 0.01 |
A covering array (CA) is an N × k matrix over the alphabet v s.t. each N × k subset contains at least one time each vt combination. Covering Arrays (CAs) have been applied mainly in software and hardware testing. The construction of CAs requires to do the verification that each N × t subset contains at least one time each vt combination. In this paper we present a sequential algorithm and a grid algorithm to do the CA verification. The algorithms were tested using a benchmark of CAs of variable strength. The main conclusion of the paper lies in the identification of the strengths and weakness of our algorithms (related to the values of the CA parameters).