Evolutionary Generation of Test Data for Path Coverage Based on Automatic Reduction of Search Space

ZHANG Yan; GONG Dun-wei

doi:10.3969/j.issn.0372-2112.2012.05.024

您当前的位置：

首页 >

文章列表页 >

Evolutionary Generation of Test Data for Path Coverage Based on Automatic Reduction of Search Space

更新时间：2025-07-16

- Evolutionary Generation of Test Data for Path Coverage Based on Automatic Reduction of Search Space
- Acta Electronica Sinica Vol. 40, Issue 5, Pages: 1011-1016(2012)
- 作者机构：
  
  1. 中国矿业大学信息与电气工程学院,江苏,徐州,221116
  2. 牡丹江师范学院计算机科学与技术系,黑龙江,牡丹江,157012
  3. 中国矿业大学信息与电气工程学院,江苏,徐州,221116
  4. 牡丹江师范学院计算机科学与技术系,黑龙江,牡丹江,157012
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2012.05.024
  CLC： TP301
- Published：2012
- 稿件说明：
移动端阅览
ZHANG Yan, GONG Dun-wei. Evolutionary Generation of Test Data for Path Coverage Based on Automatic Reduction of Search Space[J]. Acta Electronica Sinica, 2012, 40(5): 1011-1016.
DOI：

ZHANG Yan, GONG Dun-wei. Evolutionary Generation of Test Data for Path Coverage Based on Automatic Reduction of Search Space[J]. Acta Electronica Sinica, 2012, 40(5): 1011-1016. DOI： 10.3969/j.issn.0372-2112.2012.05.024.

摘要

提出一种基于搜索空间自动缩减的路径覆盖测试数据进化生成方法

首先

确定目标路径与输入变量之间的关系

将可分目标路径分离出与部分分量相关的子路径;然后

固定被穿越子路径对应的输入分量

并缩小交叉和变异操作的范围

使种群在不断缩小的空间里寻找测试数据

以提高测试数据生成的效率;最后

将提出的方法用于基准程序的路径覆盖测试数据生成

并与传统方法和随机法比较.结果表明

本文方法在生成测试数据需要的进化代数、运行时间和成功率等指标上均具有优越性.

Abstract

A method of evolutionarily generating test data for path coverage based on automatic reduction of search space is presented in this study.First

the relation between the target path and the input variable is determined

and the divisible target path is divided into some sub-paths related to several elements of the input variable.Then

the elements corresponding to the traversed sub-path are fixed

and the range of crossover and mutation operations is reduced

therefore the original population searches for test data in a reduced space so that the efficiency of generating test data is improved.Finally

the proposed method is applied to generate test data for covering paths of a benchmark program

and compared with the traditional and random ones.The experimental results confirm that the proposed method is advantageous in the number of generations

time consumption and success rate.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Novel Evolutionary Generation Approach to Test Data for Multiple Paths Coverage

Evolutionary Generation of Test Data for Paths Coverage Based on Balance Optimization Theory

Test Data Generation Based on Automatic Division of Path

Test Data Generation of Path Coverage Based on Negative Selection Genetic Algorithm

The Testing and Repairing Methods for Machine Learning Model Security

Related Author

FONT face

Verdana

GONG Dun-wei

ZHANG Yan

FONT

FAN Shu-ping

ZHANG Yan

MA Bao-ying

Related Institution

1. School of Information and Electrical Engineering, China University of Mining and Technology

School of Computer and Information Technology, Mudanjiang Normal University

School of Health Management, Mudanjiang Medical University

Department of Intelligence and Computing, Tianjin University

School of Computer Science and Technology, Dalian University of Technology

⁰