一种基本路径集求解算法  

AN ALGORITHM FOR SOLVING BASIC PATH SET

作　　者：王敏[1] 陈少敏[1] 陈亚光[2] 

机构地区：[1]武昌理工学院信息工程学院,湖北武汉430223 [2]中南民族大学生物医学工程学院,湖北武汉430074

出　　处：《计算机应用与软件》2014年第11期11-14,57,共5页Computer Applications and Software

基　　金：国家自然科学基金项目(61072075)

摘　　要：McCabe提出的基本路径测试法被认为是动态白盒测试方法中严谨而有效的测试方法。如何提高基本路径测试的效率是人们一直在探索的问题。为此,从被测程序的基本结构出发,提出一种基于组合的基本路径求解算法。该算法首先创建一种基于Z路径覆盖的基本单元图;然后建立由基本单元图组合形成控制流图的组合规则;以此为基础,提出基本路径组合算法。该算法只需一次扫描程序得到程序基本结构的路径集,然后将这些路径进行组合生成被测程序的基本路径集。The basic path testing method presented by Mc Cabe is considered as a rigorous and effective testing method in dynamic whitebox testing methods.How to improve the efficiency of the basic path testing is always an issue explored by the people.Therefore,proceeding from the basic structure of the program to be tested,we propose a combination-based algorithm for solving the basic path set.The algorithm first creates a Z-path coverage-based basic unit chart.Then it sets up the combination rules for forming the control flow graph by combining the basic unit charts.On this basis,we propose the combination algorithm of basic path.The algorithm obtains the path set of the basic structure of program by scanning the program only once,and then combines these paths to generate the basic path set of the program to be tested.

关 键 词：基本单元 基本路径测试 基本路径集 自动化测试 白盒测试 

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