{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T21:46:55Z","timestamp":1764020815896,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Electron Test"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s10836-024-06136-4","type":"journal-article","created":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T06:02:32Z","timestamp":1725948152000},"page":"539-556","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Automatic Software Testing Method to Discover Hard-to-Detect Faults Using Hybrid Olympiad Optimization Algorithm"],"prefix":"10.1007","volume":"40","author":[{"given":"Leiqing","family":"Zheng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5202-6315","authenticated-orcid":false,"given":"Bahman","family":"Arasteh","sequence":"additional","affiliation":[]},{"given":"Mahsa Nazeri","family":"Mehrabani","sequence":"additional","affiliation":[]},{"given":"Amir Vahide","family":"Abania","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,10]]},"reference":[{"key":"6136_CR1","unstructured":"Ammann P, Offutt J\u2019 (2017) Introduction to Software Testing\u2019, Cambridge University Press, ISBN 978-1-107-17201-2"},{"issue":"1","key":"6136_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":"6136_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. Int Conf Electr Control Comput Eng 2011 (InECCE) 293\u2013297. https:\/\/doi.org\/10.1109\/INECCE.2011.5953894","DOI":"10.1109\/INECCE.2011.5953894"},{"key":"6136_CR4","unstructured":"Marcelo M, Eler AT, Endo, Vinicius HS, Durelli, An empirical study to quantify the characteristics of Java programs that may influence symbolic execution from a unit testing perspective, (2016) Cristian C., Koushik S. S., Symbolic Execution For Software Testing: Three Decades Later, Communications of the ACM, Vol. 56 No. 2, Pages 82\u201390. 2013"},{"key":"6136_CR5","doi-asserted-by":"crossref","unstructured":"Cristian C, Koushik SS (2013) Symbolic execution for software testing: three decades later. Communications of the ACM 56(2):82\u201390. 2013","DOI":"10.1145\/2408776.2408795"},{"key":"6136_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\u201903), pp. 394\u2013405","DOI":"10.1109\/ISSRE.2003.1251061"},{"issue":"1","key":"6136_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":"6136_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":"6136_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":"6136_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 Vol 3(5):1815\u20131824","journal-title":"Int J Comput Sci Eng Vol"},{"key":"6136_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":"6136_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":"6136_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":"6136_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 Evolutionary Comput 20:23\u201336","journal-title":"J Swarm Evolutionary Comput"},{"key":"6136_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, Traxtor (2022) 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":"6136_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":"6136_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"},{"issue":"8","key":"6136_CR18","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1016\/j.jksuci.2023.101655","volume":"35","author":"B Arasteh","year":"2023","unstructured":"Arasteh B, Sadegi R, Arasteh K, Gunes P, Kiani F, Torkamanian-Afshar M (2023) A bioinspired discrete heuristic algorithm to generate the effective structural model of a program source code. J King Saud Univ - Comput Inform Sci 35(8):1319\u20131578. https:\/\/doi.org\/10.1016\/j.jksuci.2023.101655","journal-title":"J King Saud Univ - Comput Inform Sci"},{"issue":"1","key":"6136_CR19","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":"6136_CR20","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":"6136_CR21","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-Computer Model Eng Sci 135(3):1981\u20132006. https:\/\/doi.org\/10.32604\/cmes.2023.024172","journal-title":"CMES-Computer Model Eng Sci"},{"issue":"2","key":"6136_CR22","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":"6136_CR23","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 Applic. https:\/\/doi.org\/10.1007\/s00521-022-07781-6","journal-title":"Neural Comput Applic"},{"key":"6136_CR24","doi-asserted-by":"publisher","first-page":"0965","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:0965\u20139978. https:\/\/doi.org\/10.1016\/j.advengsoft.2022.103252","journal-title":"Adv Eng Softw"}],"container-title":["Journal of Electronic Testing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10836-024-06136-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10836-024-06136-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10836-024-06136-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T06:07:27Z","timestamp":1728886047000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10836-024-06136-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["6136"],"URL":"https:\/\/doi.org\/10.1007\/s10836-024-06136-4","relation":{},"ISSN":["0923-8174","1573-0727"],"issn-type":[{"type":"print","value":"0923-8174"},{"type":"electronic","value":"1573-0727"}],"subject":[],"published":{"date-parts":[[2024,8]]},"assertion":[{"value":"24 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The data used in this research does not belong to any other person or third party and was prepared and generated by the researchers themselves during the research. The data of this research will be accessible to other researchers.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and Informed Consent for Data Used"}},{"value":"The authors affirm that they did not receive any grants, funding while they were preparing this paper. There are no financial or non-financial conflicts of interests that the authors need to disclose.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}