Abstract
The development of a new system involves extensive tests on the software functionality in order to identify possible failures. Also, a system already built requires a fine tuning of its configurable options to give the best performance in the environment it is going to work. Both cases require a finite set of tests that avoids testing all the possible combinations (which is time consuming); to this situation Mixed Covering Arrays (MCAs) are a feasible alternative. MCAs are combinatorial structures represented as matrices having a test case per row. MCAs are small, in comparison with brute force, and guarantees a level of interaction among the parameters involved (a difference with random testing). We present a Tabu Search (TS) algorithm to construct MCAs; the novelty in the algorithm is a mixture of three neighborhood functions. We also present a new benchmark for the MCAs problem. The experimental evidence showed that the TS algorithm improves the results obtained by other approaches reported in the literature, finding the optimal solution in some the solved cases.
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
Bracho-Rios, J., Torres-Jimenez, J., Rodriguez-Tello, E.: A new backtracking algorithm for constructing binary covering arrays of variable strength. LNCS (LNAI), vol. 5845, pp. 397–407 (2009)
Bryce, R.C., Colbourn, C.J.: The density algorithm for pairwise interaction testing: Research articles. Softw. Test. Verif. Reliab. 17(3), 159–182 (2007)
Bryce, R.C., Colbourn, C.J.: One-test-at-a-time heuristic search for interaction test suites. In: GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, pp. 1082–1089. ACM, New York (2007)
Bryce, R.C., Colbourn, C.J., Cohen, M.B.: A framework of greedy methods for constructing interaction test suites. In: Inverardi, P., Jazayeri, M. (eds.) ICSE 2005. LNCS, vol. 4309, pp. 146–155. Springer, Heidelberg (2006)
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., Gibbons, P.B., Mugridge, W.B., Colbourn, C.J.: Constructing test suites for interaction testing. In: Proc. of the 25th Int. Conf. on Software Engeneering (ICSE 2003), pp. 38–48 (2003)
Colbourn, C.J., Cohen, M.B., Turban, R.C.: A deterministic density algorithm for pairwise interaction coverage. In: Proc. of the IASTED Intl. Conference on Software Engineering (2004)
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)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1998)
Grindal, M., Offutt, J., Andler, S.F.: Combination testing strategies: a survey. Software testing verification & reliability 15, 167–199 (2005)
Hnich, B., Prestwich, S.D., Selensky, E., Smith, B.M.: Constraint models for the covering test problem. Constraints 11(2-3), 199–219 (2006)
Walker II, R.A., Colbourn, C.J.: Tabu search for covering arrays using permutation vectors. Journal of Statistical Planning and Inference 139(1), 69–80 (2009); Special Issue on Metaheuristics, Combinatorial Optimization and Design of Experiments
Kuhn, D.R., Okun, V.: Pseudo-exhaustive testing for software. In: Proceedings 30th Annual IEEE/NASA Software Engineering Workshop (SEW 2006), pp. 153–158 (April 2006)
Kuhn, D.R., Wallance, D.R., Gallo Jr., A.M.: Software fault interactions and implications for software testing. IEEE Transactions on Software Engineering 30, 418–421 (2004)
Lei, Y., Kacker, R., Kuhn, R.D., Okun, V., Lawrence, J.: Ipog: A general strategy for t-way software testing. In: 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS 2007), pp. 549–556 (2007)
Lei, Y., Tai, K.C.: In-parameter-order: A test generation strategy for pairwise testing. In: Proceedings of Third IEEE International High-Assurance Systems Engineering Symposium, pp. 254–261 (1998)
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)
Nurmela, K.J.: Upper bounds for covering arrays by tabu search. Discrete Applied Mathematics 138, 143–152 (2004)
Okun, V., Black, P.E., Yesha, Y.: Testing with model checker: Insuring fault visibility. WSEAS Transactions on Systems 2, 77–82 (2003)
Shiba, T., Kikuno, T., Tsuchiya, T.: Using artificial life techniques to generate test cases for combinatorial testing. In: Proceedings of the 28th Annual International Computer Software and Applications Conference (COMPSAC 2004), vol. 1, pp. 28–30 (2004)
Stardom, J.: Metaheuristics and the Search for Covering and Packing Arrays. PhD thesis, Simon Fraser University (2001)
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)
Tung, Y.W., Aldiwan, W.S.: Automating test case generation for the new generation mission software system. In: Proceedings Aerospace Conference IEEE, vol. 1, pp. 431–437 (2000)
Williams, A.W.: Determination of test configurations for pair-wise interaction coverage. In: TestCom 2000: Proceedings of the IFIP TC6/WG6.1 13th International Conference on Testing Communicating Systems, Deventer, The Netherlands, pp. 59–74. Kluwer, B.V. (2000)
Williams, A.W., Probert, R.L.: A practical strategy for testing pair-wise coverage of network interfaces. In: Seventh Intl. Symp. on Software Reliability Engineering, pp. 246–254 (1996)
Yan, J., Zhang, J.: A backtraking search tool for constructing combinatorial test suites. The Journal of Systems and Software (2008), doi:10.1016/j.jss.2008.02.034
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
Gonzalez-Hernandez, L., Rangel-Valdez, N., Torres-Jimenez, J. (2010). Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17458-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-17458-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17457-5
Online ISBN: 978-3-642-17458-2
eBook Packages: Computer ScienceComputer Science (R0)