基于圈复杂度的静态测试用例排序方法  

STATIC TEST CASES SORTING METHOD BASED ON CYCLOMATIC COMPLEXITY

作　　者：陈梦云[1] 高建华[1] 

机构地区：[1]上海师范大学信息与机电工程学院,上海200234

出　　处：《计算机应用与软件》2016年第1期1-3,15,共4页Computer Applications and Software

基　　金：国家自然科学基金项目(61073163);上海市引进技术的吸收与创新年度计划项目(12CH-19);上海市企业自主创新专项资金项目(沪CXY-2013-88)

摘　　要：针对如何排列测试用例的问题,提出一种基于圈复杂度的静态测试用例排序方法。首先介绍圈复杂度和基于方法覆盖的测试用例排序算法;然后将圈复杂度应用到排序算法中,设计了两种新的排序算法;最后通过实验,检测改进方法在错误检测方面的有效性。实验结果表明,与已有的几种优先级技术对比,上述改进方法能够达到更高的错误检测效率,有利于提高测试效率。For the problem of how to collocate test eases, in this paper we propose a cyclomatic complexity-based static test cases sorting method. We first introduce the cyelomatie complexity and the method coverage-based test cases sorting algorithm ; and then we design two new sorting algorithms by applying the cyclomatie complexity to sorting algorithm; At last, through an experiment we test the validity of the improved approach in fault detection. Experimental result shows that compared with other existing priority techniques, this improved method is able to achieve higher fault detection efficiency and is conducive to improving test efficiency.

关 键 词：测试用例排序 圈复杂度 排序算法 错误检测效率 

分 类 号：TP311.5[自动化与计算机技术—计算机软件与理论]