Abstract
A Covering Array denoted by CA(N;t,k,v) is a matrix of size N ×k, in which each of the v t combinations appears at least once in every t columns. Covering Arrays (CAs) are combinatorial objects used in software testing. There are different methods to construct CAs, but as it is a highly combinatorial problem, few complete algorithms to construct CAs have been reported. In this paper a new backtracking algorithm based on the Branch & Bound technique is presented. It searches only non-isomorphic Covering Arrays to reduce the search space of the problem of constructing them. The results obtained with this algorithm are able to match some of the best known solutions for small instances of binary CAs.
This research was partially funded by the following projects: CONACyT 58554-Cálculo de Covering Arrays, 51623-Fondo Mixto CONACyT y Gobierno del Estado de Tamaulipas.
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
Tassey, G.: RTI: The economic impacts of inadequate infrastructure for software testing. Technical Report 02-3, National Institute of Standards and Technology, Gaithersburg, MD, USA (May 2002)
Hartman, A.: 10. In: Graph Theory, Combinatorics and Algorithms. Operations Research/Computer Science Interfaces Series, vol. 34, pp. 237–266. Springer, Heidelberg (2005)
Colbourn, C.J.: Most recent covering arrays tables, http://www.public.asu.edu/~ccolbou/src/tabby/catable.html. (Last Time Accesed November 4, 2008)
Kuhn, D.R., Wallance, D.R., Gallo, A.M.J.: Software fault interactions and implications for software testing. IEEE Transactions on Software Engineering 30, 418–421 (2004)
Lei, Y., Tai, K.: In-parameter-order: A test generation strategy for pairwise testing. In: Proceedings of the 3rd IEEE International Symposium on High-Assurance Systems Engineering, pp. 254–261. IEEE Computer Society, Washington (1998)
Colbourn, C.J., Cohen, M.B., Turban, R.C.: A deterministic density algorithm for pairwise interaction coverage. In: Proceedings of the IASTED International Conference on Software Engineering (2004)
Kuhn, D.R., Okum, V.: Pseudo-exhaustive testing for software. In: SEW 2006: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop, pp. 153–158. IEEE Computer Society, Washington (2006)
Sloane, N.J.A.: Covering arrays and intersecting codes. Journal of Combinatorial Designs 1, 51–63 (1993)
Bush, K.A.: Orthogonal arrays of index unity. Annals of Mathematical Statistics 13, 426–434 (1952)
Yan, J., Zhang, J.: Backtracking algorithms and search heuristics to generate test suites for combinatorial testing. In: Computer Software and Applications Conference(COMPSAC 2006) 30th Annual International, vol. 1, pp. 385–394 (2006)
Hartman, A., Raskin, L.: Problems and algorithms for covering arrays. Discrete Mathematics 284, 149–156 (2004)
Hedayat, A.S., Sloane, N.J.A., Stufken, J.: Orthogonal Arrays: Theory and Applications. Springer, New York (1999)
Cohen, D.M., Fredman, M.L., Patton, G.C.: The aetg system: An approach to testing based on combinatorial design. IEEE Transactions on Software Engineering 23, 437–444 (1997)
Cohen, M.B., Colbourn, C.J., Ling, A.C.H.: Constructing strength three covering arrays with augmented annealing. Discrete Mathematics 308, 2709–2722 (2008)
Nurmela, K.J.: Upper bounds for covering arrays by tabu search. Discrete Appl. Math. 138(1-2), 143–152 (2004)
Hnich, B., Prestwich, S.D., Selensky, E., Smith, B.M.: Constraint models for the covering test problem. Constraints 11(2-3), 199–219 (2006)
Yan, J., Zhang, J.: A backtracking search tool for constructing combinatorial test suites. The journal of systems and software 81(10), 1681–1693 (2008)
Forbes, M., Lawrence, J., Lei, Y., Kacker, R.N., Kuhn, D.R.: Refining the in-parameter-order strategy for constructing covering arrays. Journal of Research of the National Institute of Standards and Technology 113(5), 287–297 (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
Bracho-Rios, J., Torres-Jimenez, J., Rodriguez-Tello, E. (2009). A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength. In: Aguirre, A.H., Borja, R.M., Garciá, C.A.R. (eds) MICAI 2009: Advances in Artificial Intelligence. MICAI 2009. Lecture Notes in Computer Science(), vol 5845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05258-3_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-05258-3_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05257-6
Online ISBN: 978-3-642-05258-3
eBook Packages: Computer ScienceComputer Science (R0)