期刊文献+

测试用例集启发式约简算法分析与评价 被引量:8

Analysis and Evaluation of Heuristic Algorithms for Test Suite Reduction
下载PDF
导出
摘要 在软件开发和维护过程中,为了提高对源程序变更部分的信心并且保证源程序变更部分没有对未变更部分造成负面影响,需要对软件系统进行回归测试。回归测试是一个昂贵的测试过程。测试用例集约简算法是在仍然满足测试准则的前提下,通过删除所有冗余测试用例得到测试用例集的最小约简测试用例集,用以优化回归测试过程。综述了文献中主要的测试用例集启发式约简算法,通过统一的框架和术语定义了这些算法,分析和比较了这些算法的效率和优劣,指出了未来进一步研究的方向。 During the development and maintenance of modified parts of software and guarantee no side effeet software,regression testing is used to enhance confidence to the to the existing parts of software. Regression testing is an expen- sive process. Test suite reduction algorithm removes all redundant test cases among the test suite to get a minimal sub- set of test suite that still satisfy test criterion. This paper surveyed the most important heuristic algorithms for test suite reduction in the literature and used a unify framework and terminologies to define and analyze different algorithms. Typi- cal heuristic algorithms for test suite reduction were analyzed and compared. The future work was presented.
作者 游亮 卢炎生
出处 《计算机科学》 CSCD 北大核心 2011年第12期147-150,177,共5页 Computer Science
基金 国家部委预研基金项目(513150601)资助
关键词 软件测试 软件维护 回归测试 测试用例集约简 测试用例集最小化 Software testing, Software maintenance, Regression testing, Test suite reduction, Test suite minimization
  • 相关文献

参考文献13

  • 1Harrold M J, Orso A. Retesting software during development and maintenance [C]//Frontiers of Software Maintenance. Beijing, China: IEEE, 2008 : 99- 108.
  • 2Harrold M J. Reduce, reuse, recycle, recover: Techniques for improved regression testing [C]//IEEE International Conference on Software Maintenance(ICSM 2009). Alberta, Canada: IEEE, 2009 : 5-5.
  • 3Rothermel G, Elbaum S, Malishevsky A G, et al. On test suite composition and cost-effective regression testing [J].ACM Trans. Softw. Eng. Methodol,2004,13(3):277- 331.
  • 4Jeffrey D,Gupta N. Improving Fault Detection Capability by Selectively Retaining Test Cases During Test Suite Reduction[J].IEEE Transactions on Software Engineering,2007,38(2) :108-123.
  • 5Li Z, Harman M, Hierons R M. Search Algorithms for Regression Test Case Prioritization[J]. IEEE Transactions on Software Engineering, 2007,33 (4) : 225-237.
  • 6Garey M R, Johnson D S. Computers and Intractability.. A Guide to the Theory of NP-Completeness [M]. New York.. W. H. Freeman & Co,1979.
  • 7Chvatal V. A Greedy Heuristic for the Set-Covering Problem [J]. Mathematics of Operations Research,1979,4(3):233-235.
  • 8Harrold M J, Gupta R, Sofia M L. A methodology for controlling the size of a test suite[J].ACM Trans. Softw. Eng. Methodol, 1993,2(3) : 270-285.
  • 9Chen T Y, Lau M K A new heuristic for test Suite reduction[J]. Information and Software Technology, 1998,40(5/6):347-354.
  • 10Agrawal H. Dominators, super blocks, and program coverage [C] // Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming anguages. Portland, Oregon, United States: ACM, 1994 : 25-34.

同被引文献70

引证文献8

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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