تولید دنباله آزمون کمینه با ترکیب الگوریتم های جستجوی گرانشی و شاهین هریس
سجاد اسفندیاری
1
(
گروه مهندسی کامپیوتر، دانشکده فنی و مهندسی دانشگاه ملایر، ملایر، ایران
)
داور گیوکی
2
(
گروه مهندسی کامپیوتر، دانشکده فنی و مهندسی دانشگاه ملایر، ملایر، ایران
)
لیلا یوسفوند
3
(
گروه مهندسی کامپیوتر، دانشکده فنی و مهندسی دانشگاه لرستان، خرم آباد، ایران
)
عین الله پیرا
4
(
دانشکده فناوری اطلاعات و مهندسی کامپیوتر، دانشگاه شهید مدنی آذربایجان، تبریز، ایران
)
کلید واژه: آزمون ترکیبی, آرایه پوشش, الگوریتم جستجوی گرانشی, الگوریتم شاهین هریس.,
چکیده مقاله :
در حال حاضر، استفاده از آزمون ترکیبی در نرم‌افزارهای مدرن امری ضروری برای توسعه نرم‌افزارها به شمار می‌رود. آزمون ترکیبی یا آزمون t-way به عنوان یک راهکار کارآمد برای کاهش حجم مجموعه آزمون شناخته شده است، به گونه‌ای که امکان آزمون نرم‌افزار با تعداد نمونه‌های کمتر فراهم می¬کند. پوشش آرایه یکی از جنبه‌های حیاتی در آزمون ترکیبی محسوب می‌شود که رویکردهای مختلفی برای تولید آن ارائه شده است. این روش‌ها اغلب دارای کارایی (سرعت) و بهره‌وری (اندازه آرایه) قابل قبولی هستند، اما کمبود یک روش که هر دو خصوصیت کارایی و بهره‌وری را به طور همزمان داشته باشد، مشهود است. در این پژوهش، با استفاده از الگوریتم جستجوی گرانشی و ترکیب آن با الگوریتم شاهین هریس، مجموعه آزمون بهینه با حداقل تعداد نمونه آزمون و کارایی بالا پدید آمده است. علاوه بر این، این رویکرد قابلیت تولید مجموعه آزمون برای پیکربندی‌های با توان بالا را نیز دارا می‌باشد. ارزیابی نتایج نشان می‌دهد که روش پیشنهادی از نظر کارایی و بهره‌وری بسیار مناسب و قدرتمند است.
چکیده انگلیسی :
Nowadays, combinatorial testing has become essential for the development of modern software systems. Combinatorial testing, also known as t-way testing, is recognized as an efficient approach to reducing the size of a test suite, enabling software testing with a smaller number of test cases. Covering arrays are a crucial component of combinatorial testing, and various approaches have been proposed for their generation. These methods often achieve acceptable performance in terms of efficiency (generation speed) and effectiveness (array size); however, there remains a need for an approach that simultaneously achieves high efficiency and effectiveness. In this study, a hybrid approach is proposed by combining the Gravitational Search Algorithm (GSA) with the Harris Hawks Optimization (HHO) algorithm to generate an optimized test suite with a minimum number of test cases and high computational efficiency. Furthermore, the proposed approach is capable of generating test suites for configurations with high interaction strengths. The evaluation results demonstrate that the proposed method performs effectively and efficiently, offering a powerful solution for combinatorial test generation.
[1] Z. Abbasi, S. Esfandyari and V. Rafe, "Covering array generation using teaching learning base optimization algorithm," Tabriz Journal of Electrical Engineering, vol. 48, no. 1, pp. 161-171, May 2018.
[2] S. Esfandyari and V. Rafe, "A hybrid solution for software testing to minimum test suite generation using hill climbing and bat search algorithms," Tabriz Journal of Electrical Engineering, vol. 46, no. 3, pp. 25-35, Nov. 2016.
[3] E. Pira, V. Rafe and S. Esfandyari, "A three-phase approach to improve the functionality of t-way strategy," Soft Computing, vol. 28, pp. 415-435, 2023.
[4] H. Wu, C. Nie, F.-C. Kuo, H. Leung and C. J. Colbourn, "A discrete particle swarm optimization for covering array generation," IEEE Trans. on Evolutionary Computation, vol. 19, no. 4, pp. 575-591, Aug. 2015.
[5] S. Esfandyari and V. Rafe, "A tuned version of genetic algorithm for efficient test suite generation in interactive t-way testing strategy," Information and Software Technology, vol. 94, pp. 165-185, Feb. 2018.
[6] E. Pira and M. Khodizadeh-Nahari, "Combinatorial t-way test suite generation using an improved asexual reproduction optimization algorithm," Applied Soft Computing, vol. 150, Article ID: 111070, Jan. 2024.
[7] S. Esfandyari and V. Rafe, "Extracting combinatorial test parameters and their values using model checking and evolutionary algorithms," Applied Soft Computing, vol. 91, Article ID: 106219, Jun. 2020.
[8] س. اسفندیاری و و. رافع، "استفاده از الگوریتم تودۀ ذرات بهینه در تولید دنبالۀ آزمون کمینه در آرایۀ پوشش با قوۀ ثابت،" مجله محاسبات نرم، جلد ۸، شماره ۲، صص. 79ـ66، پاییز و زمستان 1398.
[9] M. Farokhian, J. Shoaei and S. Esfandyari, "GWC: A tool for automatic web data extraction," in Proc. 13th Symp. on Advances in Science and Technology: Sustainable Land of Computer and Information Technology, pp.43831-43848, Mashhad, Iran, 18-18 Dec. 2018.
[10] E. Pira, V. Rafe and S. Esfandyari, "Minimum covering array generation using success-history and linear population size reduction based adaptive differential evolution algorithm," Tabriz Journal of Electrical Engineering, vol. 52, no. 2, pp. 77-89, Jul. 2022.
[11] E. Rashedi, H. Nezamabadi-pour and S. Saryazdi, "GSA: a gravitational search algorithm," Information Sciences, vol. 179, no. 13, pp. 2232-2248, 2009.
[12] Ali Asghar Heidari, et al., "Harris hawks optimization: Algorithm and applications," Future Generation Computer Systems, vol. 97, pp. 849-872, Aug. 2019.
[13] B. S. Ahmed, T. Sh. Abdulsamad and M. Y. Potrus, "Achievement of minimized combinatorial test suite for configuration-aware software functional testing using the cuckoo search algorithm," Information and Software Technology, vol. 66, p. 13-29, Oct. 2015.
[14] B. S. Ahmed, K. Z. Zamli and C. P. Lim, "Application of particle swarm optimization to uniform and variable strength covering array construction," Applied Soft Computing, vol. 12, no. 4, pp. 1330-1347, Apr. 2012.
[15] S. Esfandyari and V. Rafe, "GALP: a hybrid artificial intelligence algorithm for generating covering array," Soft Computing, vol. 25, pp. 7673-7689, 2021.
[16] D. M. Cohen, S. R. Dalal, M. L. Fredman and G. C. Patton, "The AETG system: an approach to testing based on combinatorial design," IEEE Trans. on Software Engineering, vol. 23, no. 7, pp. 437-444, Jul. 1997.
[17] J. Arshem, Test Vector Generator, accessed 2023. [Online]. Available: http://sourceforge.net/projects/tvg
[18] B. Jenkins, Jenny: A Pairwise Testing Tool, accessed 2023. [Online]. Available: http://burtleburtle.net/bob/math/jenny.html
[19] K. Z. Zamli, M. F. J. Klaib, M. I. Younis, N. A. M. Isa, and R. Abdullah, "Design and implementation of a t-way test data generation strategy with automated execution tool support," Information Sciences, vol. 181, no. 9, pp. 1741-1758, May 2011.
[20] A. Hartman, IBM Intelligent Test Case Handler, IBM Alphaworks, 2023. [Online]. Available: http://www.alphaworks.ibm.com/tech/whitch
[21] Y. Lei, R. Kacker, D. R. Kuhn, V. Okun and J. Lawrence, "IPOG: a general strategy for t-way software testing," in Proc. 4th Annual IEEE Int. Conf. and Workshops on the Engineering of Computer-Based Systems, pp. 549-556, Tucson, AZ, USA, 26-29 Mar 2007.
[22] A. Calvagna and A. Gargantini, "IPO-s: incremental generation of combinatorial interaction test data based on symmetries of covering arrays," in Proc. Int. Conf. on Software Testing, Verification, and Validation Workshops, pp. 2-10, Denver, CO, USA, 1-4 Apr. 2009.
[23] Y. Lei, R. Kacker, D. R. Kuhn, V. Okun and J. Lawrence, "IPOG/IPOG-D: efficient test generation for multi-way combinatorial testing, software testing," Software Testing, Verification & Reliability, vol. 18, no. 3, pp. 125-148, Sept. 2008.
[24] J. Stardom, Metaheuristics and the Search for Covering and Packing Array, M.Sc. Thesis, Simon Fraser University, 2001.
[25] M. B. Cohen, Designing Test Suites for Software Interactions Testing, Ph.D. Thesis, University of Auckland, Dept. of Computer Science, Auckland, 2004.
[26] L. Yousofvand, S. Soleimani, V. Rafe, and S. Esfandyari "Automatic program bug fixing by focusing on finding the shortest sequence of changes," Artificial Intelligence Review, vol. 57, Article ID: 39, 2024.
[27] S. Esfandyari and V. Rafe, "Correction to: GALP: a hybrid artificial intelligence algorithm for generating covering array," Soft Computing, vol. 25, p. page 7691, 2021.