.png){kind=icon}
返回
Automated test case generation based on differential evolution with node branch archive
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2021.107290.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Automatic test case generation (ATCG) is the active research topic in software testing engineering, which can greatly reduce the cost of software testing. In automated test case generation for path coverage (ATCG-PC) problem, since the relationship between test cases and paths is unknown, there are many redundant test cases in the test case set to meet the path coverage criteria. In many previous studies on search-based algorithms for ATCG-PC, researchers have focused on improving the search-based algorithms itself or designing a more suitable fitness function according to the coverage criteria. However, the relationship between test cases and paths can help search-based algorithms cover more paths. The values of some specific test case dimensions change, and offspring individuals may cover different paths. Inspired by this, we proposed a node branch archive strategy, which can record the relationship between node branch direction and the value of test case variables, and cover more paths through this driven search-based algorithms. The experimental results show that compared with other state-of-the-art algorithms, the differential evolution with node branch archive (NBAr-DE) can significantly reduce the number of redundant test cases.
Keyword:
Automated test case generation
Search-based algorithms
Differential evolution
Path coverage
Node branch archive
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
分享收藏Optimization of software components selection for component-based software system development基于构件的软件系统开发中软件构件选择的优化
PREAI
分享收藏Scheduling sequence selection for generating test data to cover paths of MPI programs用于生成测试数据以覆盖MPI程序路径的调度序列选择
PREAI
分享收藏
查看更多内容