تولید بهینه مجموعه آزمون به روش آزمون ترکیبی با اعمال تغییر در الگوریتم جستجوی گرانشی برای آرایه پوشش با قوه ثابت.

نوع مقاله : علمی-پژوهشی

نویسندگان

1 استادیار گروه مهندسی کامپیوتر، دانشکده فنی و مهندسی دانشگاه ملایر، ملایر، ایران

2 دکتری، دانشکده فنی مهندسی، دانشگاه اراک، ایران

3 استادیار، دانشکده فناوری اطلاعات و مهندسی کامپیوتر، دانشگاه شهید مدنی آذربایجان، تبریز، ایران

4 دانشیار، دانشکده فنی مهندسی، دانشگاه اراک، ایران

چکیده

لزوم افزایش استفاده از آزمون ترکیبی در نرم‌افزارهای امروزی به امری ضروری در توسعه نرم‌افزار تبدیل شده است. آزمون ترکیبی یا آزمون t-way راهکاری کارآمد در کاهش حجم مجموعه آزمون است به نحوی که می‌توان نرم‌افزار را با نمونه آزمون‌های کمتری مورد آزمون قرار داد. پوشش آرایه یکی از شاخه‌های مهم در آزمون ترکیبی است که انواع مختلفی دارد . راهکار‌های فراوانی برای تولید آن ارائه شده است که کارایی (سرعت) و بهره‌وری (اندازه آرایه) مناسبی را دارند. اما خلاء راهکار‌ای که هر دو خصوصیت کارایی و بهره‌وری را توامان داشته باشد به چشم می‌خورد.
در این پژوهش سعی شده است با استفاده از الگوریتم جستجوی گرانشی و تغییر در نحوه انتخاب همسایه‌ها، موفق به تولید مجموعه آزمون بهینه شده‌ایم و هچنین با تغییر در ساختمان داده‌ها و وزن دهی به پارامترهای پوشش داده نشده سرعت تولید مجموعه آزمون را افزایش داده‌ایم. وزن دهی به پارامترهای پوشش داده نشده و تغییر در رفتار الگورتیم گرانشی سبب جستجوی هوشمندانه جهت یافتن نمونه آزمون‌های پوشش داده نشده، شده است. افزایش سرعت باعث شده است که راهکار پیشنهادی توان تولید مجموعه آزمون برای پیکربندی‌های بزرگ را داشته باشد و همچنین نتایج آزمون نشان می‌دهد که راهکار پیشنهادی از الگوریتم‌های مطرح مانند الگوریتم ژنتیک، الگوریتم جستجوی توده ذرات و حتی خود الگوریتم جستجوی گرانشی نتایج بسیار بهتری را دارد.

کلیدواژه‌ها

موضوعات

عنوان مقاله [English]

optimal production of the test suite by the combinatorial testing method by applying changes in the gravitational search algorithm for the uniform strength cover array.

نویسندگان [English]

  • S. Esfandyari 1
  • L. Yousofvand 2
  • E. Pira 3
  • V. Rafe 4
1 Department of Computer Engineering, Faculty of Engineering, Malayer University, Malayer, Iran
2 Department of Computer Engineering, Faculty of Engineering, Arak University, Arak 38156-8-8349, Iran
3 Faculty of Information Technology and Computer Engineering, Azarbaijan Shahid Madani University, Tabriz, 5375171379, Iran
4 Department of Computer Engineering, Faculty of Engineering, Arak University, Arak 38156-8-8349, Iran
چکیده [English]

The need to increase the use of Combinatorial Testing (CT) in software testing has become a necessity in software development. CT is an efficient approach to reduce the size of the test suite so that the software can be tested with fewer test cases. Covering Array (CA) is one of the important branches in CT, which has different types. Many solutions have been provided for its production, which have appropriate efficiency (array size) and performance (speed). But there is a lack of a solution that has both efficiency and performance. In this research, we have tried to produce an optimized test suite(with the minimum number of test cases) by using the gravitational search algorithm(GSA) and changing the neighbor selection method. Also, by changing the structure of the data and giving weight to the parameters not covered, we have increased the speed of producing the test suite. The weighting of non-covered parameters and the change in the behavior of the gravity algorithm have caused a smart search to find non-covered test cases. This increase in speed has made the proposed solution capable of producing test suites for high-power configurations. Also, the evaluation results show that the proposed solution outperforms other popular algorithms such as the genetic algorithm, the particle mass search algorithm, and even the gravity search algorithm itself.

کلیدواژه‌ها [English]

  • Software Testing
  • Combinatorial Testing (CT)
  • Covering Array (CA)
  • Gravitational Search Algorithm (GSA)

مراجع

[1] H. Wu, C. Nie, F.-C. Kuo, H. Leung and C. J. Colbourn, "A Discrete Particle Swarm Optimization for Covering Array Generation," IEEE Transactions on Evolutionary Computation, vol. 19, no. 4, pp. 575-591, 2015.
[2] 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, 2018.
[3] S. Esfandyari and V. Rafe, "GALP: a hybrid artificial intelligence algorithm for generating covering array," soft computing, vol. 25, p. 7673–7689, 2021.
[4] S. Esfandyari and V. Rafe, "Extracting Combinatorial Test parameters and their values using model checking and evolutionary algorithms," Applied Soft Computing, vol. 91, pp. 1-19, 2020.
[5] A. R. A. Alsewari and K. Z. Zamli, "Design and implementation of a harmony-search-based variable-strengtht-way testing strategy with constraints support," Information and Software Technology, vol. 54, no. 6, p. 553–568, 2012.
[6] 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, 2022.
[7] 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, 2018.
[8] J. Torres-Jimenez and E. Rodriguez-Tello, "Simulated annealing for constructing binary covering arrays of variable strength," in in Proc. Congr.Evol. Comput, Barcelona, Spain, Jul., 2010.
[9] J. T.-J. a. E. Rodriguez-Tello, "New bounds for binary covering arrays using simulated annealing," Inf. Sci., vol. 185, no. 1, pp. 137-152, 2012.
[10] 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, 2016.
[11] E. Pira, V. Rafe and S. Esfandyari, "A three-phase approach to improve the functionality of t-way strategy," Soft Computing, pp. 1-21, 2023.
[12] M. Farokhian, J. Shoaei and S. Esfandyari, "GWC: A tool for automatic web data extraction," in 13th Symposium on Advances in Science and Technology: Sustainable Land of Computer and Information Technology, 2018.
[13] I. Izquierdo-Marquez, J. Torres-Jimenez, B. Acevedo-Juárez and H. Avila-George, "A greedy-metaheuristic 3-stage approach to construct covering arrays," Information Sciences, vol. 460, pp. 172-189, 2016.
[14] J. Torres-Jimenez, D. O. Ramirez-Acuna, B. Acevedo-Juárez and H. Avila-George, "New upper bounds for sequence Covering Arrays using a 3-stage approach," Expert Systems with Applications, vol. 207, p. 118022, 2022.
[15] J. Torres-Jimenez, H. Avila-George and I. Izquierdo-Marquez, "A two-stage algorithm for combinatorial testing," Optimization Letters, vol. 11, no. 3, pp. 457-469, 2017.
[16] V. Rafe, M. Darghayedi and E. Pira, "MS-ACO: a multi-stage ant colony optimization to refute complex software systems specified through graph transformation," Soft Computing, pp. 1-26, 2018.
[17] 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, p. 1330–1347, 2012.
[18] S. Esfandyari and V. Rafe, "Using the Particle Swarm Optimization Algorithm to Generate the Minimum Test Suite in Covering Array with Uniform Strength," Soft Computing Journal, vol. 8, no. 2, pp. 66-79, 2021.
[19] V. Rafe, "Scenario-driven analysis of systems specified through graph transformations," Journal of Visual Languages and Computing, vol. 24, p. 136–145, 2013.
[20] E. Rashedi, H. Nezamabadi-pour and S. Saryazdi, "GSA: a gravitational search algorithm," Information Sciences, 179(13), vol. 179, no. 13, pp. 2232-2248, 2009.
[21] 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 Transactions on Software Engineering, vol. 23, no. 7, pp. 437 - 444, 1997.
[22] J. Czerwonka, "Pairwise testing in real world: practical extensions to test case generator," in 24th Pacific Northwest Software Quality Conference, IEEE Computer Society, Portland, OR, USA, 2006.
[23] B. Jenkins, "Jenny download web page," Bob Jenkins’ Website, 2019. [Online]. Available: http://burtleburtle.net/bob/math/jenny.html.
[24] 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, 2011.
[25] K. Z. Zamli, B. Y. Alkazemi and G. Kendall, "A Tabu Search hyper-heuristic strategy for t-way test suite generation," vol. 44, pp. 57-74, 2016.
[26] L. Gonzalez-Hernandez, N. Rangel-Valdez and J. Torres-Jimenez, "Construction of mixed covering arrays of variable strength using a tabu search approach," in International Conference on Combinatorial Optimization and Applications, Berlin, Heidelberg, 2010.
[27] 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, 2015.
[28] K. M. Htay, R. R. Othman, A. Amir and J. M. H. Alkanaani, "Gravitational search algorithm based strategy for combinatorial t-way test suite generation," Journal of King Saud University - Computer and Information Sciences, vol. 34, no. 8, pp. 4860-4873, 2022.
[29] A. A. Muazu, A. S. Hashim and A. Sarlan, "Review of Nature Inspired Metaheuristic Algorithm Selection for Combinatorial t-Way Testing," IEEE Access, vol. 10, pp. 27404 - 27431, 2022.
[30] J. Stardom, "Metaheuristics and the Search for Covering and Packing Array," Thesis (M.Sc.), Simon Fraser University, 2001, 2001.
[31] M. B. Cohen, C. J. Colbourn, and A. C. Ling, "Constructing strength three covering arrays with augmented annealing," Discrete Math., vol. 308, no. 13, p. 2709–2722, 2008.
[32] S. Esfandyari and V. Rafe, "Correction to: GALP: a hybrid artificial intelligence algorithm for generating covering array," Soft Computing, 2021.
[33] E. S. A. Shahri, A. Alfi and J. Machado, "Fractional fixed-structure H∞ controller design using Augmented Lagrangian Particle Swarm Optimization with Fractional Order Velocity," Applied Soft Computing, vol. 77, pp. 688-695, 2019.
[34] D. Giveki, "Improving the performance of convolutional neural networks for image classification," Optical Memory and Neural Networks, vol. 30, pp. 51-66, 2021.
[35] H. Rastegar and D. Giveki, "Designing a new deep convolutional neural network for content-based image retrieval with relevance feedback," Computers and Electrical Engineering, vol. 106, p. 108593, 2023.
[36] A. Nasri, "Energy-Efficient Cloud Servers: an overview of Solutions and Architectures," Journal of Computer & Robotics, vol. 13, no. 1, pp. 33-44, 2020.
[37] L. Y. S. S. V. Rafe, "Automatic bug localization using a combination of deep learning and model transformation through node classification," Software Quality Journal, pp. 1-19, 2023.
[38] H. Eftekhari, "Neuro-fuzzy cooperative collision warning system in based on driver behavior in chain accident using connected vehicles," Journal of Transportation Research, vol. 20, no. 2, pp. 339-352, 2023.
[39] H. R. Eftekhari and M. Ghatee, "A similarity-based neuro-fuzzy modeling for driving behavior recognition applying fusion of smartphone sensors," Journal of Intelligent Transportation Systems, vol. 23, no. 1, pp. 72-83, 2019.
[40]R. B. Zadeh, M. Ghatee and H. R. Eftekhari, "Three-phases smartphone-based warning system to protect vulnerable road users under fuzzy conditions," IEEE Transactions on Intelligent Transportation Systems, vol. 19, no. 7, pp. 2086-2098, 2017.
[41] V. Nosrati and M. Rahmani, "Diversity improvement in homogeneous ensemble feature selection: a case study of its impact on classification performance," Neural Computing and Applications, 2023.
[42] A. Rafiee, P. Moradi and A. Ghaderzadeh, "A swarm intelligence based multi-label feature selection method hybridized with a local search strategy," Tabriz Journal of Electrical Engineering, vol. 51, no. 4, pp. 443-454, 2022.

فایل ها

هم رسانی

ارجاع به این مقاله

آمار