4.4 Article

Automatic PSO Based Path Generation Technique for Data Flow Coverage

期刊

INTELLIGENT AUTOMATION AND SOFT COMPUTING
卷 29, 期 1, 页码 147-164

出版社

TECH SCIENCE PRESS
DOI: 10.32604/iasc.2021.015708

关键词

Data flow testing; genetic algorithm; path testing; particle swarm optimization

资金

  1. Taif University Researchers Supporting Project (TURSP), Taif University, Taif, Saudi Arabia [TURSP2020/73]

向作者/读者索取更多资源

Path-based testing involves finding all paths throughout the code under test and creating a test suite to cover these paths. A new technique presented in this paper utilizes Particle Swarm Optimization to generate a set of paths satisfying a given criterion, showing better efficiency compared to a genetic algorithm in an empirical study.
Path-based testing involves two main steps: 1) finding all paths throughout the code under test; 2) creating a test suite to cover these paths. Unfortunately, covering all paths in the code under test is impossible. Path-based testing could be achieved by targeting a subset of all feasible paths that satisfy a given testing criterion. Then, a test suite is created to execute this paths subset. Generating those paths is a key problem in path testing. In this paper, a new path testing technique is presented. This technique employs Particle Swarm Optimization (PSO) for generating a set of paths to satisfy the all-uses criterion. To construct such paths for programs with loops, the proposed technique applies the ZOT-criterion. This criterion selects paths that traverse loops 0, 1, and 2 times. The proposed technique utilizes the decision-decision graph of the program under test to represent the position vector of the particle. To evaluate the efficiency of the presented technique, an empirical study has been conducted, which included 15 C# programs. In this study, the proposed technique has been compared with a genetic algorithm (GA)-based one. The results showed that the PSO required 199 generations, while the GA required 349 generations, to satisfy all def-use paths of all programs. In addition, the proposed technique required a smaller number of paths than the GA-based one.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.4
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据