Automatic Web-Based Software Structural Testing Using an Adaptive Particle Swarm Optimization Algorithm for Test Data Generation

A. Damia, M. Esnaashari, Mohammadreza Parvizimosaed
{"title":"Automatic Web-Based Software Structural Testing Using an Adaptive Particle Swarm Optimization Algorithm for Test Data Generation","authors":"A. Damia, M. Esnaashari, Mohammadreza Parvizimosaed","doi":"10.1109/ICWR51868.2021.9443153","DOIUrl":null,"url":null,"abstract":"The purpose of a software test is to search for a set of test data in a search space to satisfy a specific coverage criterion. Therefore, finding an effective way to automatically generate this data is an important issue in software testing. This is especially crucial for web-based software, where the size of the program is large, and automatic test-case generation is of prominence. In this paper, a novel method of particle swarm optimization algorithm (PSO) for automatic generation of test data is presented, for web-based software. PSO algorithm has several weaknesses. In this algorithm, there is a possibility of particles to be trapped in local optima. Although PSO is quite rapid compared to other evolutionary algorithms, it usually cannot improve the quality of the solution achieved by increasing iterations. One reason is that in this algorithm, particles converge to a specific point between the best general position and the best personal position. Due to this weakness, a change in PSO has been given in this paper. This is an inertial weight change. In general, in this paper, the inertia weight is dynamically calculated in each round of the algorithm according to the fitness of each particle . Experiments have been performed on different programs and the results of experiments have shown that the proposed method (AIWPSO) has better convergence rate than several methods performed by other variants of the PSO.","PeriodicalId":377597,"journal":{"name":"2021 7th International Conference on Web Research (ICWR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 7th International Conference on Web Research (ICWR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWR51868.2021.9443153","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

The purpose of a software test is to search for a set of test data in a search space to satisfy a specific coverage criterion. Therefore, finding an effective way to automatically generate this data is an important issue in software testing. This is especially crucial for web-based software, where the size of the program is large, and automatic test-case generation is of prominence. In this paper, a novel method of particle swarm optimization algorithm (PSO) for automatic generation of test data is presented, for web-based software. PSO algorithm has several weaknesses. In this algorithm, there is a possibility of particles to be trapped in local optima. Although PSO is quite rapid compared to other evolutionary algorithms, it usually cannot improve the quality of the solution achieved by increasing iterations. One reason is that in this algorithm, particles converge to a specific point between the best general position and the best personal position. Due to this weakness, a change in PSO has been given in this paper. This is an inertial weight change. In general, in this paper, the inertia weight is dynamically calculated in each round of the algorithm according to the fitness of each particle . Experiments have been performed on different programs and the results of experiments have shown that the proposed method (AIWPSO) has better convergence rate than several methods performed by other variants of the PSO.
基于自适应粒子群算法的基于web的软件结构自动测试
软件测试的目的是在搜索空间中搜索一组测试数据,以满足特定的覆盖标准。因此,寻找一种有效的方法来自动生成这些数据是软件测试中的一个重要问题。这对于基于web的软件尤其重要,因为程序的规模很大,并且自动生成测试用例非常重要。本文提出了一种基于网络的测试数据自动生成的粒子群优化算法(PSO)。粒子群算法有几个缺点。该算法存在粒子被困在局部最优的可能性。虽然粒子群算法与其他进化算法相比速度相当快,但通常不能通过增加迭代来提高解的质量。一个原因是,在该算法中,粒子收敛到最佳一般位置和最佳个人位置之间的一个特定点。由于这个缺点,本文给出了PSO的一个变化。这是惯性重量变化。一般来说,本文根据每个粒子的适应度,在算法的每一轮中动态计算惯性权值。在不同的程序上进行了实验,实验结果表明,所提出的方法(AIWPSO)比其他PSO变体的几种方法具有更好的收敛速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信