期刊文献+

基于粒子群优化算法的类集成测试序列确定方法 被引量:17

Class Integration Testing Order Determination Method Based on Particle Swarm Optimization Algorithm
下载PDF
导出
摘要 类测试序列的确定是类集成测试中一个难以解决的关键问题.合理的类集成测试序列可以降低构造测试桩的总体复杂度,降低测试代价.提出一种基于粒子群优化算法的类集成测试序列确定方法.首先,对所有类进行排列组合生成所有可能的类测试序列,并将每个类测试序列看成一个粒子并映射到一维空间,用空间中的每一个位置代表一个类集成测试序列;然后,根据适应度函数计算每个粒子的速度和位置,再通过粒子群优化算法选择粒子的最优位置和最优适应度,得到最优粒子;最后,根据映射关系,将选择的最优粒子映射为其对应的类测试序列,则该测试序列即为所求得的最优类测试序列.实验结果表明,采用该文方法求得的类测试序列花费更小的测试代价,该文方法更有效. Class integration testing is an important part in object-oriented software testing,and it is a key and difficult problem to determine the class integration test order of class cluster in integration testing.Reasonable class integration test order can reduce the overall complexity of test stub,and reduce test cost.A class integration test order determination method based on particle swarm optimization algorithm is proposed.First,all possible classes test orders are generated through permutation and combination,and each class test order is taken as a particle and is mapped to one dimensional space,and then each position in dimensional space represents a integration test order;Then,we calculate the velocity and position of each particle according to fitness function,and then choose the optimal position and the optimal fitness of the particles by particle swarm optimization algorithm,and obtain the optimal particle;Finally,according to the mapping relationship,we get the test order that the optimal particle is corresponding to,which is the optimal test order.The optimal test order makes the minimum overall complexity of test stub and the minimum test cost.The experimental results show that the proposed approach takes a lower test stub cost for solving the class test order problem,which is more effective.
作者 张艳梅 姜淑娟 陈若玉 王兴亚 张妙 ZHANG Yan-Mei;JIANG Shu-Juan;CHEN Ruo-Yu;WANG Xing-Ya;ZHANG Miao(School of Computer Science and Technology,China University of Mining and Technology,Xuzhou,Jiangsu 221116;Guangxi Key Laboratory of Trusted Software,Guilin,Guangxi 541004)
出处 《计算机学报》 EI CSCD 北大核心 2018年第4期931-945,共15页 Chinese Journal of Computers
基金 国家自然科学基金(61502497 61673384) 广西可信软件重点实验室研究课题(kx201609) 中国博士后科学基金项目(2015M581887) 徐州市科技计划项目(KC15SM051)资助
关键词 测试序列 面向对象 集成测试 粒子群优化算法 一维空间 test order object-oriented integration testing particle swarm optimization algorithm one-dimensional space
  • 相关文献

参考文献3

二级参考文献34

  • 1卢炎生,毛澄映.面向对象簇级测试中类间测试序确定方法研究[J].小型微型计算机系统,2005,26(6):995-999. 被引量:6
  • 2Abdurazik A, Offutt A J. Using coupling-based weights for the class integration and test order problem. The Computer Journal, 2009, 52(5): 557-570.
  • 3Briand L C, Labiche Y, Wang Y. An investigation of graphbased class integration test order strategies. IEEE Transaction on Software Engineering, 2003, 29(7): 594-607.
  • 4Hanh V L, Akif K, Traon Y L, Jezequel J M. Selecting an efficient oo integration testing strategy: An experimental comparison of actual strategies//Proceedings of the 15th European Conference on Object-Oriented Programming. Budapest, Hungary, LNCS 2072. Springer-Verlag, 2001: 381- 401.
  • 5Mao C, Lu Y. Aicto: An improved algorithm for planning inter-class test order//Proceedings of the 5th International Conference on Computer and Information Technology. Shanghai, China, 2005:927-931.
  • 6Tai K C, Daniels F. Test order for inter-class integration testing of object-oriented software//Proceedings of the 21st International Computer Software and Applications Conference. Washington, DC, USA, 1997:602-607.
  • 7Le Traon Y, Jeron T, Jezequel J-M, Morel P. Efficient object-oriented integration and regression testing. IEEE Transactions on Reliability, 2000, 49(1) : 12-25.
  • 8Wang Z, Li B. Using coupling measure technique and random iterative algorithm for inter-class integration test order problem//Proeeedings of the 34th Annual IEEE Computer Software and Applications Conference Workshops. Seoul, Korea, 2010:329-334.
  • 9Briand L, Feng J, Labiche Y. Experimenting with genetic algorithms to devise optimal integration test orders. Carleton University, Technical Report SCE-02-03, 2002.
  • 10Tarjan R. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1972, 1(2) : 146-160.

共引文献16

同被引文献171

引证文献17

二级引证文献75

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部