Abstract
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. While some is necessary, some is not. By reducing the repeated coverage, metaheuristic search techniques typically outperform simpler computational methods, but they have been applied in a limited set of cases. Time constraints often prevent them from finding an array of competitive size. We examine a different approach. Having used a simple computation or construction to find a covering array, we employ a postoptimization technique that repeatedly adjusts the array in order to (sometimes) reduce its number of rows. At every stage the array retains full coverage. We demonstrate its value on a collection of previously best known arrays by eliminating, in some cases, 10% of their rows. In the well-studied case of strength two with twenty factors having ten values each, postoptimization produces a covering array with only 162 rows, improving on a wide variety of computational and combinatorial methods. We identify certain important features of covering arrays for which postoptimization is successful.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Colbourn, C.J.: Combinatorial aspects of covering arrays. Le Matematiche (Catania) 58, 121–167 (2004)
Hartman, A.: Software and hardware testing using combinatorial covering suites. In: Golumbic, M.C., Hartman, I.B.A. (eds.) Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms, pp. 237–266. Springer, Norwell (2005)
Hedayat, A.S., Sloane, N.J.A., Stufken, J.: Orthogonal Arrays. Springer, New York (1999)
Godbole, A.P., Skipper, D.E., Sunley, R.A.: t-covering arrays: upper bounds and Poisson approximations. Combinatorics, Probability and Computing 5, 105–118 (1996)
Katona, G.: Two applications (for search theory and truth functions) of Sperner type theorems. Periodica Math. 3, 19–26 (1973)
Kleitman, D., Spencer, J.: Families of k-independent sets. Discrete Math. 6, 255–262 (1973)
Colbourn, C.J., Martirosyan, S.S., Mullen, G.L., Shasha, D.E., Sherwood, G.B., Yucas, J.L.: Products of mixed covering arrays of strength two. Journal of Combinatorial Designs 14(2), 124–138 (2006)
Cohen, M.B., Colbourn, C.J., Ling, A.C.H.: Constructing strength three covering arrays with augmented annealing. Discrete Math. 308, 2709–2722 (2008)
Colbourn, C.J., Martirosyan, S.S., van Trung, T., Walker II, R.A.: Roux-type constructions for covering arrays of strengths three and four. Designs, Codes and Cryptography 41, 33–57 (2006)
Martirosyan, S.S., Colbourn, C.J.: Recursive constructions for covering arrays. Bayreuther Math. Schriften 74, 266–275 (2005)
Martirosyan, S.S., van Trung, T.: On t-covering arrays. Des. Codes Cryptogr. 32, 323–339 (2004)
Colbourn, C.J.: Distributing hash families and covering arrays. J. Combin. Inf. Syst. Sci. (to appear)
Colbourn, C.J.: Strength two covering arrays: Existence tables and projection. Discrete Math. 308, 772–786 (2008)
Meagher, K., Stevens, B.: Group construction of covering arrays. J. Combin. Des. 13(1), 70–77 (2005)
Sherwood, G.B., Martirosyan, S.S., Colbourn, C.J.: Covering arrays of higher strength from permutation vectors. J. Combin. Des. 14(3), 202–213 (2006)
Walker II, R.A., Colbourn, C.J.: Tabu search for covering arrays using permutation vectors. J. Stat. Plann. Infer. 139, 69–80 (2009)
Colbourn, C.J., Kéri, G.: Covering arrays and existentially closed graphs. In: Xing, C., et al. (eds.) IWCC 2009. LNCS, vol. 5557, pp. 22–33. Springer, Heidelberg (2009)
Chateauneuf, M.A., Kreher, D.L.: On the state of strength-three covering arrays. J. Combin. Des. 10(4), 217–238 (2002)
Johnson, K.A., Entringer, R.: Largest induced subgraphs of the n-cube that contain no 4-cycles. J. Combin. Theory Ser. B 46(3), 346–355 (1989)
Johnson, K.A., Grassl, R., McCanna, J., Székely, L.A.: Pascalian rectangles modulo m. Quaestiones Math. 14(4), 383–400 (1991)
Tang, D.T., Chen, C.L.: Iterative exhaustive pattern generation for logic testing. IBM Journal Research and Development 28(2), 212–219 (1984)
Cohen, M.B.: Designing test suites for software interaction testing. PhD thesis, The University of Auckland, Department of Computer Science (2004)
Nurmela, K.: Upper bounds for covering arrays by tabu search. Discrete Applied Mathematics 138(9), 143–152 (2004)
Hnich, B., Prestwich, S., Selensky, E., Smith, B.M.: Constraint models for the covering test problem. Constraints 11, 199–219 (2006)
Cohen, D.M., Dalal, S.R., Fredman, M.L., Patton, G.C.: The AETG system: an approach to testing based on combinatorial design. IEEE Transactions on Software Engineering 23(7), 437–444 (1997)
Tung, Y.W., Aldiwan, W.S.: Automating test case generation for the new generation mission software system. In: Proc. 30th IEEE Aerospace Conference, pp. 431–437. IEEE, Los Alamitos (2000)
Bryce, R.C., Colbourn, C.J.: The density algorithm for pairwise interaction testing. Software Testing, Verification, and Reliability 17, 159–182 (2007)
Bryce, R.C., Colbourn, C.J.: A density-based greedy algorithm for higher strength covering arrays. Software Testing, Verification, and Reliability 19, 37–53 (2009)
Tai, K.C., Yu, L.: A test generation strategy for pairwise testing. IEEE Transactions on Software Engineering 28(1), 109–111 (2002)
Lei, Y., Kacker, R., Kuhn, D.R., Okun, V., Lawrence, J.: IPOG: A general strategy for t-way software testing. In: Fourteenth Int. Conf. Engineering Computer-Based Systems, pp. 549–556 (2007)
Forbes, M., Lawrence, J., Lei, Y., Kacker, R.N., Kuhn, D.R.: Refining the in-parameter-order strategy for constructing covering arrays. J. Res. Nat. Inst. Stand. Tech. 113(5), 287–297 (2008)
Kuhn, D.R., Lei, Y., Kacker, R., Okun, V., Lawrence, J.: Paintball: A fast algorithm for covering arrays of high strength. Internal Tech. Report, NISTIR 7308 (2007)
Colbourn, C.J.: Covering array tables, http://www.public.asu.edu/~ccolbou/src/tabby , 2005–present
Sherwood, G.: Effective testing of factor combinations. In: Proc. 3rd Int’l Conf. Software Testing, Analysis and Review, Software Quality Eng. (1994)
Calvagna, A., Gargantini, A.: IPO-s: incremental generation of combinatorial interaction test data based on symmetries of covering arrays. In: Proc. Fifth Workshop on Advances in Model Based Testing (to appear, 2009)
Stevens, B., Ling, A., Mendelsohn, E.: A direct construction of transversal covers using group divisible designs. Ars Combin. 63, 145–159 (2002)
Linnemann, D., Frewer, M.: Computations with the density algorithm (private communication by e-mail) (October 2008)
Kuliamin, V.V.: Private communication by e-mail (February 2007)
Soriano, P.P.: Private communication by e-mail (March 2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nayeri, P., Colbourn, C.J., Konjevod, G. (2009). Randomized Postoptimization of Covering Arrays. In: Fiala, J., Kratochvíl, J., Miller, M. (eds) Combinatorial Algorithms. IWOCA 2009. Lecture Notes in Computer Science, vol 5874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10217-2_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-10217-2_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10216-5
Online ISBN: 978-3-642-10217-2
eBook Packages: Computer ScienceComputer Science (R0)