Abstract
A covering array (CA) is an N ×k matrix over the alphabet v s.t. each N ×k subset contains at least one time each v t combination. Covering Arrays (CAs) have been applied mainly in software and hardware testing. The construction of CAs requires to do the verification that each N ×t subset contains at least one time each v t combination. In this paper we present a sequential algorithm and a grid algorithm to do the CA verification. The algorithms were tested using a benchmark of CAs of variable strength. The main conclusion of the paper lies in the identification of the strengths and weakness of our algorithms (related to the values of the CA parameters).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hedayat, A.S., Sloane, N.J.A., Stufken, J.: Orthogonal Arrays: Theory and Applications. Springer, New York (1999) ISBN 0-387-98766-5
Stevens, B., Mendelsohn, E.: New recursive methods for transversal covers. Journal of Combinatorial Designs 7, 185–203 (1999)
Colbourn, C.J.: A deterministic density algorithm for pairwise interaction coverage. In: Proceedings of the IASTED Intl. Conference on Software Engineering, pp. 242–252 (2004)
Colbourn, C.J.: Covering Arrays from Cyclotomy. Designs, Codes and Cryptography 55, 201–219 (2009)
Yilmaz, C.: Covering Arrays for Efficient Fault Characterization in Complex Configuration Spaces. IEEE Trans. Softw. Eng. 32, 20–34 (2006)
Shasha, D.E., Kouranov, A.Y., Lejay, L.V., Chou, M.F., Coruzzi, G.M.: Using combinatorial design to study regulation by multiple input signals: A tool for parsimony in the post-genomics era. Plant Physiology 127, 1590–1594 (2001)
Kleitmain, D.J., Spencer, J.: Families of k-independent sets. Discrete Math. 6, 255–262 (1973)
Lopez-Escogido, D., Torres-Jimenez, J., Rodriguez-Tello, E., Rangel-Valdez, N.: Strength Two Covering Arrays Construction Using a SAT Representation. In: Gelbukh, A., Morales, E.F. (eds.) MICAI 2008. LNCS (LNAI), vol. 5317, pp. 44–53. Springer, Heidelberg (2008)
Kuhn, D.R., Okum, V.: Pseudo-Exhaustive Testing for Software. In: SEW ’06: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop, pp. 153–158 (2006)
Rodriguez-Tello, E., Torrez-Jimenez, J.: Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three. In: Collet, P., Legrand, P. (eds.) EA 2009. LNCS, vol. 5975, pp. 86–97. Springer, Heidelberg (2010)
Foster, I., Kesselman, C.: Computational grids. In: The grid: blueprint for a new computing infrastructure, pp. 15–51. Morgan Kaufmann Publishers Inc., San Francisco (1999)
Bracho-Rios, J., Torres-Jimenez, J., Rodriguez-Tello, E.: A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength. In: MICAI 2009: Proceedings of the Mexican International Conference on Artificial Intelligence, pp. 397–407 (2009)
Cawse, J.N.: Experimental design for combinatorial and high throughput materials development. GE Global Research Technical Report, 769–781 (2002)
Torres-Jimenez, J., de Alfonso, C., Hernández, V.: Computation of Ternary Covering Arrays Using a Grid. In: Manandhar, S., Austin, J., Desai, U., Oyanagi, Y., Talukder, A.K. (eds.) AACC 2004. LNCS, vol. 3285, pp. 240–246. Springer, Heidelberg (2004) ISBN: 978-3-540-23659-7
Yan, J., Zhang, J.: A backtracking search tool for constructing combinatorial test suites. J. Syst. Softw. 81, 1681–1693 (2008)
Bush, K.A.: Orthogonal Arrays of Index Unity. The Annals of Mathematical Statistics 23, 426–434 (1952)
Nurmela, K.J.: Upper bounds for covering arrays by tabu search. Discrete Appl. Math. 138, 143–152 (2004)
Meagher, K., Stevens, B.: Group Construction of Covering Arrays. Journal of Combinatorial Designs 13, 70–77 (2004)
Vadde, K., Syrotiuk, V.R.: Factor interaction on service delivery in mobile ad hoc networks. IEEE Journal on Selected Areas in Communications 22, 1335–1346 (2004)
Cohen, M.B., Colbourn, C.J., Ling, A.C.H.: Augmenting Simulated Annealing to Build Interaction Test Suites. In: ISSRE ’03: Proceedings of the 14th International Symposium on Software Reliability Engineering, p. 394 (2003)
Younis, M.I., Zamli, K.Z., Isa, N.A.M.: A Strategy for Grid Based T-Way Test Data Generation. In: Proceedings the 1st IEEE International Conference on Distributed Framework and Applications, pp. 73–78 (2008)
Phadke, M.S.: Quality Engineering Using Robust Design. Prentice Hall PTR, Upper Saddle River (1995) ISBN:0137451679
Kuhn, R., Lei, Y., Kacker, R.: Practical Combinatorial Testing: Beyond Pairwise. IT Professional 10, 19–23 (2008)
Berling, T., Runeson, P.: Efficient Evaluation of Multifactor Dependent System Performance Using Fractional Factorial Design. IEEE Transactions on Software Engineering 29, 769–781 (2003)
Shiba, T., Tsuchiya, T., Kikuno, T.: Using Artificial Life Techniques to Generate Test Cases for Combinatorial Testing. In: COMPSAC ’04: Proceedings of the 28th Annual International Computer Software and Applications Conference, pp. 72–77 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Avila-George, H., Torres-Jimenez, J., Hernández, V., Rangel-Valdez, N. (2010). Verification of General and Cyclic Covering Arrays Using Grid Computing. In: Hameurlain, A., Morvan, F., Tjoa, A.M. (eds) Data Management in Grid and Peer-to-Peer Systems. Globe 2010. Lecture Notes in Computer Science, vol 6265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15108-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-15108-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15107-1
Online ISBN: 978-3-642-15108-8
eBook Packages: Computer ScienceComputer Science (R0)