Optimized Test Case Generation for Basis Path Testing using Improved Fitness Function with PSO

Updesh Jaiswal, Amarjeet Prajapati
{"title":"Optimized Test Case Generation for Basis Path Testing using Improved Fitness Function with PSO","authors":"Updesh Jaiswal, Amarjeet Prajapati","doi":"10.1145/3474124.3474197","DOIUrl":null,"url":null,"abstract":"The generation of an optimal number of test cases for the Basis path testing is a crucial and challenging optimization problem in the field of software testing. In the literature, a variety of Basis path testing approaches have been proposed. Recently, the search-based optimization approaches for the Basis path testing have been found more effective compared to the traditional analytical based approaches of Basis path testing. Even the existing search-based Basis path testing approaches can generate effective test cases covering most of the paths, still, there are many paths are remained uncovered. In this work, we propose a Particle Swarm Optimization (PSO) based test case selection approach for the Basis path testing. In this contribution, we introduce an improved fitness function namely Improved Fitness Function (IFF) that can guide the PSO based optimization process towards selection of best test case. For this, we use a High Probability of Coverage (HPC) path to define the IFF. To demonstrate our proposed approach, we conducted a detailed case study over the Largest among Three Numbers (LTN) program. The results of our case study show that the proposed approach can produce more better results in terms of all linearly independent paths coverage of Control Flow Graph (CFG).","PeriodicalId":144611,"journal":{"name":"2021 Thirteenth International Conference on Contemporary Computing (IC3-2021)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 Thirteenth International Conference on Contemporary Computing (IC3-2021)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3474124.3474197","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The generation of an optimal number of test cases for the Basis path testing is a crucial and challenging optimization problem in the field of software testing. In the literature, a variety of Basis path testing approaches have been proposed. Recently, the search-based optimization approaches for the Basis path testing have been found more effective compared to the traditional analytical based approaches of Basis path testing. Even the existing search-based Basis path testing approaches can generate effective test cases covering most of the paths, still, there are many paths are remained uncovered. In this work, we propose a Particle Swarm Optimization (PSO) based test case selection approach for the Basis path testing. In this contribution, we introduce an improved fitness function namely Improved Fitness Function (IFF) that can guide the PSO based optimization process towards selection of best test case. For this, we use a High Probability of Coverage (HPC) path to define the IFF. To demonstrate our proposed approach, we conducted a detailed case study over the Largest among Three Numbers (LTN) program. The results of our case study show that the proposed approach can produce more better results in terms of all linearly independent paths coverage of Control Flow Graph (CFG).
基于改进适应度函数的PSO优化基路径测试用例生成
在软件测试领域中,为Basis路径测试生成最优数量的测试用例是一个关键且具有挑战性的优化问题。在文献中,已经提出了各种各样的基路径测试方法。近年来,人们发现基于搜索的优化方法比传统的基于分析的优化方法更有效。即使现有的基于搜索的基路径测试方法可以生成覆盖大多数路径的有效测试用例,但是仍有许多路径未被发现。在这项工作中,我们提出了一种基于粒子群优化(PSO)的基路径测试用例选择方法。在这篇贡献中,我们引入了一个改进的适应度函数,即改进适应度函数(IFF),它可以指导基于粒子群算法的优化过程选择最佳测试用例。为此,我们使用高覆盖概率(HPC)路径来定义敌我识别。为了证明我们提出的方法,我们对三数中最大(LTN)计划进行了详细的案例研究。实例研究结果表明,该方法在控制流图(CFG)的所有线性无关路径覆盖方面可以得到更好的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信