首页> 外文会议>2015 International Conference on Futuristic trend on Computational Analysis and Knowledge Management >A path and branch based approach to fitness computation for program test data generation using genetic algorithm
【24h】

A path and branch based approach to fitness computation for program test data generation using genetic algorithm

机译:基于路径和分支的适应度计算方法,用于使用遗传算法生成程序测试数据

获取原文
获取原文并翻译 | 示例

摘要

In this paper we present a novel approach for fitness computation for test data generation using genetic algorithm. Fitness computation is a two-step process. In the first step a target node sequence is determined and in the second step the actual execution path is compared with the target node sequence to compute fitness. Fitness computation uses both branch and path information. Experiments indicate that the described fitness technique results in significant improvement in search performance.
机译:在本文中,我们提出了一种新的适合度计算方法,用于使用遗传算法生成测试数据。适应度计算是一个两步过程。在第一步中,确定目标节点序列,在第二步中,将实际执行路径与目标节点序列进行比较,以计算适合度。适应度计算使用分支和路径信息。实验表明,所描述的适应性技术可显着改善搜索性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号