| 摘要: |
| 路径覆盖是软件测试领域重要的测试方法之一.为了提高路径覆盖测试效率,在采用遗传算法进化生成路径覆盖的测试数据过程中,利用被测程序条件语句的相关性判定不可达路径,除路径中必经节点外,其他节点在不可达路径中出现的概率越大,穿越该节点的个体就具有越高的穿越度,在进化过程中应得到保护.提出了根据个体的穿越度设计适应度函数方法,从而提高测试数据的生成效率.将所提方法应用于基准程序和工业用例,并与同类方法比较可知,该方法生成路径覆盖的测试数据具有较高的效率. |
| 关键词: 软件测试 路径覆盖 遗传算法 不可达路径 穿越度 |
| DOI：10.13328/j.cnki.jos.004967 |
| 分类号: |
| 基金项目:国家自然科学基金(61573362);牡丹江师范学院博士科研启动基金(MNUB201414);牡丹江师范学院科研项目(QN201601,QY2014001) |
|
| Evolutionary Generation of Test Data for Paths Coverage Based on Node Probability |
|
XIA Chun-Yan, ZHANG Yan, SONG Li
|
|
School of Technoloty, Mudanjiang Normal University, Mudanjiang 157011, China
|
| Abstract: |
| Path coverage testing is one of the most important software testing methods. This paper presents a process of using genetic algorithms to generate path coverage test data. When an individual traverses the node that might be contained in the unteachable paths(which are determined based on the correlation of conditional statements), the higher the probability the node exists in the unreachable paths, the higher degree of traversing the individual has; and, the individual with higher degree of traversing should be protected. The fitness function of genetic algorithms is designed based on the individual traversing degree, so the efficiency of generating test data is improved. The proposed method is applied to benchmark and industrial programs, and is compared with other methods. The experimental results show that the proposed method is efficient in generating test data for path coverage. |
| Key words: software testing path coverage genetic algorithm unreachable path traversing degree |
