返回
Using likely invariants for test data generation
DOI:10.1016/j.jss.2020.110549.png)
摘要
En 中文
Various approaches have been developed to tackle the problem of automatic test data generation. Among them search-based methods use metaheuristic algorithms to guide search in the input space of the program under test. This paper presents a new approach for improving search-based test data generation methods. This approach is based on learning the relationships between program input values and program parts covered by those values. The learned relationships are used to accelerate achieving test coverage goals. We introduce the concepts of branch likely invariant and path likely invariant as the basis for the learning method. In addition, we utilize simple predicates (based on some predefined templates) over program input variables to generate better initial candidate solutions, and use the mutation of the mentioned predicates to cover unexplored program parts. The current version of the proposed approach only considers numeric and string input parameters. To evaluate the performance of the proposed approach, a series of experiments have been carried out on a number of different benchmark programs. Through experiments and analysis, we show that the proposed approach enhances the effectiveness of common search-based test data generation methods, in terms of the coverage percentage. (C) 2020 Published by Elsevier Inc.
Keyword:
Search-based test data generation
Metaheuristic algorithms
Branch likely invariants
Path likely invariants
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.4K
被引数:
8.4K
机构
引用论文
Analysis and Modeling of HVSR in the Presence of a Velocity Inversion: The Case of Venosa, Italy存在速度反演的HVSR的分析和建模: 意大利Venosa的情况
1600 faults in 100 projects: automatically finding faults while achieving high coverage with EvoSuite1600 100项目中的故障: 在使用EvoSuite实现高覆盖率的同时自动查找故障

