A New Algorithm for Post-Processing Covering Arrays

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%).

@article{Lara-Alvarez2015,
  title     = {A New Algorithm for Post-Processing Covering Arrays},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {6},
  number    = {12},
  year      = {2015},
  publisher = {The Science and Information Organization},
  author    = {Carlos Lara-Alvarez and Himer Avila-George},
  doi       = {10.14569/IJACSA.2015.061234},
  url       = {https://doi.org/10.14569/IJACSA.2015.061234}
}