{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T19:21:41Z","timestamp":1778613701394,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T00:00:00Z","timestamp":1744588800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T00:00:00Z","timestamp":1744588800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Istinye University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>One of the time-consuming and expensive phases in software development is software testing, which is used to improve the quality of software systems. Therefore, Software test automation is a helpful technique that can alleviate testing time. Several techniques based on evolutionary and heuristic algorithms have been put forth to produce maximum coverage test sets. The primary shortcomings of earlier methods are inconsistent outcomes, insufficient branch coverage, and low fault-detection rates. Increasing branch coverage rate, defect detection rate, success rate, and stability are the primary goals of this research. A time- and cost-effective method has been suggested in this research to produce test data automatically by utilizing machine learning and horse herd optimization algorithms. In the first stage of the proposed method, the suggested machine learning classification model identifies the non-error-propagating instructions of the input program using machine learning algorithms. In the second stage, a test generator was suggested to cover only the program's fault-propagating instructions. The main characteristics of produced test data are avoiding the coverage of non-error-propagating instructions, maximizing the coverage of error-propagating instructions, maximizing success rate, and the fault discovery capability. Several experiments have been performed using nine standard benchmark programs. In the first stage, the suggested instruction classifier provides 90% accuracy and 82% precision. In the second stage, according to the results, the produced test data by the suggested method cover 99.93% of the error-prone instructions. The average success percentage with this method was 98.93%. The suggested method identifies roughly 89.40% of the injected faults by mutation testing tools.<\/jats:p>","DOI":"10.1007\/s11227-025-07219-5","type":"journal-article","created":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T14:15:32Z","timestamp":1744640132000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An automatic software test-generation method to discover the faults using fusion of machine learning and horse herd algorithm"],"prefix":"10.1007","volume":"81","author":[{"given":"Bahman","family":"Arasteh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keyvan","family":"Arasteh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Ghaffari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,14]]},"reference":[{"key":"7219_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10664-023-10363-2","volume":"28","author":"PS Nouwou Mindom","year":"2023","unstructured":"Nouwou Mindom PS, Nikanjam A, Khomh F (2023) A comparison of reinforcement learning frameworks for software testing tasks. Empir Software Eng 28:111. https:\/\/doi.org\/10.1007\/s10664-023-10363-2","journal-title":"Empir Software Eng"},{"issue":"1","key":"7219_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0020-0255(00)00093-1","volume":"131","author":"JC Lin","year":"2001","unstructured":"Lin JC, Yeh PL (2001) Automatic test data generation for path testing using GAs. J Inform Sci 131(1):47\u201364","journal-title":"J Inform Sci"},{"key":"7219_CR3","doi-asserted-by":"publisher","unstructured":"Khatun S, Rabbi KF, Yaakub CY, Klaib MFJ (2011) A Random search based effective algorithm for pairwise test data generation, International Conference on Electrical, Control and Computer Engineering 2011 (InECCE), pp. 293\u2013297, https:\/\/doi.org\/10.1109\/INECCE.2011.5953894.","DOI":"10.1109\/INECCE.2011.5953894"},{"key":"7219_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.jss.2016.03.020","volume":"121","author":"MM Eler","year":"2016","unstructured":"Eler MM, Endo AT, Durelli VHS (2016) An empirical study to quantify the characteristics of Java programs that may influence symbolic execution from a unit testing perspective. J Syst Softw 121:281\u2013297","journal-title":"J Syst Softw"},{"issue":"2","key":"7219_CR5","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/2408776.2408795","volume":"56","author":"C Cristian","year":"2013","unstructured":"Cristian C, Koushik SS (2013) Symbolic execution for software testing: Three decades later. Commun ACM 56(2):82\u201390","journal-title":"Commun ACM"},{"key":"7219_CR6","doi-asserted-by":"crossref","unstructured":"Cohen MB, Colbourn CJ, Ling ACH (2003) Augmenting Simulated Annealing to Build Interaction Test Suites, In: Proceedings of the Fourteenth International Symposium on Software Reliability Engineering (ISSRE'03), pp. 394\u2013405.","DOI":"10.1109\/ISSRE.2003.1251061"},{"issue":"1","key":"7219_CR7","first-page":"381","volume":"10","author":"C Sharma","year":"2014","unstructured":"Sharma C, Sabharwal S, Sibal R (2014) A survey on software testing techniques using genetic algorithm. Int J Comput Sci 10(1):381\u2013393","journal-title":"Int J Comput Sci"},{"key":"7219_CR8","doi-asserted-by":"publisher","first-page":"115446","DOI":"10.1016\/j.eswa.2021.115446","volume":"183","author":"M Esnaashari","year":"2021","unstructured":"Esnaashari M, Damia AH (2021) Automation of software test data generation using genetic algorithm and reinforcement learning. Expert Syst Appl 183:115446","journal-title":"Expert Syst Appl"},{"issue":"6","key":"7219_CR9","doi-asserted-by":"publisher","first-page":"4593","DOI":"10.1007\/s13369-014-1074-y","volume":"39","author":"C Mao","year":"2014","unstructured":"Mao C (2014) Generating Test Data for Software Structural Testing Based on Particle Swarm Optimization. Arab J Sci Eng 39(6):4593\u20134607","journal-title":"Arab J Sci Eng"},{"issue":"5","key":"7219_CR10","first-page":"1815","volume":"3","author":"A Kaur","year":"2011","unstructured":"Kaur A, Bhatt D (2011) Hybrid particle swarm optimization for regression testing. Int J Comput Sci Eng 3(5):1815\u20131824","journal-title":"Int J Comput Sci Eng"},{"key":"7219_CR11","doi-asserted-by":"publisher","first-page":"2171","DOI":"10.1016\/j.jss.2011.06.004","volume":"84","author":"BS Ahmed","year":"2011","unstructured":"Ahmed BS, Zamli KZ (2011) A variable strength interaction test suites generation strategy using particle swarm optimization. J Syst Softw 84:2171\u20132185","journal-title":"J Syst Softw"},{"key":"7219_CR12","doi-asserted-by":"crossref","unstructured":"Ghaemi A, Arasteh B (2020) SFLA-based heuristic method to generate software structural test data, J Softw Evol, 32(1).","DOI":"10.1002\/smr.2228"},{"issue":"6","key":"7219_CR13","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1142\/S0218194017500358","volume":"27","author":"ZK Aghdam","year":"2017","unstructured":"Aghdam ZK, Arasteh B (2017) An efficient method to generate test data for software structural testing using artificial bee colony optimization algorithm. Int J Softw Eng Knowl Eng 27(6):951\u2013966","journal-title":"Int J Softw Eng Knowl Eng"},{"key":"7219_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.swevo.2014.10.003","volume":"20","author":"C Mao","year":"2015","unstructured":"Mao C, Xiao L, Yu X, Chen J (2015) Adapting ant colony optimization to generate test data for software structural testing. J Swarm Evolut Comput 20:23\u201336","journal-title":"J Swarm Evolut Comput"},{"key":"7219_CR15","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10836-022-05999-9","volume":"38","author":"B Arasteh","year":"2022","unstructured":"Arasteh B, Hosseini SMJ (2022) Traxtor: An automatic software test suit generation method inspired by imperialist competitive optimization algorithms. J Electron Test 38:205\u2013215. https:\/\/doi.org\/10.1007\/s10836-022-05999-9","journal-title":"J Electron Test"},{"key":"7219_CR16","doi-asserted-by":"publisher","first-page":"111570","DOI":"10.1016\/j.jss.2022.111570","volume":"197","author":"P Martou","year":"2023","unstructured":"Martou P, Mens K, Duhoux B, Legay A (2023) Test scenario generation for feature-based context-oriented software systems. J Syst Softw 197:111570. https:\/\/doi.org\/10.1016\/j.jss.2022.111570","journal-title":"J Syst Softw"},{"key":"7219_CR17","doi-asserted-by":"publisher","first-page":"103335","DOI":"10.1016\/j.advengsoft.2022.103335","volume":"175","author":"RA Sulaiman","year":"2023","unstructured":"Sulaiman RA, Jawawi DN, Halim SA (2023) Cost-effective test case generation with the hyper-heuristic for software product line testing. Adv Eng Softw 175:103335. https:\/\/doi.org\/10.1016\/j.advengsoft.2022.103335","journal-title":"Adv Eng Softw"},{"key":"7219_CR18","doi-asserted-by":"publisher","first-page":"186","DOI":"10.3390\/math12020186","volume":"12","author":"B Arasteh","year":"2024","unstructured":"Arasteh B, Arasteh K, Kiani F, Sefati SS, Fratu O, Halunga S, Tirkolaee EB (2024) A bioinspired test generation method using discretized and modified bat optimization algorithm. Mathematics 12:186. https:\/\/doi.org\/10.3390\/math12020186","journal-title":"Mathematics"},{"key":"7219_CR19","doi-asserted-by":"publisher","first-page":"106711","DOI":"10.1016\/j.knosys.2020.106711","volume":"213","author":"F MiarNaeimi","year":"2021","unstructured":"MiarNaeimi F, Azizyan G, Rashki M (2021) Horse herd optimisation algorithm: A nature-inspired algorithm for high-dimensional optimisation problems. Knowledge-Based Syst 213:106711. https:\/\/doi.org\/10.1016\/j.knosys.2020.106711","journal-title":"Knowledge-Based Syst"},{"issue":"1","key":"7219_CR20","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1108\/DTA-03-2020-0073","volume":"55","author":"MJ Hosseini","year":"2020","unstructured":"Hosseini MJ, Arasteh B, Isazadeh A, Mohsenzadeh M, Mirzarezaee M (2020) An error-propagation aware method to reduce the software mutation cost using genetic algorithm. Data Technol Appl 55(1):118\u2013148. https:\/\/doi.org\/10.1108\/DTA-03-2020-0073","journal-title":"Data Technol Appl"},{"issue":"4","key":"7219_CR21","doi-asserted-by":"publisher","first-page":"461480","DOI":"10.1108\/DTA-08-2019-0140","volume":"54","author":"N Shomali","year":"2020","unstructured":"Shomali N, Arasteh B (2020) Mutation reduction in software mutation testing using firefly optimization algorithm. Data Technol Appl 54(4):461480. https:\/\/doi.org\/10.1108\/DTA-08-2019-0140","journal-title":"Data Technol Appl"},{"issue":"3","key":"7219_CR22","doi-asserted-by":"publisher","first-page":"1981","DOI":"10.32604\/cmes.2023.024172","volume":"135","author":"FS Gharehchopogh","year":"2023","unstructured":"Gharehchopogh FS, Abdollahzadeh B, Arasteh B (2023) An improved farmland fertility algorithm with hyper-heuristic approach for solving travelling salesman problem. CMES-Comput Model Eng Sci 135(3):1981\u20132006. https:\/\/doi.org\/10.32604\/cmes.2023.024172","journal-title":"CMES-Comput Model Eng Sci"},{"issue":"2","key":"7219_CR23","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1108\/DTA-08-2019-0138","volume":"55","author":"B Arasteh","year":"2021","unstructured":"Arasteh B, Sadegi R, Arasteh K (2021) B\u00f6len: software module clustering method using the combination of shuffled frog leaping and genetic algorithm. Data Technol Appl 55(2):251\u2013279. https:\/\/doi.org\/10.1108\/DTA-08-2019-0138","journal-title":"Data Technol Appl"},{"key":"7219_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-022-07781-6","author":"B Arasteh","year":"2022","unstructured":"Arasteh B (2022) Clustered design-model generation from a program source code using chaos-based metaheuristic algorithms. Neural Comput Appl. https:\/\/doi.org\/10.1007\/s00521-022-07781-6","journal-title":"Neural Comput Appl"},{"key":"7219_CR25","doi-asserted-by":"publisher","first-page":"103252","DOI":"10.1016\/j.advengsoft.2022.103252","volume":"173","author":"B Arasteh","year":"2022","unstructured":"Arasteh B, Abdi M, Bouyer A (2022) Program source code comprehension by module clustering using combination of discretized gray wolf and genetic algorithms. Adv Eng Softw 173:103252. https:\/\/doi.org\/10.1016\/j.advengsoft.2022.103252","journal-title":"Adv Eng Softw"},{"key":"7219_CR26","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.compeleceng.2015.09.020","volume":"48","author":"B Arasteh","year":"2015","unstructured":"Arasteh B, Bouyer A, Pirahesh S (2015) An efficient vulnerability-driven method for hardening a program against soft-error using genetic algorithm. Comput Elect Eng 48:25\u201343. https:\/\/doi.org\/10.1016\/j.compeleceng.2015.09.020","journal-title":"Comput Elect Eng"},{"key":"7219_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-024-04486-4","author":"B Arasteh","year":"2024","unstructured":"Arasteh B, Arasteh K, Ghaffari A et al (2024) A new binary chaos-based metaheuristic algorithm for software defect prediction. Cluster Comput. https:\/\/doi.org\/10.1007\/s10586-024-04486-4","journal-title":"Cluster Comput"},{"key":"7219_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-023-04170-z","author":"NAA Khleel","year":"2023","unstructured":"Khleel NAA, Neh\u00e9z K (2023) Software defect prediction using a bidirectional LSTM network combined with oversampling techniques. Cluster Comput. https:\/\/doi.org\/10.1007\/s10586-023-04170-z","journal-title":"Cluster Comput"},{"key":"7219_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-024-04266-0","author":"R Malhotra","year":"2024","unstructured":"Malhotra R, Bansal A, Kessentini M (2024) Deployment and performance monitoring of docker based federated learning framework for software defect prediction. Cluster Comput. https:\/\/doi.org\/10.1007\/s10586-024-04266-0","journal-title":"Cluster Comput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07219-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07219-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07219-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T14:15:33Z","timestamp":1744640133000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07219-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,14]]},"references-count":29,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2025,4]]}},"alternative-id":["7219"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07219-5","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,14]]},"assertion":[{"value":"19 March 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares that throughout this research, they did not receive any funds or grants. There are no financial or non-financial conflicts of interest that the author needs to report.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}},{"value":"The data and information utilized in this study were created by the researchers themselves. They do not belong to any other individual or organization. Other researchers will have access to the research's data. The authors from Iran are not employed by the Iranian government and don\u2019t have any governmental job or duty. They are preparing articles in their personal capacity and Interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"741"}}