期刊文献+

一种利用商空间方法的优化测试用例集生成算法

An Optimization Algorithm for Test Suite Generation Using Quotient Space Methods
下载PDF
导出
摘要 在对软件系统进行测试时,由测试需求创建的测试用例集往往数量庞大且存在冗余,为了提高测试效率,降低测试成本,需要优化测试用例集.因此基于商空间理论,提出一种优化测试用例集生成算法:利用测试需求间的相互关系,首先运用商空间理论中的属性投影法进行测试用例集的分解,再运用商空间理论中的属性合成法对分解所得的测试用例商集进行合成,同时采用半序结构来描述测试用例子集之间的关系,从而最终在合成结果中通过简单的选择即可得到优化测试用例集.先通过理论证明了该算法的有效性;再通过仿真实验模拟该算法在不同情况下的约简效果,不仅进一步验证该算法在测试用例集约简上的优势,而且得出影响该算法约简效果的两个因素. In software testing,the test suite generated by the test requirements usually is numerous and has a quite big redundancy. In order to improve the effectiveness as well as reduce the cost of software testing, the test suite should be optimized. Based on quotient space theory, an optimization algorithm for test suite generation is proposed:using the relationship between the testing requirements, the attribute projection method of the quotient space theory is used to decompose the test suite,then the attribute synthesis method of the quotient space theory is used to synthesize the quotient sets of test suite after decomposition, meanwhile the semi-ordered structure is used to describe the relationship of the subsets of test suite,and through the simple selection from the synthesized result, an optimiza- tion test suite can be acquired later. First validating the present algorithm with the theoretical proof method, then simulating reduction effects of the present algorithm under different conditions, its advantages on testing suite reduction is testified. Moreover, two factors which impact the effectiveness of reduction are concluded.
出处 《小型微型计算机系统》 CSCD 北大核心 2016年第9期1937-1941,共5页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(61402005)资助 安徽省自然科学基金项目(1408085MF122)资助 安徽大学青年骨干教师培养项目(02303301)资助 安徽大学优秀青年基金项目(02303305)资助
关键词 测试用例集约简 商空间 优化测试用例集 属性分解 属性合成 半序结构 test suite reduction quotient space optimization test suite attribute decomposition attribute synthesis semi-ordered structure
  • 相关文献

参考文献13

  • 1Chvatal V. A greedy heuristic for the set-covering problem [ J ]. Mathematics of Operations Research, 1979,4 ( 3 ) :233-235.
  • 2Chen T Y ,Lau M F. On the divide-and-conquer approach towards test suite reduction[ J]. Journal of Information Sciences ,2003,152 (1) :89-119.
  • 3Harrold M J, Gupta R, Sofia M L. A methodology for controlling the size of a test suite [ J ]. ACM Transactions on Software Engi- neering and Methodology, 1993,2 (3) :270-285.
  • 4Mansour N,Fakin K E. Simulated annealing and genetic algorithms for optimal regression testing[ J]. Journal of Software Maintenance: Research and Practice, 1999,11 ( 1 ) : 19-34.
  • 5Zhong Hao, Zhang Lu, Me Hong. An experimental comparison of four test suite reduction techniques [ C ]. Proceeding of the 28th In- ternational Conference on Software Engineering ,2006:636-640.
  • 6Lee J G, Chtmg C G. An optimal representative set selection method [ J]. Information and Software Technology ,2000,42( 1 ) :17-25.
  • 7章晓芳,徐宝文,聂长海,史亮.一种基于测试需求约简的测试用例集优化方法[J].软件学报,2007,18(4):821-831. 被引量:59
  • 8聂长海,徐宝文.一种最小测试用例集生成方法[J].计算机学报,2003,26(12):1690-1695. 被引量:57
  • 9Zhang Ling,Zhang Bo. The theory and applications of problem sol- ving-quotient space based granular computing [ M ]. Tsinghua Uni- versity Press, 2007.
  • 10. Beszedes A, Tengeri D, Siket I. Test suite reduction for fault detec- tion and localization:a combined approach [ C ]. IEEE Conference on Software Maintenance, Reengineering and Reverse Engineering (CSMR-WCRE) ,IEEE Press,2014:204-213.

二级参考文献15

  • 1徐宝文,聂长海,史亮,陈火旺.一种基于组合测试的软件故障调试方法[J].计算机学报,2006,29(1):132-138. 被引量:38
  • 2[1]Chen T Y,Lau M F. A new heuristic for test suite reduction.Information and Software Technology, 1998, 40(5/6) : 347~354
  • 3[2]Chen T Y, Lau M F. A simulation study on some heuristics for test suite reduction. Information and Software Technology,1998, 40(13): 777~787
  • 4[3]Lee J G, Chung C G. An optimal representative set selection method. Information and Software Technology, 2000, 42 (1):17~25
  • 5[4]Chen T Y,Lau M F. Dividing strategies for the optimization of a test suite. Information Processing Letters, 1996, 60(3): 135~141
  • 6[5]Johnson D S. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 1974, 9(3): 256~278
  • 7[6]Harrold M J,Gupta R,Soffa M L. A methodology for controlling the size of a test suite. ACM Transactions on Software Engineering and Methodology, 1993, 2(3): 270~285
  • 8[7]Chen T Y,Lau M F. Heuristics towards the optimization of the size of a test suite. In: Proceedings of the 3rd International Conference on Software Quality Management, Seville, Espagne, 1995, 2:415~424
  • 9[8]Jones J A, Harrold M J. Test-suite reduction and prioritization for modified condition/decision coverage. In: Proceedings of ICSM'01, Florence, Italy, 2001, 11:92~102
  • 10[9]Wong W E, Horgan J R, London S et al. Effect of test set minimization on fault detection effectiveness. In: Proceeding of the 17th International Conference on Software Engineering, Seattle, Washington DC, 1995. 41~50

共引文献101

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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