基本路径测试算法的改进与应用  

The Application of Improved Algorithm in Basis Path Test

作　　者：钱丽[1] 万家华[1] 陈秀明[1] 周园园[1] 

机构地区：[1]安徽新华学院,合肥230088

出　　处：《长春理工大学学报（自然科学版）》2016年第1期107-111,共5页Journal of Changchun University of Science and Technology(Natural Science Edition)

基　　金：安徽省教育厅自然科学基金重点项目(KJ2014A100;KJ2015A300)

摘　　要：基本路径测试是白盒测试技术的一种重要方法,Mc Cabe方法作为基本路径测试中较为常用的方法之一,存在测试用例设计效率较低、可操作性不强等问题。针对这些问题,研究提出了基于Mc Cabe方法的改进堆栈算法,该算法能够自动识别被测程序的基本图元结构,算出被测程序的基本路径数,并且输出基本路径集。该路径算法比Mc Cabe方法构造过程简洁,可操作性较强,能够有效提高基本路径测试用例设计的效率。McCabe＇s basic path testing is an important testing method in dynamic white-box testing techniques, but it exists the problem that the efficiency of McCabe method is lower and the operability is weak. To solve this problem, this paper proposed an algorithm to design basic path test base on McCabe method.Firstly, the algorithm treats a basic unit chart based on the path coverage.Secondly, the program path number can be recognized automaticaly by the algorithm, and then the basic path collection can be output. The improved algorithm is better than McCabe method, because its construction process is simple and operability is strong, it can improve the efficiency of the basic path test case design.

关 键 词：基本路径测试 白盒测试 McCabe方法 堆栈算法 

分 类 号：TP309.2[自动化与计算机技术—计算机系统结构]