{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T08:07:35Z","timestamp":1777536455373,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Electron Test"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s10836-022-06008-9","type":"journal-article","created":{"date-parts":[[2022,6,29]],"date-time":"2022-06-29T08:03:00Z","timestamp":1656489780000},"page":"289-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A Source-code Aware Method for Software Mutation Testing Using Artificial Bee Colony Algorithm"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5202-6315","authenticated-orcid":false,"given":"Bahman","family":"Arasteh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Parisa","family":"Imanzadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keyvan","family":"Arasteh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farhad Soleimanian","family":"Gharehchopogh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bagher","family":"Zarei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,29]]},"reference":[{"key":"6008_CR1","volume-title":"Mutation Analysis","author":"A Acree","year":"1980","unstructured":"Acree A, Budd T, DeMillo R, Lipton R, Sayward F (1980) Mutation Analysis. School of Information and Computer Science, Georgia Institute of Technology"},{"issue":"6","key":"6008_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 Softw Eng Knowl Eng 27(6):2017","journal-title":"Int J Softw Eng Knowl Eng"},{"key":"6008_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.compeleceng.2019.07.006","volume":"78","author":"B Arasteh","year":"2019","unstructured":"Arasteh B (2019) ReDup: A software-based method for detecting soft-error using data analysis. Comput Electr Eng 78:89\u2013107","journal-title":"Comput Electr Eng"},{"key":"6008_CR4","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"},{"issue":"2","key":"6008_CR5","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. Softw Test Verification Reliab 11(2):113\u2013136","journal-title":"Softw Test Verification Reliab"},{"key":"6008_CR6","volume-title":"Mutation Analysis of Program Test Data","author":"TA Budd","year":"1980","unstructured":"Budd TA (1980) Mutation Analysis of Program Test Data. Yale University"},{"key":"6008_CR7","doi-asserted-by":"publisher","unstructured":"Cutigi F, Viola Pizzoleto A, Offutt J (2018) A Systematic Review of Cost Reduction Techniques for Mutation Testing: Preliminary Results. In: Proc. IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW), pp 1\u201310. https:\/\/doi.org\/10.1109\/ICSTW.2018.00021","DOI":"10.1109\/ICSTW.2018.00021"},{"issue":"2018","key":"6008_CR8","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":"6008_CR9","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":"6008_CR10","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"},{"issue":"8","key":"6008_CR11","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1109\/32.879815","volume":"26","author":"NE Fenton","year":"2000","unstructured":"Fenton NE, Ohlsson N (2000) Quantitative analysis of faults and failures in a complex software system. IEEE Trans Softw Eng 26(8):797\u2013814","journal-title":"IEEE Trans Softw Eng"},{"key":"6008_CR12","doi-asserted-by":"publisher","first-page":"e2228","DOI":"10.1002\/smr.2228","volume":"32","author":"A Ghaemi","year":"2020","unstructured":"Ghaemi A, Arasteh B (2020) SFLA-based heuristic method to generate software structural test data. J Softw Evol Proc 32:e2228. https:\/\/doi.org\/10.1002\/smr.2228","journal-title":"J Softw Evol Proc"},{"key":"6008_CR13","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1007\/s10586-020-03187-y","volume":"24","author":"S Gharehpasha","year":"2021","unstructured":"Gharehpasha S, Masdari M, Jafarian A (2021) Power efficient virtual machine placement in cloud data centers with a discrete and chaotic hybrid optimization algorithm. Cluster Comput 24:1293\u20131315. https:\/\/doi.org\/10.1007\/s10586-020-03187-y","journal-title":"Cluster Comput"},{"key":"6008_CR14","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) (2021), Identifying method-level mutation subsumption relations using Z3. Inf Softw Technol 132:106496","journal-title":"Inf Softw Technol"},{"issue":"1","key":"6008_CR15","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 Technol Appl 55(1):118\u2013148. https:\/\/doi.org\/10.1108\/DTA-03-2020-0073","journal-title":"Data Technol Appl"},{"issue":"4","key":"6008_CR16","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 Softw Eng 8(4):371\u2013379","journal-title":"IEEE Trans Softw Eng"},{"key":"6008_CR17","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1007\/s10586-020-03184-1","volume":"24","author":"T Jafarian","year":"2021","unstructured":"Jafarian T, Masdari M, Ghaffari A et al (2021) A survey and classification of the security anomaly detection mechanisms in software defined networks. Cluster Comput 24:1235\u20131253. https:\/\/doi.org\/10.1007\/s10586-020-03184-1","journal-title":"Cluster Comput"},{"key":"6008_CR18","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-540-72950-1_77","volume-title":"Advances in Soft Computing: Foundations of Fuzzy Logic and Soft Computing","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems. Advances in Soft Computing: Foundations of Fuzzy Logic and Soft Computing, vol 4529. Springer, Berlin, pp 789\u2013798"},{"issue":"7","key":"6008_CR19","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1002\/spe.4380210704","volume":"21","author":"KN King","year":"1991","unstructured":"King KN, Offutt AJ (1991) A Fortran language system for mutation-based software testing. Softw Pract Exper 21(7):685\u2013718","journal-title":"Softw Pract Exper"},{"key":"6008_CR20","doi-asserted-by":"crossref","unstructured":"Kintis M, Papadakis M, Malevris N (2010) Evaluating mutation testing alternatives: a collateral experiment. In: Proceedings of the 17th Asia-Pacific Software Engineering Conference (APSEC)","DOI":"10.1109\/APSEC.2010.42"},{"key":"6008_CR21","doi-asserted-by":"crossref","unstructured":"Kurtz B, Ammann P, Delamaro M, Offutt J, Deng L (2014) Mutant subsumption graphs. In: 2014 IEEE Seventh International Conference on Software Testing, Verification and Validation Workshops (ICSTW)","DOI":"10.1109\/ICSTW.2014.20"},{"key":"6008_CR22","doi-asserted-by":"crossref","unstructured":"Kurtz B, Ammann P, Offutt J (2015) Static analysis of mutant subsumption. In: IEEE Eighth International Conference on Software Testing, Verification and Validation Workshops (ICSTW)","DOI":"10.1109\/ICSTW.2015.7107454"},{"key":"6008_CR23","doi-asserted-by":"crossref","unstructured":"Ma YS, Offutt J, Kwon YR (2006) MuJava: A Mutation System for Java. In: 28th International Conference on Software Engineering (ICSE \u201906)","DOI":"10.1145\/1134285.1134425"},{"issue":"8","key":"6008_CR24","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"},{"key":"6008_CR25","doi-asserted-by":"publisher","first-page":"2629","DOI":"10.1007\/s10586-019-03032-x","volume":"23","author":"M Masdari","year":"2020","unstructured":"Masdari M, Khezri H (2020) Efficient VM migrations using forecasting techniques in cloud computing: a comprehensive review. Cluster Comput 23:2629\u20132658. https:\/\/doi.org\/10.1007\/s10586-019-03032-x","journal-title":"Cluster Comput"},{"issue":"2","key":"6008_CR26","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 Trans Softw Eng Methodol"},{"key":"6008_CR27","unstructured":"Offutt AJ, Rothermel G, Zapf C (1993) An experimental evaluation of selective mutation. In: Proceedings of the 15th International Conference on Software Engineering, ICSE \u201993. IEEE Computer Society Press, Los Alamitos, CA"},{"key":"6008_CR28","doi-asserted-by":"crossref","unstructured":"Papadakis M, Malevris N (2010) An empirical evaluation of the first and second order mutation testing strategies. In: 2010 Third International Conference on Software Testing, Verification, and Validation Workshops (ICSTW)","DOI":"10.1109\/ICSTW.2010.50"},{"key":"6008_CR29","doi-asserted-by":"publisher","first-page":"106502","DOI":"10.1016\/j.infsof.2020.106502","volume":"132","author":"C Wei","year":"2021","unstructured":"Wei C, Yao X, Gong D, Liu H (2021) Spectral clustering based mutant reduction for mutation testing. Inf Softw Technol 132:106502","journal-title":"Inf Softw Technol"},{"key":"6008_CR30","volume-title":"On mutation and data flow","author":"WE Wong","year":"1993","unstructured":"Wong WE (1993) On mutation and data flow. Purdue University (Ph.D. dissertation)"},{"key":"6008_CR31","unstructured":"Woodward M, Halewood K (1998) From weak to strong, dead or alive? An analysis of some mutation testing issues. In: Proceedings of the Second Workshop on Software Testing, Verification, and Analysis"},{"key":"6008_CR32","doi-asserted-by":"crossref","unstructured":"Zhang L, Gligoric M, Marinov D, Khurshid S (2013) Operator-based and random mutant selection: better together. In: Proc. IEEE\/ACM 28th International Conference on Automated Software Engineering (ASE)","DOI":"10.1109\/ASE.2013.6693070"},{"key":"6008_CR33","doi-asserted-by":"crossref","unstructured":"Zhang L, Hou S-S, Hu J-J, Xie T, Mei H (2010) Is operator-based mutant selection superior to random mutant selection? In: Proceedings of the 32nd ACM\/IEEE International Conference on Software Engineering","DOI":"10.1145\/1806799.1806863"}],"container-title":["Journal of Electronic Testing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10836-022-06008-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10836-022-06008-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10836-022-06008-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,27]],"date-time":"2022-08-27T08:14:42Z","timestamp":1661588082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10836-022-06008-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["6008"],"URL":"https:\/\/doi.org\/10.1007\/s10836-022-06008-9","relation":{},"ISSN":["0923-8174","1573-0727"],"issn-type":[{"value":"0923-8174","type":"print"},{"value":"1573-0727","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6]]},"assertion":[{"value":"6 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2022","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 authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interests"}}]}}