Tabu Search in Covering Array Generation

被引：0
|
作者：
Wang Y. [1 ]
Nie C.-H. [2 ]
Niu X.-T. [2 ]
Wu H.-Y. [2 ]
Xu J.-X. [1 ]
机构：
[1] School of Information Engineering, Nanjing Xiaozhuang University, Nanjing
[2] State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing
来源：
Wang, Yan (wangyan@njxzc.edu.cn) | 2018年 / Chinese Academy of Sciences卷 / 29期
基金：
中国国家自然科学基金;
关键词：
Combinatorial testing; Covering arrays; Parallelization; Search based software engineering; Tabu search;
D O I：
10.13328/j.cnki.jos.005369
中图分类号：
学科分类号：
摘要：
Combinatorial testing can effectively detect faults caused by the interaction among the parameters of the system under test. In its 30 years of the development, covering array generation has been one of the key research areas, and relevant research articles have reached more than 200. As effective algorithms to generate covering arrays, existing tabu search algorithms have some advantages on the size of covering array, but there is still much room for improving the solution quality and calculation speed. Furthermore, the practical application of the existing algorithms is poor, because they can neither take account of constrains nor generate variable strength covering arrays. To solve the above problems, this paper proposes a new tabu search algorithm. Three improved aspects are presented. 1) The process of parameter tuning is divided into two stages: pair-wise and climbing to ensure that the optimal configuration is hit with a minimum number of configurations so as to further improve the size of covering arrays. 2) In order to improve the speed, the algorithm is parallelized. 3) Constrains and variable strength handling are added to make the algorithm adapt to various test scenarios. Experimental results show that the proposed algorithm has the advantage on the size of various covering arrays, such as fixed strength covering arrays, variable strength covering arrays and covering arrays with constraints. At the same time, the parallelization results in the increase of average speed of the algorithm by about 2.6 times. © Copyright 2018, Institute of Software, the Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码：3665 / 3691
页数：26
相关论文
共 35 条
  • [1] Nie C.H., Leung H., A survey of combinatorial testing, ACM Computing Surveys, 43, 2, pp. 1-29, (2011)
  • [2] Nie C.H., Wu H.Y., Niu X.T., Kuo F.C., Leung H., Colbourn C.J., Combinatorial testing, random testing, and adaptive random testing for detecting interaction triggered failures, Information and Software Technology, 62, pp. 198-213, (2015)
  • [3] Kuhn D.R., Reilly M.J., An investigation of the applicability of design of experiments to software testing, Proc. of the 27th Annual NASA Goddard Software Engineering Workshop, pp. 91-95, (2002)
  • [4] Bryce R.C., Colbourn C.J., Cohen M.B., A framework of greedy methods for constructing interaction test suites, Proc. of the 27th Int'l Conf. on Software Engineering, pp. 146-155, (2005)
  • [5] Colbourn C.J., Cohen M.B., Turban R., A deterministic density algorithm for pairwise interaction coverage, Proc. of the IASTED Conf. on Software Engineering, pp. 345-352, (2004)
  • [6] Tai K.C., Lei Y., A test generation strategy for pairwise testing, IEEE Trans. on Software Engineering, 28, 1, pp. 109-111, (2002)
  • [7] Lei Y., Kacker R., Kuhn D.R., Okun V., Lawrence J., IPOG: A general strategy for t-way software testing, Proc. of the 14th Annual IEEE Int'l Conf. and Workshops on the Engineering of Computer-Based Systems, pp. 549-556, (2007)
  • [8] Nie C.H., Wu H.Y., Liang Y.L., Search based combinatorial testing, Proc. of the 19th Asia-Pacific Software Engineering Conf, pp. 778-783, (2012)
  • [9] Willams A.W., Determination of test configurations for pair-wise interaction coverage, Proc. of the IFIP TC6/WG6.113th Int'l Conf. on Testing Communicating Systems, 48, pp. 59-74, (2000)
  • [10] Kobayashi N., Design and evaluation of automatic test generation strategies for functional testing of software, (2002)
1234