{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T14:33:13Z","timestamp":1771338793798,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"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":[[2023,6]]},"DOI":"10.1007\/s10836-023-06070-x","type":"journal-article","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T08:02:31Z","timestamp":1687248151000},"page":"347-370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A Novel Metaheuristic Based Method for Software Mutation Test Using the Discretized and Modified Forrest Optimization Algorithm"],"prefix":"10.1007","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5202-6315","authenticated-orcid":false,"given":"Bahman","family":"Arasteh","sequence":"first","affiliation":[]},{"given":"Farhad Soleimanian","family":"Gharehchopogh","sequence":"additional","affiliation":[]},{"given":"Peri","family":"Gunes","sequence":"additional","affiliation":[]},{"given":"Farzad","family":"Kiani","sequence":"additional","affiliation":[]},{"given":"Mahsa","family":"Torkamanian-Afshar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,20]]},"reference":[{"key":"6070_CR1","doi-asserted-by":"crossref","unstructured":"Acree AT, Budd TA, DeMillo RA, Lipton RJ, Sayward FG (1980)\u00a0Mutation Analysis. School of Information and Computer Science, Georgia Institute of Technology","DOI":"10.21236\/ADA076575"},{"issue":"6","key":"6070_CR2","doi-asserted-by":"publisher","first-page":"2017","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 Software Eng Knowl Eng 27(6):2017","journal-title":"Int J Software Eng Knowl Eng"},{"key":"6070_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s10836-022-05999-9","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. https:\/\/doi.org\/10.1007\/s10836-022-05999-9","journal-title":"J Electron Test"},{"key":"6070_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10836-022-06008-9","volume":"38","author":"B Arasteh","year":"2022","unstructured":"Arasteh B, Imanzadeh P, Arasteh K et al (2022) A Source-code Aware Method for Software Mutation Testing Using Artificial Bee Colony Algorithm. J Electron Test 38:289\u2013302. https:\/\/doi.org\/10.1007\/s10836-022-06008-9","journal-title":"J Electron Test"},{"key":"6070_CR5","doi-asserted-by":"crossref","unstructured":"Arasteh B (2019) ReDup: A software-based method for detecting soft-error using data analysis. Comp Electrical Eng 78(September 2019):89\u2013107","DOI":"10.1016\/j.compeleceng.2019.07.006"},{"issue":"2","key":"6070_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/stvr.226","volume":"11","author":"EF Barbosa","year":"2001","unstructured":"Barbosa EF, Maldonado JC, Vincenzi AMR (2001) Toward the determination of sufficient mutant operators for C. Software Testing, Verification and Reliability 11(2):113\u2013136","journal-title":"Software Testing, Verification and Reliability"},{"key":"6070_CR7","unstructured":"Bouyer A, Arasteh B, Movaghar A (2007) A New Hybrid Model Using Case-Based Reasoning and Decision Tree Methods for Improving Speedup and Accuracy. IADIS International Conference of Applied Computing"},{"key":"6070_CR8","unstructured":"Budd TA (1980) Mutation Analysis of Program Test Data. Yale University"},{"key":"6070_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s10836-022-06033-8","author":"SSV Chandra","year":"2022","unstructured":"Chandra SSV, Sankar SS, Anand HS (2022) Smell Detection Agent Optimization Approach to Path Generation in Automated Software Testing. J Electron Test. https:\/\/doi.org\/10.1007\/s10836-022-06033-8","journal-title":"J Electron Test"},{"issue":"2018","key":"6070_CR10","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.infsof.2018.07.011","volume":"104","author":"P Delgado-P\u00e9rez","year":"2018","unstructured":"Delgado-P\u00e9rez P, Medina-Bulo I (2018) Search-based mutant selection for efficient test suite improvement: Evaluation and results. Inf Softw Technol 104(2018):130\u2013143","journal-title":"Inf Softw Technol"},{"issue":"2017","key":"6070_CR11","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.infsof.2016.04.012","volume":"81","author":"L Deng","year":"2017","unstructured":"Deng L, Offutt J, Ammann P, Mirzaei N (2017) Mutation operators for testing Android apps. Inf Softw Technol 81(2017):154\u2013168","journal-title":"Inf Softw Technol"},{"issue":"10","key":"6070_CR12","doi-asserted-by":"publisher","first-page":"1108","DOI":"10.1016\/j.infsof.2011.03.008","volume":"53","author":"JJ Dominguez-Jimenez","year":"2011","unstructured":"Dominguez-Jimenez JJ, Estero-Botaro A, Garcia-Dominguez A, Medina-Bulo I (2011) Evolutionary mutation testing. Inf Softw Technol 53(10):1108\u20131123","journal-title":"Inf Softw Technol"},{"key":"6070_CR13","doi-asserted-by":"crossref","unstructured":"Fenton NE, Ohlsson N (2000) Quantitative analysis of faults and failures in a complex software system. IEEE Transact Software Eng 26(8):797\u2013814","DOI":"10.1109\/32.879815"},{"key":"6070_CR14","doi-asserted-by":"publisher","unstructured":"Ghaemi A,\u00a0Arasteh B (2020) SFLA-based heuristic method to generate software structural test data.\u00a0J Softw Evol Proc 32:e2228.\u00a0https:\/\/doi.org\/10.1002\/smr.2228","DOI":"10.1002\/smr.2228"},{"key":"6070_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2020.106496","volume":"132","author":"R Gheyi","year":"2021","unstructured":"Gheyi R, Ribeiro M, Souza B, Guimar\u00e3es M, Fernandes L, d\u2019Amorim M, Alves V, Teixeira L, Fonseca B (2021) Identifying method-level mutation subsumption relations using Z3. Inf Softw Technol 132:106496","journal-title":"Inf Softw Technol"},{"issue":"1","key":"6070_CR16","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1108\/DTA-03-2020-0073","volume":"55","author":"S Hosseini","year":"2021","unstructured":"Hosseini S, Arasteh B, Isazadeh A, Mohsenzadeh M, Mirzarezaee M (2021) An error-propagation aware method to reduce the software mutation cost using genetic algorithm. Data Technologies and Applications 55(1):118\u2013148. https:\/\/doi.org\/10.1108\/DTA-03-2020-0073","journal-title":"Data Technologies and Applications"},{"issue":"4","key":"6070_CR17","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TSE.1982.235571","volume":"8","author":"WE Howden","year":"1982","unstructured":"Howden WE (1982) Weak mutation testing and completeness of test sets. IEEE Trans Software Eng 8(4):371\u2013379","journal-title":"IEEE Trans Software Eng"},{"key":"6070_CR18","first-page":"55","volume-title":"Parallel firm mutation of Java programs","author":"D Jackson","year":"2000","unstructured":"Jackson D, Woodward MR (2000) Parallel firm mutation of Java programs. Proc. First Workshop on Mutation Analysis, pp 55\u201361"},{"issue":"5","key":"6070_CR19","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1109\/tse.2010.62","volume":"37","author":"Y Jia","year":"2011","unstructured":"Jia Y, Harman M (2011) An Analysis and Survey of the Development of Mutation Testing. IEEE Trans Software Eng 37(5):649\u2013678. https:\/\/doi.org\/10.1109\/tse.2010.62","journal-title":"IEEE Trans Software Eng"},{"key":"6070_CR20","doi-asserted-by":"publisher","unstructured":"Keshtgar A, Arasteh B (2017) Enhancing Software Reliability against Soft-Error using Minimum Redundancy on Critical Data.\u00a0https:\/\/doi.org\/10.5815\/ijcnis.2017.05.03","DOI":"10.5815\/ijcnis.2017.05.03"},{"key":"6070_CR21","doi-asserted-by":"crossref","unstructured":"King KN, Offutt AJ (1991) A Fortran language system for mutation-based software testing. Software: Practice and Experience 21(7):685\u2013718","DOI":"10.1002\/spe.4380210704"},{"key":"6070_CR22","doi-asserted-by":"crossref","unstructured":"Kintis M, Papadakis M, Malevris N (2010)\u00a0Evaluating mutation testing alternatives: a collateral experiment. Proceedings of the 17th Asia-Pacific Software Engineering Conference (APSEC)","DOI":"10.1109\/APSEC.2010.42"},{"key":"6070_CR23","doi-asserted-by":"crossref","unstructured":"Kurtz B, Ammann P, Delamaro ME, Offutt J, Deng L (2014)\u00a0Mutant subsumption graphs. 2014 IEEE Seventh International Conference on Software Testing, Verification and Validation Workshops (ICSTW)","DOI":"10.1109\/ICSTW.2014.20"},{"key":"6070_CR24","doi-asserted-by":"crossref","unstructured":"Kurtz B, Ammann P, Offutt J (2015)\u00a0Static analysis of mutant subsumption. IEEE Eighth International Conference on Software Testing, Verification and Validation Workshops (ICSTW)","DOI":"10.1109\/ICSTW.2015.7107454"},{"key":"6070_CR25","doi-asserted-by":"crossref","unstructured":"Ma YS, Offutt J, Kwon YR (2006)\u00a0MuJava: A Mutation System for Java. In 28th International Conference on Software Engineering (ICSE \u201906)","DOI":"10.1145\/1134285.1134425"},{"issue":"8","key":"6070_CR26","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1016\/j.infsof.2005.07.006","volume":"48","author":"N Malevris","year":"2006","unstructured":"Malevris N, Yates D (2006) The collateral coverage of data flow criteria when branch testing. Inf Softw Technol 48(8):676\u2013686","journal-title":"Inf Softw Technol"},{"issue":"15","key":"6070_CR27","doi-asserted-by":"publisher","first-page":"6676","DOI":"10.1016\/j.eswa.2014.05.009","volume":"41","author":"G Manizheh","year":"2014","unstructured":"Manizheh G, Mohammad-Reza F (2014) Forest Optimization Algorithm. Expert Syst Appl 41(15):6676\u20136687","journal-title":"Expert Syst Appl"},{"issue":"2","key":"6070_CR28","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1145\/227607.227610","volume":"5","author":"AJ Offutt","year":"1996","unstructured":"Offutt AJ, Lee A, Rothermel G, Untch RH, Zapf C (1996) An experimental determination of sufficient mutant operators. ACM Trans Softw Eng Methodol 5(2):99\u2013118","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"6070_CR29","unstructured":"Offutt AJ, Rothermel G, Zapf C\u00a0(1993) An experimental evaluation of selective mutation. Proceedings of the 15th International Conference on Software Engineering, ICSE \u201993. IEEE Computer Society Press, Los Alamitos, CA"},{"key":"6070_CR30","doi-asserted-by":"crossref","unstructured":"Papadakis M, Malevris N (2010)\u00a0An empirical evaluation of the first and second order mutation testing strategies. 2010 Third International Conference on Software Testing, Verification, and Validation Workshops (ICSTW)","DOI":"10.1109\/ICSTW.2010.50"},{"key":"6070_CR31","doi-asserted-by":"publisher","unstructured":"Sankar SS, Chandra SS (2020a) A Structural Testing Model Using SDA Algorithm.\u00a0Lect Notes Comput Sci 405\u2013412.\u00a0https:\/\/doi.org\/10.1007\/978-3-030-53956-6_36","DOI":"10.1007\/978-3-030-53956-6_36"},{"key":"6070_CR32","doi-asserted-by":"publisher","unstructured":"Sankar SS, Chandra SS (2020b) An Ant Colony Optimization Algorithm Based Automated Generation of Software Test Cases.\u00a0Lect Notes Comput Sci\u00a0231\u2013239.\u00a0https:\/\/doi.org\/10.1007\/978-3-030-53956-6_21","DOI":"10.1007\/978-3-030-53956-6_21"},{"key":"6070_CR33","doi-asserted-by":"crossref","unstructured":"Wei C, Yao X, Gong D, Liu H (2021) Spectral clustering based mutant reduction for mutation testing.\u00a0Inf Softw Technol 132(2021):106502","DOI":"10.1016\/j.infsof.2020.106502"},{"key":"6070_CR34","unstructured":"Wong WE (1993) On mutation and data flow. Ph.D. dissertation, Purdue University"},{"issue":"4","key":"6070_CR35","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1109\/tse.2020.3014960","volume":"48","author":"X Yao","year":"2020","unstructured":"Yao X, Zhang G, Pan F, Gong D, Wei C (2020) Orderly Generation of Test Data via Sorting Mutant Branches Based on Their Dominance Degrees for Weak Mutation Testing. IEEE Trans Software Eng 48(4):1169\u20131184. https:\/\/doi.org\/10.1109\/tse.2020.3014960","journal-title":"IEEE Trans Software Eng"},{"key":"6070_CR36","doi-asserted-by":"crossref","unstructured":"Zhang L, Hou SS, Hu JJ, Xie T, Mei H (2010)\u00a0Is operator-based mutant selection superior to random mutant selection? Proceedings of the 32Nd ACM\/IEEE International Conference on Software Engineering","DOI":"10.1145\/1806799.1806863"},{"key":"6070_CR37","doi-asserted-by":"crossref","unstructured":"Zhang L, Gligoric M, Marinov D, Khurshid S (2013)\u00a0Operator-based and random mutant selection: better together. Automated Software Engineering (ASE). IEEE\/ACM 28th International Conference","DOI":"10.1109\/ASE.2013.6693070"}],"container-title":["Journal of Electronic Testing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10836-023-06070-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10836-023-06070-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10836-023-06070-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T06:22:08Z","timestamp":1691562128000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10836-023-06070-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["6070"],"URL":"https:\/\/doi.org\/10.1007\/s10836-023-06070-x","relation":{},"ISSN":["0923-8174","1573-0727"],"issn-type":[{"value":"0923-8174","type":"print"},{"value":"1573-0727","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6]]},"assertion":[{"value":"23 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}