Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2015.061234
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 6 Issue 12, 2015.
Abstract: Software testing is a critical component of modern software development. For this reason, it has been one of the most active research topics for several years, resulting in many different algorithms, methodologies and tools. Combinatorial testing is one of the most important testing strategies. The test generation problem for combinatorial testing can be modeled as constructing a matrix which has certain properties, typically this matrix is a covering array. The construction of covering arrays with the fewest rows remains a challenging problem. This paper proposes a post-processing technique that repeatedly adjusts the covering array in an attempt to reduce its number of rows. In the experiment, 85 covering arrays, created by a state-of-the-art algorithm, were subject to the reduction process. The results report a reduction in the size of 28 covering arrays (~33%).
Carlos Lara-Alvarez and Himer Avila-George, “A New Algorithm for Post-Processing Covering Arrays” International Journal of Advanced Computer Science and Applications(IJACSA), 6(12), 2015. http://dx.doi.org/10.14569/IJACSA.2015.061234