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

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.

[1]  Charles J. Colbourn,et al.  The density algorithm for pairwise interaction testing: Research Articles , 2007 .

[2]  Nancy G. Leveson,et al.  An investigation of the Therac-25 accidents , 1993, Computer.

[3]  José Torres-Jiménez,et al.  Strength Two Covering Arrays Construction Using a SAT Representation , 2008, MICAI.

[4]  Jeff Yu Lei,et al.  IPOG: A General Strategy for T-Way Software Testing , 2007, 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS'07).

[5]  Paola Inverardi,et al.  Software Engineering Education in the Modern Age, Software Education and Training Sessions at the International Conference on Software Engineering, ICSE 2005, St. Louis, MO, USA, May 15-21, 2005, Revised Lectures , 2006, Software Education and Training Sessions @ ICSE.

[6]  Michael L. Fredman,et al.  The AETG System: An Approach to Testing Based on Combinatiorial Design , 1997, IEEE Trans. Software Eng..

[7]  Lih-Yuan Deng,et al.  Orthogonal Arrays: Theory and Applications , 1999, Technometrics.

[8]  Tatsuhiro Tsuchiya,et al.  Using artificial life techniques to generate test cases for combinatorial testing , 2004, Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004..

[9]  Jun Yan,et al.  A backtracking search tool for constructing combinatorial test suites , 2008, J. Syst. Softw..

[10]  José Torres-Jiménez,et al.  A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength , 2009, MICAI.

[11]  A. Jefferson Offutt,et al.  Combination testing strategies: a survey , 2005, Softw. Test. Verification Reliab..

[12]  Kari J. Nurmela,et al.  Upper bounds for covering arrays by tabu search , 2004, Discret. Appl. Math..

[13]  Alan Hartman,et al.  Problems and algorithms for covering arrays , 2004, Discret. Math..

[14]  Charles J. Colbourn,et al.  The density algorithm for pairwise interaction testing , 2007, Softw. Test. Verification Reliab..

[15]  Yu-Wen Tung,et al.  Automating test case generation for the new generation mission software system , 2000, 2000 IEEE Aerospace Conference. Proceedings (Cat. No.00TH8484).

[16]  Martin Charles Golumbic,et al.  Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications , 2011 .

[17]  José Torres-Jiménez,et al.  Computation of Ternary Covering Arrays Using a Grid , 2004, AACC.

[18]  Alan W. Williams,et al.  Determination of Test Configurations for Pair-Wise Interaction Coverage , 2000, TestCom.

[19]  D. Richard Kuhn,et al.  Software fault interactions and implications for software testing , 2004, IEEE Transactions on Software Engineering.

[20]  Steven David Prestwich,et al.  Constraint Models for the Covering Test Problem , 2006, Constraints.

[21]  Yu Lei,et al.  A Test Generation Strategy for Pairwise Testing , 2002, IEEE Trans. Software Eng..

[22]  Myra B. Cohen,et al.  Constructing test suites for interaction testing , 2003, 25th International Conference on Software Engineering, 2003. Proceedings..

[23]  Myra B. Cohen,et al.  A deterministic density algorithm for pairwise interaction coverage , 2004, IASTED Conf. on Software Engineering.

[24]  尚弘 島影.  National Institute of Standards and Technologyにおける超伝導研究及び生活 , 2001 .

[25]  Robert L. Probert,et al.  A practical strategy for testing pair-wise coverage of network interfaces , 1996, Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering.

[26]  Myra B. Cohen,et al.  A framework of greedy methods for constructing interaction test suites , 2005, Proceedings. 27th International Conference on Software Engineering, 2005. ICSE 2005..

[27]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[28]  Charles J. Colbourn,et al.  Tabu search for covering arrays using permutation vectors , 2009 .

[29]  Yu Lei,et al.  In-parameter-order: a test generation strategy for pairwise testing , 1998, Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No.98EX231).

[30]  Charles J. Colbourn,et al.  One-test-at-a-time heuristic search for interaction test suites , 2007, GECCO '07.

[31]  Luiz Carlos A. Rodrigues,et al.  Cell Formation with Alternative Routings and Capacity Considerations: A Hybrid Tabu Search Approach , 2008, MICAI.

[32]  Rory A. Fisher,et al.  The Arrangement of Field Experiments , 1992 .