­Automated Generation of Covering Array Using Gravitational Search Algorithm and Biogeography Based Optimization

Author:

Esfandyari Sajad1,Yousofvand liela2,Rafe Vahid2,Pira Einollah3

Affiliation:

1. Malayer University

2. Arak University

3. Azarbaijan Shahid Madani University

Abstract

Abstract The utilization of combinatorial testing methodologies in software development has become widespread, necessitating the development of efficient strategies for creating high-quality test suites. Covering Array (CA) has emerged as a key component of combinatorial testing, offering various types to fulfill diverse testing requirements. Several strategies have been introduced for generating CAs, each with its own strengths and weaknesses in terms of performance and efficiency. However, there is still a gap in the existence of a strategy that effectively addresses both aspects simultaneously. Moreover, manually collecting software information increases the likelihood of errors and presents challenges due to the complexity of extracting relevant data. To tackle these challenges, this study employs the GROOVE model checker to automate the extraction of variables and their interactions within the software. By adapting the Gravitational Search Algorithm (GSA) and Biogeography Based Optimization (BBO), an optimal test suite is generated with enhanced efficiency. The primary objective of this paper is to develop a software model using the GROOVE model checker and utilize its capabilities to extract essential software information. The proposed methodology utilizes GSA and BBO to create CAs with both uniform and variable strength. Additionally, a mechanism is introduced to expedite search operations within data structures. To assess the efficacy of the proposed approach, it is implemented within the GROOVE environment, alongside various other meta-heuristic algorithms. Furthermore, the proposed algorithm is also externally implemented for comparison with existing strategies. The evaluation results indicate that the proposed solution surpasses other strategies in terms of efficiency and performance.

Publisher

Research Square Platform LLC

Reference49 articles.

1. A Discrete Particle Swarm Optimization for Covering Array Generation;Wu H;IEEE Transactions on Evolutionary Computation,2015

2. A tuned version of genetic algorithm for efficient test suite generation in interactive t-way testing strategy;Esfandyari S;Information and Software Technology,2018

3. Garvin, B. J., Cohen, M. B., & Dwyer, M. B. (2009). "An improved metaheuristic search for constrained interaction testing," in 1st International Symposium on Search Based Software Engineering, Windsor, UK.

4. Lin, J., Luo, C., Cai, S., Su, K., Hao, D., & Zhang, L. (2015). "TCA: An Efficient Two-Mode Meta-Heuristic Algorithm for Combinatorial Test Generation (T)," in 30th IEEE/ACM International Conference on Automated Software Engineering (ASE), 9–13 Nov., Lincoln, NE, USA.

5. Nie, C., & Leung, H. (2011). "A survey of combinatorial testing," CM Comput. Surv., vol. 43, no. 2, pp. 11.1-11.29.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3