Abstract
In software systems, a common source of bugs are unexpected interactions among systems components. This risk is increased when the number of software components increases. To reduce this risk and ensure software quality, it may be necessary to test all interactions among the components. Combinatorial testing is a method that can reduce cost and increase the effectiveness of software testing for many applications. Covering arrays are combinatorial structures which can be used to represent test-suites. This paper presents a metaheuristic approach based on a simulated annealing algorithm for constructing covering arrays. The experimental design solved a benchmark reported in the literature and it is proposed a new bechkmark based on real test-cases. Experimental evidence showed that the simulated annealing algorithm equals or improves the obtained results by other approaches reported in the literature, finding the optimal solution in some of 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
Arshem, J., Schroeder, P.J.: Test Vector Generator, TVG (2009), http://sourceforge.net/projects/tvg
Avila-George, H., Torres-Jimenez, J., Rangel-Valdez, N., Carrión, A., Hernández, V.: Supercomputing and Grid Computing on the Verification of Covering Arrays. The Journal of Supercomputing, 1–30 (2012) (published online: April 18, 2012)
Bryce, R.C., Colbourn, C.J.: The Density Algorithm for Pairwise Interaction Testing. Software Testing, Verification and Reliability 17(3), 159–182 (2007)
Chateauneuf, M., Kreher, D.L.: On the State of Strength-Three Covering Arrays. Journal of Combinatorial Designs 10(4), 217–238 (2002)
Cohen, D.M., Dalal, S.R., Parelius, J., Patton, G.C.: The Combinatorial Design Approach to Automatic Test Generation. IEEE Software 13(5), 83–88 (1996)
Cohen, M.B., Colbourn, C.J., Ling, A.C.: Constructing Strength Three Covering Arrays with Augmented Annealing. Discrete Math. 308(13), 2709–2722 (2008)
Cohen, M.B., Gibbons, P.B., Mugridge, W.B., Colbourn, C.J.: Constructing Test Suites for Interaction Testing. In: 25th Intl. Conf. on Software Engineering (ICSE 2003), pp. 38–48. IEEE (2003)
Gonzalez-Hernandez, L., Torres-Jimenez, J., Rangel-Valdez, N.: Construction of Mixed Covering Arrays of Strengths 2 through 6 Using a Tabu Search Approach. In: Discrete Mathematics, Algorithms and Applications 2 (in press, 2012)
Jenkins, B.: Jenny – A Pairwise Testing Tool (2011), http://burtleburtle.net/bob/math/jenny.html
Lei, Y., Kacker, R.N., Kuhn, D.R., Okun, V., Lawrence, J.: IPOG – A General Strategy for T-Way Software Testing. In: 14th Annual IEEE Intl. Conf. and Works. on the Eng. of Computer-Based Systems (ECBS 2007), pp. 549–556. IEEE (2007)
Lobb, J.R., Colbourn, C.J., Danziger, P., Stevens, B., Torres-Jimenez, J.: Cover Starters for Covering Arrays of Strength Two. Discrete Math. 312(5), 943–956 (2012)
Martinez-Pena, J., Torres-Jimenez, J., Rangel-Valdez, N., Avila-George, H.: A Heuristic Approach for Constructing Ternary Covering Arrays Using Trinomial Coefficients. In: Kuri-Morales, A., Simari, G.R. (eds.) IBERAMIA 2010. LNCS, vol. 6433, pp. 572–581. Springer, Heidelberg (2010)
Meagher, K., Stevens, B.: Group Construction of Covering Arrays. Journal of Combinatorial Designs 13(1), 70–77 (2005)
Moura, L., Stardom, J., Stevens, B., Williams, A.W.: Covering Arrays with Mixed Alphabet Sizes. Journal of Combinatorial Designs 11(6), 413–432 (2003)
Sherwood, G.B.: Optimal and Near-Optimal Mixed Covering Arrays by Column Expansion. Discrete Mathematics 308(24), 6022–6035 (2008)
Shiba, T., Tsuchiya, T., Kikuno, T.: Using Artificial Life Techniques to Generate Test Cases for Combinatorial Testing. In: 28th Annual Intl. Computer Software and Applications Conf (COMPSAC 2004), pp. 72–77. IEEE (2004)
Torres-Jimenez, J., Avila-George, H., Rangel-Valdez, N., Gonzalez-Hernandez, L.: Construction of Orthogonal Arrays of Index Unity Using Logarithm Tables for Galois Fields. In: Sen, J. (ed.) Cryptography and Security in Computing, pp. 71–90. InTech (2012)
Torres-Jimenez, J., Rodriguez-Tello, E.: New Bounds for Binary Covering Arrays Using Simulated Annealing. Information Sciences 185(1), 137–152 (2012)
Williams, A.W.: Determination of Test Configurations for Pair-Wise Interaction Coverage. In: 13th Intl. Conf. on Testing Communicating Systems – Tools and Techniques (TestCom 2000), pp. 57–72. Kluwer (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Avila-George, H., Torres-Jimenez, J., Hernández, V. (2012). Constructing Real Test-Suites Using an Enhanced Simulated Annealing. In: Pavón, J., Duque-Méndez, N.D., Fuentes-Fernández, R. (eds) Advances in Artificial Intelligence – IBERAMIA 2012. IBERAMIA 2012. Lecture Notes in Computer Science(), vol 7637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34654-5_62
Download citation
DOI: https://doi.org/10.1007/978-3-642-34654-5_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34653-8
Online ISBN: 978-3-642-34654-5
eBook Packages: Computer ScienceComputer Science (R0)