{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:58:58Z","timestamp":1750309138497,"version":"3.41.0"},"reference-count":94,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T00:00:00Z","timestamp":1702339200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CCF 2211749, CCF 2211750, CICI 2115075"],"award-info":[{"award-number":["CCF 2211749, CCF 2211750, CICI 2115075"]}]},{"DOI":"10.13039\/100000185","name":"DARPA","doi-asserted-by":"crossref","award":["FA8750-19C-0003, N6600120C4020"],"award-info":[{"award-number":["FA8750-19C-0003, N6600120C4020"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100006602","name":"AFRL","doi-asserted-by":"crossref","award":["FA8750-19-1-0501"],"award-info":[{"award-number":["FA8750-19-1-0501"]}],"id":[{"id":"10.13039\/100006602","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100011419","name":"Santa Fe Institute","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100011419","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Evol. Learn. Optim."],"published-print":{"date-parts":[[2023,12,31]]},"abstract":"<jats:p>Evolutionary algorithms and related mutation-based methods have been used in software engineering, with recent emphasis on the problem of repairing bugs. In this work, programs are typically not synthesized from a random start. Instead, existing solutions\u2014which may be flawed or inefficient\u2014are taken as starting points, with the evolutionary process searching for useful improvements. This approach, however, introduces a challenge for the search algorithm: what is the optimal number of neutral mutations that should be combined? Too much is likely to introduce errors and break the program while too little hampers the search process, inducing the classic tradeoff between exploration and exploitation.<\/jats:p>\n          <jats:p>In the context of software improvement, this work considers MWRepair, an algorithm for enhancing mutation-based searches, which uses online learning to optimize the tradeoff between exploration and exploitation. The aggressiveness parameter governs how many individual mutations should be applied simultaneously to an individual between fitness evaluations. MWRepair is evaluated in the context of automated program repair problems, where the goal is repairing software bugs with minimal human involvement. The article analyzes the search space for automated program repair induced by neutral mutations, finding that the greatest probability of finding successful repairs often occurs when many neutral mutations are applied to the original program. Moreover, repair probability follows a characteristic, unimodal distribution. MWRepair uses online learning to leverage this property, finding both rare and multi-edit repairs to defects in the popular Defects4J benchmark set of buggy Java programs.<\/jats:p>","DOI":"10.1145\/3597617","type":"journal-article","created":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T11:58:51Z","timestamp":1684843131000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Evolving Software: Combining Online Learning with Mutation-Based Stochastic Search"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-2534-8700","authenticated-orcid":false,"given":"Joseph","family":"Renzullo","sequence":"first","affiliation":[{"name":"Arizona State University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6749-2204","authenticated-orcid":false,"given":"Westley","family":"Weimer","sequence":"additional","affiliation":[{"name":"University of Michigan, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5904-1646","authenticated-orcid":false,"given":"Stephanie","family":"Forrest","sequence":"additional","affiliation":[{"name":"Arizona State University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,12,12]]},"reference":[{"key":"e_1_3_4_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2019.2944914"},{"key":"e_1_3_4_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-021-09989-x"},{"key":"e_1_3_4_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1370175.1370223"},{"key":"e_1_3_4_5_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a006"},{"key":"e_1_3_4_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/548530"},{"key":"e_1_3_4_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-28111-8_14"},{"key":"e_1_3_4_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2610384.2610415"},{"key":"e_1_3_4_9_1","unstructured":"B. Baudry S. Allier M. Rodriguez-Cancio and M. Monperrus. 2015. Automatic software diversity in the light of test suites. arXiv:1509.00144 (2015)."},{"key":"e_1_3_4_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2018.2827066"},{"key":"e_1_3_4_11_1","doi-asserted-by":"publisher","unstructured":"P. Cashin C. Martinez W. Weimer and S. Forrest. 2019. Understanding automatically-generated patches through symbolic invariant differences. In Proceedings of the 2019 34th IEEE\/ACM International Conference on Automated Software Engineering. IEEE Los Alamitos CA 411\u2013414. 10.1109\/ASE.2019.00046","DOI":"10.1109\/ASE.2019.00046"},{"key":"e_1_3_4_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2017.8115674"},{"key":"e_1_3_4_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2019.2940179"},{"key":"e_1_3_4_14_1","unstructured":"B. Cornu T. Durieux L. Seinturier and M. Monperrus. 2015. NPEFix: Automatic runtime repair of null pointer exceptions in Java. arXiv:1512.07423 (2015)."},{"key":"e_1_3_4_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205566"},{"key":"e_1_3_4_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338906.3338911"},{"key":"e_1_3_4_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2896921.2896931"},{"key":"e_1_3_4_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2017.2755013"},{"key":"e_1_3_4_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806799.1806812"},{"key":"e_1_3_4_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-88106-1_12"},{"key":"e_1_3_4_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-019-09355-3"},{"key":"e_1_3_4_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3379597.3387504"},{"key":"e_1_3_4_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN-W.2016.63"},{"key":"e_1_3_4_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3264600"},{"key":"e_1_3_4_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2010.62"},{"key":"e_1_3_4_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2019.00033"},{"key":"e_1_3_4_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3213846.3213871"},{"key":"e_1_3_4_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE43902.2021.00107"},{"key":"e_1_3_4_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2610384.2628055"},{"key":"e_1_3_4_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-019-09742-5"},{"key":"e_1_3_4_31_1","doi-asserted-by":"publisher","DOI":"10.1038\/217624a0"},{"key":"e_1_3_4_32_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511623486"},{"key":"e_1_3_4_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-019-09780-z"},{"key":"e_1_3_4_34_1","series-title":"Complex Adaptive Systems","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"Koza J. R.","year":"1992","unstructured":"J. R. Koza. 1992. Genetic Programming: On the Programming of Computers by Means of Natural Selection. Complex Adaptive Systems, Vol. 1. MIT Press, Cambridge, MA."},{"key":"e_1_3_4_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2010.07.027"},{"key":"e_1_3_4_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55696-3_7"},{"key":"e_1_3_4_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2019.00064"},{"key":"e_1_3_4_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SANER.2016.76"},{"key":"e_1_3_4_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2015.2454513"},{"key":"e_1_3_4_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2011.104"},{"key":"e_1_3_4_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318162"},{"key":"e_1_3_4_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377811.3380345"},{"key":"e_1_3_4_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3510003.3510177"},{"key":"e_1_3_4_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2019.00020"},{"key":"e_1_3_4_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293882.3330577"},{"key":"e_1_3_4_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/SANER.2019.8667970"},{"key":"e_1_3_4_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/APSEC.2018.00085"},{"key":"e_1_3_4_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2020.110817"},{"key":"e_1_3_4_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377811.3380338"},{"key":"e_1_3_4_50_1","volume-title":"Prophet: Automatic Patch Generation via Learning from Successful Patches","author":"Long F.","year":"2015","unstructured":"F. Long and M. Rinard. 2015a. Prophet: Automatic Patch Generation via Learning from Successful Patches. Technical Report MIT-CSAIL-TR-2015-027. CSAIL, Massachusetts Institute of Technology, Cambridge, MA."},{"key":"e_1_3_4_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2786811"},{"key":"e_1_3_4_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884872"},{"key":"e_1_3_4_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3395363.3397369"},{"key":"e_1_3_4_54_1","doi-asserted-by":"publisher","DOI":"10.1137\/0111030"},{"key":"e_1_3_4_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-013-9282-8"},{"key":"e_1_3_4_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2931037.2948705"},{"key":"e_1_3_4_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99241-9_3"},{"key":"e_1_3_4_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3241980"},{"key":"e_1_3_4_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884807"},{"key":"e_1_3_4_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3105906"},{"key":"e_1_3_4_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2014.28"},{"key":"e_1_3_4_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319619.3326870"},{"key":"e_1_3_4_63_1","doi-asserted-by":"publisher","DOI":"10.1038\/nrg2452"},{"key":"e_1_3_4_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2393596.2393634"},{"key":"e_1_3_4_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2013.29"},{"key":"e_1_3_4_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/2771783.2771791"},{"key":"e_1_3_4_67_1","doi-asserted-by":"publisher","unstructured":"X. Ren F. Shah F. Tip B. G. Ryder and O. Chesley. 2004. Chianti: A tool for change impact analysis of Java programs. In ACM SIGPLAN Notices 39 10 (2004) 432\u2013448. 10.1145\/1028976.1029012","DOI":"10.1145\/1028976.1029012"},{"key":"e_1_3_4_68_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS49936.2021.00107"},{"key":"e_1_3_4_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3194810.3194812"},{"key":"e_1_3_4_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2017.8115675"},{"key":"e_1_3_4_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2019.00020"},{"key":"e_1_3_4_72_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-013-9195-8"},{"key":"e_1_3_4_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/SANER.2018.8330203"},{"key":"e_1_3_4_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183440.3195050"},{"key":"e_1_3_4_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/3067695.3082518"},{"key":"e_1_3_4_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3389845"},{"key":"e_1_3_4_77_1","volume-title":"Robustness and Evolvability in Living Systems","author":"Wagner A.","year":"2007","unstructured":"A. Wagner. 2007. Robustness and Evolvability in Living Systems. Princeton University Press, Princeton, NJ."},{"key":"e_1_3_4_78_1","doi-asserted-by":"publisher","DOI":"10.1109\/ESEM.2019.8870172"},{"key":"e_1_3_4_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/3324884.3416590"},{"key":"e_1_3_4_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2013.6693094"},{"key":"e_1_3_4_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2009.5070536"},{"key":"e_1_3_4_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/3180155.3180233"},{"key":"e_1_3_4_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/3468264.3468600"},{"key":"e_1_3_4_84_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2017.8115676"},{"key":"e_1_3_4_85_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2017.45"},{"key":"e_1_3_4_86_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2020.2987862"},{"key":"e_1_3_4_87_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2016.2560811"},{"key":"e_1_3_4_88_1","doi-asserted-by":"publisher","DOI":"10.1109\/SANER50967.2021.00018"},{"key":"e_1_3_4_89_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2020.110825"},{"key":"e_1_3_4_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/3551349.3556926"},{"key":"e_1_3_4_91_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-020-09920-w"},{"key":"e_1_3_4_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/3510003.3510222"},{"key":"e_1_3_4_93_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2018.2874648"},{"key":"e_1_3_4_94_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39831-6_26"},{"key":"e_1_3_4_95_1","doi-asserted-by":"publisher","unstructured":"A. Zeller. 1999. Yesterday my program worked. Today it does not. Why?ACM SIGSOFT Software Engineering Notes 24 6 (1999) 253\u2013267. 10.1007\/3-540-48166-4_16","DOI":"10.1007\/3-540-48166-4_16"}],"container-title":["ACM Transactions on Evolutionary Learning and Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597617","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3597617","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3597617","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:50:13Z","timestamp":1750287013000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597617"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,12]]},"references-count":94,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,12,31]]}},"alternative-id":["10.1145\/3597617"],"URL":"https:\/\/doi.org\/10.1145\/3597617","relation":{},"ISSN":["2688-299X","2688-3007"],"issn-type":[{"type":"print","value":"2688-299X"},{"type":"electronic","value":"2688-3007"}],"subject":[],"published":{"date-parts":[[2023,12,12]]},"assertion":[{"value":"2022-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-05-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-12-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}