The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Quality Engineering Using Robust Design
Quality Engineering Using Robust Design
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
A practical strategy for testing pair-wise coverage of network interfaces
ISSRE '96 Proceedings of the The Seventh International Symposium on Software Reliability 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
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
The test suite generation problem: Optimal instances and their implications
Discrete Applied Mathematics
The density algorithm for pairwise interaction testing: Research Articles
Software Testing, Verification & Reliability
Practical Combinatorial Testing: Beyond Pairwise
IT Professional
Binary Covering Arrays and Existentially Closed Graphs
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Building T-wise Combinatorial Interaction Test Suites by Means of Grid Computing
WETICE '09 Proceedings of the 2009 18th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises
Upper bounds for covering arrays by tabu search
Discrete Applied Mathematics
Verification of general and cyclic covering arrays using grid computing
Globe'10 Proceedings of the Third international conference on Data management in grid and peer-to-peer systems
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
A heuristic approach for constructing ternary covering arrays using trinomial coefficients
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
New bounds for binary covering arrays using simulated annealing
Information Sciences: an International Journal
Vector sets for exhaustive testing of logic circuits
IEEE Transactions on Information Theory
Factor interaction on service delivery in mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The Covering Arrays (CAs) are mathematical objects with minimal coverage and maximum cardinality that are a good tool for the design of experiments. A covering array is an N脳k matrix over an alphabet v s.t. each N脳k subset contains at least one time each combination from {0,1,驴,v驴1} t , given a positive integer value t. The process of ensuring that a CA contains each of the v t combinations is called verification of CA. In this paper, we present an algorithm for CA verification and its implementation details in three different computation paradigms: (a) sequential approach (SA); (b) parallel approach (PA); and (c) Grid approach (GA). Four different PAs were compared in their performance of verifying a matrix as a CA; the PA with the best performance was included in a different experimentation where the three paradigms, SA, PA, and GA were compared in a benchmark composed by 45 possible CA instances. The results showed the limitations of the different paradigms when solving the verification of CA problem, and points out the necessity of a Grid approach to solve the problem when the size of a CA grows.