Skip to main content
SpringerLink
Log in

MiTS: A New Approach of Tabu Search for Constructing Mixed Covering Arrays

  • Conference paper
Advances in Soft Computing (MICAI 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6438))

Included in the following conference series:

Abstract

Software systems have been increasingly used by our society, so a failure in them can lead to large losses. To reduce the failures of a software it is necessary to carry out the testing process appropriately. The combinatorial testing helps in the testing process by providing structures with a test set of small size, like Mixed Covering Arrays (MCAs). However, the problem of constructing an optimal test set is an NP-complete problem leading to the development of non exhaustive approaches to solve it. This paper proposes a new approach of Tabu Search (TS) called MiTS (that stands for Mixed Tabu Search) which focuses on constructing MCAs. The approach is based on the use of a mixture of neighborhood functions and a fine tuning process to improve the performance of the TS. Experimental evidence shows a poor performance when a single neighborhood function is used. In the other side, the TS (using a mixture of neighborhood functions) is competitive in the construction of MCAs over a known benchmark reported in the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bracho-Rios, J., Torres-Jimenez, J., Rodriguez-Tello, E.: A new backtracking algorithm for constructing binary covering arrays of variable strength. In: Hernández Aguirre, A., et al. (eds.) MICAI 2009. LNCS (LNAI), vol. 5845, pp. 397–407. Springer, Heidelberg (2009)

    Google Scholar 

  2. Bryce, R.C., Colbourn, C.J.: The density algorithm for pairwise interaction testing: Research articles. Softw. Test. Verif. Reliab. 17(3), 159–182 (2007)

    Article  Google Scholar 

  3. 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)

    Google Scholar 

  4. 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)

    Google Scholar 

  5. 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)

    Article  Google Scholar 

  6. 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)

    Google Scholar 

  7. Colbourn, C.J.: http://www.public.asu.edu/~ccolbou/src/tabby/6-4-ca.html

  8. 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)

    Google Scholar 

  9. Fisher, R.A.: The arrangement of field experiments. Journal of Ministry of Agriculture of Great Britain 33, 503–513 (1926), http://www.library.adelaide.edu.au/digitised/fisher/48.pdf

    Google Scholar 

  10. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1998)

    Book  MATH  Google Scholar 

  11. Grindal, M., Offutt, J., Andler, S.F.: Combination testing strategies: a survey. Software testing verification & reliability 15, 167–199 (2005)

    Article  Google Scholar 

  12. Hartman, A., Ben, I.: Graph Theory, combinatorics and algorithms interdisciplinary applications, 4th edn. Springer, US (2005)

    MATH  Google Scholar 

  13. Hartman, A., Raskin, L.: Problems and algorithms for covering arrays. Discrete Mathematics 284, 149–156 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hedayat, A.S., Sloane, N.J.A., Stufken, J.: Orthogonal Arrays: Theory and Applications. Springer, New York (1999)

    Book  MATH  Google Scholar 

  15. Hnich, B., Prestwich, S.D., Selensky, E., Smith, B.M.: Constraint models for the covering test problem. Constraints 11(2-3), 199–219 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  16. 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

    Article  MathSciNet  MATH  Google Scholar 

  17. 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)

    Article  Google Scholar 

  18. 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)

    Google Scholar 

  19. Lei, Y., Tai, K.C.: In-parameter-order: A test generation strategy for pairwise testing. In: Proceedings. Third IEEE International High-Assurance Systems Engineering Symposium, pp. 254–261 (1998)

    Google Scholar 

  20. Levenson, N.G., Turner, C.S.: An investigation of the therac-25 accidents. IEEE Computer 26, 18–41 (1993)

    Article  Google Scholar 

  21. 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)

    Chapter  Google Scholar 

  22. Nurmela, K.J.: Upper bounds for covering arrays by tabu search. Discrete applied mathematics 138, 143–152 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  23. National Institute of Standards and Technology. The economic impacts of inadecuate infraestructure for software testing. U.S. Deparment of Commerce (May 2002)

    Google Scholar 

  24. Rodrigues, L.C.A., Weller, T.R.: Cell formation with alternative routings and capacity considerations: A hybrid tabu search approach. In: Gelbukh, A., Morales, E.F. (eds.) MICAI 2008. LNCS (LNAI), vol. 5317, pp. 482–491. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  25. 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)

    Google Scholar 

  26. Stardom, J.: Metaheuristics and the Search for Covering and Packing Arrays. PhD thesis, Simon Fraser University (2001)

    Google Scholar 

  27. Tai, K.C., Lei, Y.: A test generation strategy for pairwise testing. IEEE Transactions on Software Engineering 28, 109–111 (2002)

    Article  Google Scholar 

  28. Torres-Jimenez, J.: http://www.tamps.cinvestav.mx/~jtj/authentication.php

  29. Torres-Jimenez, J., de Alfonso, C., Hernández, V.: Computation of ternary covering arrays using a grid. In: AACC, pp. 240–246 (2004)

    Google Scholar 

  30. 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)

    Google Scholar 

  31. 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., Dordrecht (2000)

    Google Scholar 

  32. 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)

    Google Scholar 

  33. 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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Technology Laboratory, CINVESTAV-Tamaulipas, Km. 5.5 Carretera Cd. Victoria-Soto la Marina, 87130, Cd. Victoria Tamps, Mexico

    Loreto Gonzalez-Hernandez & Jose Torres-Jimenez

Authors
  1. Loreto Gonzalez-Hernandez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jose Torres-Jimenez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centro de Investigación en Computación, Instituto Politécnico Nacional, , Av. Juan Dios Batiz, s/n, Zacatenco, 07738, Mexico City, México

    Grigori Sidorov

  2. Centro de Investigación en Matemáticas (CIMAT), Area de Computación, Callejón de Jalisco s/n, Mineral de Valenciana, Guanajuato, 36240, Guanajuato, México

    Arturo Hernández Aguirre

  3. Ciencias Computacionales, Instituto Nacional de Astrofísica, Optica y Electrónica (INAOE), Luis Enrique Erro No. 1, Santa María Tonantzintla, 72840, Puebla, México

    Carlos Alberto Reyes García

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gonzalez-Hernandez, L., Torres-Jimenez, J. (2010). MiTS: A New Approach of Tabu Search for Constructing Mixed Covering Arrays. In: Sidorov, G., Hernández Aguirre, A., Reyes García, C.A. (eds) Advances in Soft Computing. MICAI 2010. Lecture Notes in Computer Science(), vol 6438. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16773-7_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16773-7_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16772-0

  • Online ISBN: 978-3-642-16773-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation