{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T00:53:09Z","timestamp":1778806389852,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discov Computing"],"DOI":"10.1007\/s10791-025-09525-1","type":"journal-article","created":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T11:40:03Z","timestamp":1746099603000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["SQUMUTH squirrel search based algorithm for high order mutant generation in mutation testing"],"prefix":"10.1007","volume":"28","author":[{"given":"Subhasish","family":"Mohanty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jyotirmaya","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudhir Kumar","family":"Mohapatra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seifu Detso","family":"Bejo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aliazar Deneke","family":"Deferisha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,1]]},"reference":[{"key":"9525_CR1","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.jmsy.2020.06.017","volume":"58","author":"M Liu","year":"2021","unstructured":"Liu M, Fang S, Dong H, Xu C. Review of digital twin about concepts, technologies, and industrial applications. J Manuf Syst. 2021;58:346\u201361. https:\/\/doi.org\/10.1016\/j.jmsy.2020.06.017.","journal-title":"J Manuf Syst"},{"key":"9525_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4842-9893-0_1","volume-title":"Modern software testing techniques","author":"I Forg\u00e1cs","year":"2024","unstructured":"Forg\u00e1cs I, Kov\u00e1cs A. Software testing basics. In: Modern software testing techniques. Berkeley: Apress; 2024. p. 1\u201320. https:\/\/doi.org\/10.1007\/978-1-4842-9893-0_1."},{"issue":"20","key":"9525_CR3","doi-asserted-by":"publisher","first-page":"11324","DOI":"10.3390\/app132011324","volume":"13","author":"MA Jamil","year":"2023","unstructured":"Jamil MA, Nour MK, Alotaibi SS, Hussain MJ, Hussaini SM, Naseer A. Adaptive test suites generation for self-adaptive systems using SPEA2 algorithm. Appl Sci. 2023;13(20):11324. https:\/\/doi.org\/10.3390\/app132011324.","journal-title":"Appl Sci"},{"issue":"5","key":"9525_CR4","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1109\/TSE.2024.3377378","volume":"50","author":"AB S\u00e1nchez","year":"2024","unstructured":"S\u00e1nchez AB, Parejo JA, Segura S, Dur\u00e1n A, Papadakis M. Mutation testing in practice: insights from open-source software developers. IEEE Trans Software Eng. 2024;50(5):1130\u201343. https:\/\/doi.org\/10.1109\/TSE.2024.3377378.","journal-title":"IEEE Trans Software Eng"},{"key":"9525_CR5","doi-asserted-by":"publisher","unstructured":"Kurtz B, Ammann P, Offutt J, Kurtz M. Are we there yet? How redundant and equivalent mutants affect determination of test completeness. In: Twelfth IEEE Workshop on Mutation Analysis (Mutation 2016) 2016; p. 1\u20136. https:\/\/doi.org\/10.1109\/Mutation.2016.1","DOI":"10.1109\/Mutation.2016.1"},{"key":"9525_CR6","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.jss.2019.04.031","volume":"154","author":"JA Prado Lima","year":"2019","unstructured":"Prado Lima JA, Vergilio SR. A systematic mapping study on higher order mutation testing. J Syst Softw. 2019;154:92\u2013109. https:\/\/doi.org\/10.1016\/j.jss.2019.04.031.","journal-title":"J Syst Softw"},{"key":"9525_CR7","doi-asserted-by":"publisher","unstructured":"Prado Lima JA, Vergilio SR. Search-based higher order mutation testing: A mapping study. In: Proceedings of the III Brazilian Symposium on Systematic and Automated Software Testing (SAST '18). Association for Computing Machinery, New York, NY. 2018, p. 87\u201396. https:\/\/doi.org\/10.1145\/3266003.3266013.","DOI":"10.1145\/3266003.3266013"},{"key":"9525_CR8","doi-asserted-by":"publisher","first-page":"10031","DOI":"10.1109\/access.2022.3142859","volume":"10","author":"TM Shami","year":"2022","unstructured":"Shami TM, El-Saleh AA, Alswaitti M, Al-Tashi Q, Summakieh MA, Mirjalili S. Particle swarm optimization: a comprehensive survey. IEEE Access. 2022;10:10031\u201361. https:\/\/doi.org\/10.1109\/access.2022.3142859.","journal-title":"IEEE Access"},{"issue":"5","key":"9525_CR9","doi-asserted-by":"publisher","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","volume":"80","author":"S Katoch","year":"2021","unstructured":"Katoch S, Chauhan SS, Kumar V. A review on genetic algorithm: past, present, and future. Multimedia Tools Appl. 2021;80(5):8091\u2013126. https:\/\/doi.org\/10.1007\/s11042-020-10139-6.","journal-title":"Multimedia Tools Appl"},{"key":"9525_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101126","volume":"74","author":"F Qin","year":"2022","unstructured":"Qin F, Zain AM, Zhou K-Q. Harmony search algorithm and related variants: a systematic review. Swarm Evol Comput. 2022;74: 101126. https:\/\/doi.org\/10.1016\/j.swevo.2022.101126.","journal-title":"Swarm Evol Comput"},{"key":"9525_CR11","doi-asserted-by":"publisher","unstructured":"Hernando L, Mendiburu A, Lozano JA. Hill-climbing algorithm: Let\u2019s go for a walk before finding the optimum. In: 2018 IEEE Congress on Evolutionary Computation (CEC), Rio de Janeiro, Brazil. 2018, p. 1\u20137. https:\/\/doi.org\/10.1109\/CEC.2018.8477836.","DOI":"10.1109\/CEC.2018.8477836"},{"issue":"1","key":"9525_CR12","doi-asserted-by":"publisher","first-page":"3021","DOI":"10.1007\/s11042-021-11266-4","volume":"83","author":"JJ Jena","year":"2024","unstructured":"Jena JJ, Satapathy SC. A new adaptive tuned Social Group Optimization (SGO) algorithm with sigmoid-adaptive inertia weight for solving engineering design problems. Multimedia Tools Appl. 2024;83(1):3021\u201355. https:\/\/doi.org\/10.1007\/s11042-021-11266-4.","journal-title":"Multimedia Tools Appl"},{"issue":"2","key":"9525_CR13","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/s11831-022-09817-5","volume":"30","author":"M Shehab","year":"2023","unstructured":"Shehab M, et al. A comprehensive review of bat-inspired algorithm: variants, applications, & hybridization. Arch Comput Methods Eng. 2023;30(2):765\u201397. https:\/\/doi.org\/10.1007\/s11831-022-09817-5.","journal-title":"Arch Comput Methods Eng"},{"issue":"11","key":"9525_CR14","doi-asserted-by":"publisher","first-page":"3446","DOI":"10.35940\/ijitee.K2573.0981119","volume":"8","author":"SAMRS Sharma","year":"2019","unstructured":"Sharma SAMRS, Sharma VK. Research on use of nature-inspired algorithms in software testing. Int J Innov Technol Explor Eng. 2019;8(11):3446\u201352.","journal-title":"Int J Innov Technol Explor Eng"},{"key":"9525_CR15","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.swevo.2018.02.013","volume":"44","author":"M Jain","year":"2019","unstructured":"Jain M, Singh V, Rani A. A novel nature-inspired algorithm for optimization: squirrel search algorithm. Swarm Evol Comput. 2019;44:148\u201375.","journal-title":"Swarm Evol Comput"},{"key":"9525_CR16","doi-asserted-by":"publisher","unstructured":"Gay G, Salahirad A. How closely are common mutation operators coupled to real faults? In: 2023 IEEE Conference on Software Testing, Verification and Validation (ICST), 2023, p. 129\u2013140. Dublin, Ireland. https:\/\/doi.org\/10.1109\/ICST57152.2023.00021.","DOI":"10.1109\/ICST57152.2023.00021"},{"key":"9525_CR17","unstructured":"Amare M, Mohapatra SK, Panigrahy TP. A systematic literature review on generating higher-order mutants. In: 2021 8th International Conference on Computing for Sustainable Global Development (INDIACom), 2021, pp. 131\u2013136. New Delhi, India."},{"key":"9525_CR18","first-page":"263","volume-title":"Algorithms for intelligent systems","author":"R Sujeetha","year":"2023","unstructured":"Sujeetha R, Akila K. Effective mutants\u2019 classification for mutation testing of smart contracts. In: Algorithms for intelligent systems. Springer Nature: Singapore; 2023. p. 263\u201379."},{"key":"9525_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2024.107468","volume":"171","author":"AM Dakhel","year":"2024","unstructured":"Dakhel AM, Nikanjam A, Majdinasab V, Khomh F, Desmarais MC. Effective test generation using pre-trained large language models and mutation testing. Inf Softw Technol. 2024;171: 107468. https:\/\/doi.org\/10.1016\/j.infsof.2024.107468.","journal-title":"Inf Softw Technol"},{"key":"9525_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2022.107129","volume":"155","author":"F Tambon","year":"2023","unstructured":"Tambon F, Khomh F, Antoniol G. A probabilistic framework for mutation testing in deep neural networks. Inf Softw Technol. 2023;155: 107129. https:\/\/doi.org\/10.1016\/j.infsof.2022.107129.","journal-title":"Inf Softw Technol"},{"key":"9525_CR21","doi-asserted-by":"crossref","unstructured":"Langdon W, Clark D. Deep mutations have little impact. In: Proceedings of the 13th ACM\/IEEE International Workshop on Genetic Improvement. p. 1\u20138. New York, NY, USA: ACM. 2024.","DOI":"10.1145\/3643692.3648259"},{"issue":"1","key":"9525_CR22","doi-asserted-by":"publisher","first-page":"34","DOI":"10.5815\/ijisa.2018.01.05","volume":"10","author":"A Abuljadayel","year":"2018","unstructured":"Abuljadayel A, Wedyan F. An approach for the generation of higher-order mutants using genetic algorithms. Int J Intell Syst Appl. 2018;10(1):34\u201345. https:\/\/doi.org\/10.5815\/ijisa.2018.01.05.","journal-title":"Int J Intell Syst Appl"},{"issue":"7","key":"9525_CR23","doi-asserted-by":"publisher","first-page":"327","DOI":"10.3390\/info13070327","volume":"13","author":"F Wedyan","year":"2022","unstructured":"Wedyan F, Al-Shishani A, Jararweh Y. Gasubtle: a new genetic algorithm for generating subtle higher-order mutants. Information. 2022;13(7):327. https:\/\/doi.org\/10.3390\/info13070327.","journal-title":"Information"},{"key":"9525_CR24","doi-asserted-by":"crossref","unstructured":"Mohanty S et al. Generating higher-order mutants using PSO with Levy Flight (LFPSO) algorithm. In: 2022 International Conference on Machine Learning, Computer Systems and Security (MLCSS). IEEE. 2022.","DOI":"10.1109\/MLCSS57186.2022.00022"},{"key":"9525_CR25","doi-asserted-by":"crossref","unstructured":"Lemieux C, Inala JP, Lahiri SK, Sen S. CodaMosa: escaping coverage plateaus in test generation with pre-trained large language models. In: 2023 IEEE\/ACM 45th International Conference on Software Engineering (ICSE). 2023, p. 919\u2013931. IEEE.","DOI":"10.1109\/ICSE48619.2023.00085"},{"key":"9525_CR26","doi-asserted-by":"publisher","unstructured":"Bejo SD, Assefa BG, Mohapatra SK. BackIP: mutation-based test data generation using hybrid approach. In: 2021 International Conference on Information and Communication Technology for Development for Africa (ICT4DA). Bahir Dar, Ethiopia. 2021. p. 178\u2013183. https:\/\/doi.org\/10.1109\/ICT4DA53266.2021.9672216.","DOI":"10.1109\/ICT4DA53266.2021.9672216"},{"key":"9525_CR27","doi-asserted-by":"publisher","unstructured":"Wong C-P et al. Efficiently finding higher-order mutants. In: Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering. 2020. https:\/\/doi.org\/10.1145\/3368089.3409713.","DOI":"10.1145\/3368089.3409713"},{"key":"9525_CR28","doi-asserted-by":"publisher","unstructured":"Oh S, Lee S, Yoo S. Effectively sampling higher-order mutants using causal effect. In: 2021 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW). 2021. https:\/\/doi.org\/10.1109\/icstw52544.2021.00017.","DOI":"10.1109\/icstw52544.2021.00017"},{"issue":"7","key":"9525_CR29","doi-asserted-by":"publisher","first-page":"3922","DOI":"10.1109\/tse.2023.3277564","volume":"49","author":"M Ojdanic","year":"2023","unstructured":"Ojdanic M, Garg A, Khanfir A, Degiovanni R, Papadakis M, Le Traon Y. Syntactic versus semantic similarity of artificial and real faults in mutation testing studies. IEEE Trans Software Eng. 2023;49(7):3922\u201338. https:\/\/doi.org\/10.1109\/tse.2023.3277564.","journal-title":"IEEE Trans Software Eng"},{"issue":"4","key":"9525_CR30","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1142\/s2196888822500282","volume":"9","author":"V Nho","year":"2022","unstructured":"Nho V, Nguyen Q-V, Nguyen T-B. Toward improving the quality of mutation operator and test case effectiveness in higher-order mutation testing. Vietnam J Comput Sci. 2022;9(4):511\u201326. https:\/\/doi.org\/10.1142\/s2196888822500282.","journal-title":"Vietnam J Comput Sci"},{"key":"9525_CR31","doi-asserted-by":"publisher","unstructured":"Van Phol L, Binh NT, Parissis I. Higher-order mutant generator for Lustre programs. In: 2019 International Conference on System Science and Engineering (ICSSE). 2019. https:\/\/doi.org\/10.1109\/icsse.2019.8823130.","DOI":"10.1109\/icsse.2019.8823130"},{"key":"9525_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2019.07.100","volume":"157","author":"AV Pizzoleto","year":"2019","unstructured":"Pizzoleto AV, Ferrari FC, Offutt J, Fernandes L, Ribeiro M. A systematic literature review of techniques and metrics to reduce the cost of mutation testing. J Syst Softw. 2019;157: 110388. https:\/\/doi.org\/10.1016\/j.jss.2019.07.100.","journal-title":"J Syst Softw"},{"key":"9525_CR33","doi-asserted-by":"publisher","unstructured":"Liu J, Song L. Second-order mutation testing cost reduction based on mutant clustering using SOM neural network model. In: 2021 IEEE 45th Annual Computers, Software, and Applications Conference (COMPSAC), 2021, p. 974\u2013979. Madrid, Spain. https:\/\/doi.org\/10.1109\/COMPSAC51774.2021.00131.","DOI":"10.1109\/COMPSAC51774.2021.00131"},{"issue":"1","key":"9525_CR34","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1109\/TR.2020.3011423","volume":"71","author":"C-A Sun","year":"2022","unstructured":"Sun C-A, Fu A, Guo X, Chen TY. ReMuSSE: a redundant mutant identification technique based on selective symbolic execution. IEEE Trans Reliab. 2022;71(1):415\u201328. https:\/\/doi.org\/10.1109\/TR.2020.3011423.","journal-title":"IEEE Trans Reliab"},{"key":"9525_CR35","first-page":"837","volume-title":"Lecture notes in computer science","author":"V-N Do","year":"2021","unstructured":"Do V-N, Nguyen Q-V, Nguyen T-B. Evaluating mutation operator and test case effectiveness by means of mutation testing. In: Lecture notes in computer science. Cham: Springer International Publishing; 2021. p. 837\u201350."},{"key":"9525_CR36","doi-asserted-by":"publisher","unstructured":"Rani S, Suri B. Equivalent mutant problem and its problem-solving techniques: a retrospective view. In: 2018 8th International Conference on Cloud Computing, Data Science & Engineering (Confluence); 2018, p. 791\u2013797. Noida, India. https:\/\/doi.org\/10.1109\/CONFLUENCE.2018.8442785.","DOI":"10.1109\/CONFLUENCE.2018.8442785"},{"key":"9525_CR37","doi-asserted-by":"publisher","unstructured":"Diniz JP, Ferreira F, Ferrari F, Figueiredo E. Do mutations of strongly subsuming second-order mutants really mask each other? In: 2023 IEEE 34th International Symposium on Software Reliability Engineering (ISSRE). 2023; pp. 114\u2013124. Florence, Italy. https:\/\/doi.org\/10.1109\/ISSRE59848.2023.00079.","DOI":"10.1109\/ISSRE59848.2023.00079"},{"key":"9525_CR38","first-page":"13","volume-title":"EAI\/Springer innovations in communication and computing","author":"M Khari","year":"2022","unstructured":"Khari M. Comparison and validation of mutation testing tools based on Java language. In: EAI\/Springer innovations in communication and computing. Cham: Springer International Publishing; 2022. p. 13\u201329."},{"key":"9525_CR39","unstructured":"JUnit 5. (n.d.). The 5th major version of the programmer-friendly testing framework for Java and the JVM. Retrieved April 23, 2024, from https:\/\/junit.org\/junit5\/."},{"key":"9525_CR40","doi-asserted-by":"publisher","unstructured":"Harman M, Jia Y, Mateo PR, Polo M. Angels and monsters: An empirical investigation of potential test effectiveness and efficiency improvement from strongly subsuming higher-order mutation. In: Proceedings of the 29th ACM\/IEEE International Conference on Automated Software Engineering (ASE '14) (pp. 397\u2013408). Vasteras, Sweden: ACM Press. 2014; https:\/\/doi.org\/10.1145\/2642937.2643008.","DOI":"10.1145\/2642937.2643008"},{"issue":"10","key":"9525_CR41","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1016\/j.infsof.2009.04.016","volume":"51","author":"Y Jia","year":"2009","unstructured":"Jia Y, Harman M. Higher-order mutation testing. Inf Softw Technol. 2009;51(10):1379\u201393. https:\/\/doi.org\/10.1016\/j.infsof.2009.04.016.","journal-title":"Inf Softw Technol"}],"container-title":["Discover Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-025-09525-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-025-09525-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-025-09525-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T11:40:13Z","timestamp":1746099613000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-025-09525-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,1]]},"references-count":41,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["9525"],"URL":"https:\/\/doi.org\/10.1007\/s10791-025-09525-1","relation":{},"ISSN":["2948-2992"],"issn-type":[{"value":"2948-2992","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,1]]},"assertion":[{"value":"8 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"No animal or human is involve in the experiment of this research.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Research involving human and\/or animals"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}},{"value":"The authors declare no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"60"}}