{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:41:56Z","timestamp":1743054116737,"version":"3.40.3"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147203"},{"type":"electronic","value":"9783031147210"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14721-0_1","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Digging into\u00a0Semantics: Where Do Search-Based Software Repair Methods Search?"],"prefix":"10.1007","author":[{"given":"Hammad","family":"Ahmad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Padriac","family":"Cashin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephanie","family":"Forrest","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Westley","family":"Weimer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Ackling, T., Alexander, B., Grunert, I.: Evolving patches for software repair. In: GECCO 2011, Dublin, Ireland, pp. 1427\u20131434. ACM (2011). https:\/\/doi.org\/10.1145\/2001576.2001768","DOI":"10.1145\/2001576.2001768"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"3494","DOI":"10.1016\/j.asoc.2011.01.023","volume":"11","author":"A Arcuri","year":"2011","unstructured":"Arcuri, A.: Evolutionary repair of faulty software. Appl. Soft Comput. 11(4), 3494\u20133514 (2011)","journal-title":"Appl. Soft Comput."},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Beadle, L., Johnson, C.G.: Semantic analysis of program initialisation in genetic programming. Genet. Program. Evolvable Mach. 10(3), 307\u2013337 (2009). https:\/\/doi.org\/10.1007\/s10710-009-9082-5. https:\/\/link.springer.com\/article\/10.1007\/s10710-009-9082-5","DOI":"10.1007\/s10710-009-9082-5"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Cashin, P., Martinez, C., Weimer, W., Forrest, S.: Understanding automatically-generated patches through symbolic invariant differences. In: ASE 2019, San Diego, USA, pp. 411\u2013414. IEEE (November 2019). https:\/\/doi.org\/10.1109\/ASE.2019.00046","DOI":"10.1109\/ASE.2019.00046"},{"key":"1_CR5","unstructured":"Ding, Z.Y.: Patch quality and diversity of invariant-guided search-based program repair. arXiv (March 2020). https:\/\/arxiv.org\/abs\/2003.11667v1"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Ding, Z.Y., Lyu, Y., Timperley, C., Le Goues, C.: Leveraging program invariants to promote population diversity in search-based automatic program repair. In: 2019 IEEE\/ACM International Workshop on Genetic Improvement (GI), pp. 2\u20139. IEEE (2019)","DOI":"10.1109\/GI.2019.00011"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Natural Computing Series, vol. 53. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-662-05094-1","DOI":"10.1007\/978-3-662-05094-1"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Ernst, M.D., Czeisler, A., Griswold, W.G., Notkin, D.: Quickly detecting relevant program invariants. In: Proceedings of the 22nd International Conference on Software Engineering, pp. 449\u2013458 (2000)","DOI":"10.1145\/337180.337240"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Ernst, M.D., et al.: The Daikon system for dynamic detection of likely invariants. Sci. Comput. Program. 69(1\u20133), 35\u201345 (2007). https:\/\/doi.org\/10.1016\/j.scico.2007.01.015","DOI":"10.1016\/j.scico.2007.01.015"},{"issue":"6","key":"1_CR10","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1049\/ip-sen:19982444","volume":"145","author":"R Feldt","year":"1998","unstructured":"Feldt, R.: Generating diverse software versions with genetic programming: an experimental study. IEE Proc. Softw. 145(6), 228\u2013236 (1998)","journal-title":"IEE Proc. Softw."},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Fry, Z.P., Landau, B., Weimer, W.: A human study of patch maintainability. In: ISSTA 2012, Minneapolis, USA, p. 177. ACM (2012). https:\/\/doi.org\/10.1145\/2338965.2336775. http:\/\/dl.acm.org\/citation.cfm?doid=2338965.2336775","DOI":"10.1145\/2338965.2336775"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/TSE.2017.2755013","volume":"45","author":"L Gazzola","year":"2017","unstructured":"Gazzola, L., Micucci, D., Mariani, L.: Automatic software repair: a survey. IEEE Trans. Softw. Eng. 45(1), 34\u201367 (2017). https:\/\/doi.org\/10.1109\/TSE.2017.2755013","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"4","key":"1_CR13","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10710-019-09355-3","volume":"20","author":"N Harrand","year":"2019","unstructured":"Harrand, N., Allier, S., Rodriguez-Cancio, M., Monperrus, M., Baudry, B.: A journey among Java neutral program variants. Genet. Program Evolvable Mach. 20(4), 531\u2013580 (2019). https:\/\/doi.org\/10.1007\/s10710-019-09355-3","journal-title":"Genet. Program Evolvable Mach."},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Jiang, J., Xiong, Y., Zhang, H., Gao, Q., Chen, X.: Shaping program repair space with existing patches and similar code. In: ISSTA 2018, Amsterdam, Netherlands, vol. 18, pp. 298\u2013309. ACM (July 2018). https:\/\/doi.org\/10.1145\/3213846.3213871. https:\/\/dl.acm.org\/doi\/10.1145\/3213846.3213871","DOI":"10.1145\/3213846.3213871"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Just, R., Jalali, D., Ernst, M.D.: Defects4J: a database of existing faults to enable controlled testing studies for Java programs. In: ISSTA 2014, San Jose, USA, pp. 437\u2013440. ACM (July 2014). https:\/\/doi.org\/10.1145\/2610384.2628055. http:\/\/dl.acm.org\/citation.cfm?doid=2610384.2628055","DOI":"10.1145\/2610384.2628055"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Kou, R., Higo, Y., Kusumoto, S.: A capable crossover technique on automatic program repair. In: IWESEP 2016, Osaka, Japan, pp. 45\u201350. IEEE (2016). https:\/\/doi.org\/10.1109\/IWESEP.2016.15","DOI":"10.1109\/IWESEP.2016.15"},{"issue":"4","key":"1_CR17","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1093\/comjnl\/9.4.373","volume":"9","author":"GN Lance","year":"1967","unstructured":"Lance, G.N., Williams, W.T.: A general theory of classificatory sorting strategies: 1. Hierarchical systems. Comput. J. 9(4), 373\u2013380 (1967)","journal-title":"Comput. J."},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-319-55696-3_7","volume-title":"Genetic Programming","author":"WB Langdon","year":"2017","unstructured":"Langdon, W.B., Veerapen, N., Ochoa, G.: Visualising the search landscape of the triangle program. In: McDermott, J., Castelli, M., Sekanina, L., Haasdijk, E., Garc\u00eda-S\u00e1nchez, P. (eds.) EuroGP 2017. LNCS, vol. 10196, pp. 96\u2013113. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55696-3_7"},{"issue":"5","key":"1_CR19","doi-asserted-by":"publisher","first-page":"3007","DOI":"10.1007\/s10664-017-9577-2","volume":"23","author":"XBD Le","year":"2018","unstructured":"Le, X.B.D., Thung, F., Lo, D., Goues, C.L.: Overfitting in semantics-based automated program repair. Empir. Softw. Eng. 23(5), 3007\u20133033 (2018)","journal-title":"Empir. Softw. Eng."},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Le Goues, C., Dewey-Vogt, M., Forrest, S., Weimer, W.: A systematic study of automated program repair: fixing 55 out of 105 bugs for \\$8 each. In: ICSE 2012, Z\u00fcrich, Switzerland, pp. 3\u201313. IEEE (2012). https:\/\/doi.org\/10.1109\/ICSE.2012.6227211","DOI":"10.1109\/ICSE.2012.6227211"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Le Goues, C., et al.: The ManyBugs and IntroClass benchmarks for automated repair of C programs. IEEE Trans. Softw. Eng. 41(12), 1236\u20131256 (2015)","DOI":"10.1109\/TSE.2015.2454513"},{"issue":"1","key":"1_CR22","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TSE.2011.104","volume":"38","author":"C Le Goues","year":"2012","unstructured":"Le Goues, C., Nguyen, T., Forrest, S., Weimer, W.: GenProg: a genetic method for automatic software repair. IEEE Trans. Softw. Eng. 38(1), 54\u201372 (2012). https:\/\/doi.org\/10.1109\/TSE.2011.104","journal-title":"IEEE Trans. Softw. Eng."},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Le Goues, C., Pradel, M., Roychoudhury, A.: Automated program repair (December 2019). https:\/\/doi.org\/10.1145\/3318162. https:\/\/dl.acm.org\/doi\/10.1145\/3318162","DOI":"10.1145\/3318162"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Le Goues, C., Weimer, W., Forrest, S.: Representations and operators for improving evolutionary software repair. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, pp. 959\u2013966 (2012)","DOI":"10.1145\/2330163.2330296"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Liu, K., Koyuncu, A., Kim, D., Bissyand\u00e9, T.F.: TBAR: revisiting template-based automated program repair. In: ISSTA 2019, Beijing, China, pp. 43\u201354. ACM (July 2019). https:\/\/doi.org\/10.1145\/3293882.3330577. https:\/\/dl.acm.org\/doi\/10.1145\/3293882.3330577","DOI":"10.1145\/3293882.3330577"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"110817","DOI":"10.1016\/j.jss.2020.110817","volume":"171","author":"K Liu","year":"2021","unstructured":"Liu, K., et al.: A critical review on the evaluation of automated program repair systems. J. Syst. Softw. 171, 110817 (2021)","journal-title":"J. Syst. Softw."},{"key":"1_CR27","doi-asserted-by":"publisher","unstructured":"Long, F., Amidon, P., Rinard, M.: Automatic inference of code transforms for patch generation. In: ESEC\/FSE 2017, Paderborn, Germany, vol. Part F1301, pp. 727\u2013739. ACM (August 2017). https:\/\/doi.org\/10.1145\/3106237.3106253. https:\/\/dl.acm.org\/doi\/10.1145\/3106237.3106253","DOI":"10.1145\/3106237.3106253"},{"key":"1_CR28","unstructured":"Long, F., Rinard, M.: Prophet: automatic patch generation via learning from successful patches. Technical report, MIT-CSAIL (July 2015). www.csail.mit.edu"},{"key":"1_CR29","doi-asserted-by":"publisher","unstructured":"Long, F., Rinard, M.: Staged program repair with condition synthesis. In: ESEC\/FSE 2015, Bergamo, Italy, pp. 166\u2013178. ACM (August 2015). https:\/\/doi.org\/10.1145\/2786805.2786811. https:\/\/dl.acm.org\/doi\/10.1145\/2786805.2786811","DOI":"10.1145\/2786805.2786811"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Long, F., Rinard, M.: An analysis of the search spaces for generate and validate patch generation systems. In: ICSE 2016, Austin, Texas, May, vol. 14\u201322, pp. 702\u2013713. IEEE Computer Society (May 2016). https:\/\/doi.org\/10.1145\/2884781.2884872","DOI":"10.1145\/2884781.2884872"},{"issue":"1","key":"1_CR31","first-page":"17","volume":"51","author":"M Monperrus","year":"2018","unstructured":"Monperrus, M.: Automatic software repair: a bibliography. ACM Comput. Surv. (CSUR) 51(1), 17 (2018)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"1_CR32","doi-asserted-by":"publisher","unstructured":"Motwani, M., Sankaranarayanan, S., Just, R., Brun, Y.: Do automated program repair techniques repair hard and important bugs? Empir. Softw. Eng. 23(5), 2901\u20132947 (2018). https:\/\/doi.org\/10.1007\/s10664-017-9550-0. https:\/\/link.springer.com\/article\/10.1007\/s10664-017-9550-0","DOI":"10.1007\/s10664-017-9550-0"},{"key":"1_CR33","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1109\/TSE.2020.2998785","volume":"48","author":"M Motwani","year":"2020","unstructured":"Motwani, M., Soto, M., Brun, Y., Just, R., Le Goues, C.: Quality of automated program repair on real-world defects. IEEE Trans. Softw. Eng. 48, 637\u2013661 (2020)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Nilizadeh, A., Leavens, G.T., Le, X.B.D., P\u0103s\u0103reanu, C.S., Cok, D.R.: Exploring true test overfitting in dynamic automated program repair using formal methods. In: 2021 14th IEEE Conference on Software Testing, Verification and Validation (ICST), pp. 229\u2013240. IEEE (2021)","DOI":"10.1109\/ICST49551.2021.00033"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Orlov, M., Sipper, M.: Genetic programming in the wild: evolving unrestricted bytecode. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 1043\u20131050 (2009)","DOI":"10.1145\/1569901.1570042"},{"key":"1_CR36","doi-asserted-by":"publisher","unstructured":"Petke, J., Brownlee, A.E.I., Alexander, B., Wagner, M., Barr, E.T., White, D.R.: A survey of genetic improvement search spaces. In: GECCO 2019, Prague, Czech Republic, pp. 1715\u20131721. ACM (July 2019). https:\/\/doi.org\/10.1145\/3319619.3326870. https:\/\/dl.acm.org\/doi\/10.1145\/3319619.3326870","DOI":"10.1145\/3319619.3326870"},{"key":"1_CR37","doi-asserted-by":"publisher","unstructured":"Qi, Y., Mao, X., Lei, Y., Dai, Z., Wang, C.: The strength of random search on automated program repair. In: ICSE 2014, Hyderabad, India, pp. 254\u2013265. ACM (2014). https:\/\/doi.org\/10.1145\/2568225.2568254","DOI":"10.1145\/2568225.2568254"},{"key":"1_CR38","doi-asserted-by":"publisher","unstructured":"Qi, Z., Long, F., Achour, S., Rinard, M.: An analysis of patch plausibility and correctness for generate-and-validate patch generation systems. In: ISSTA 2015, Baltimore, USA, pp. 24\u201336. ACM (2015). https:\/\/doi.org\/10.1145\/2771783.2771791","DOI":"10.1145\/2771783.2771791"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Renzullo, J., Weimer, W., Forrest, S.: Multiplicative weights algorithms for parallel automated software repair. In: 35th IEEE International Parallel and Distributed Processing Symposium (2021)","DOI":"10.1109\/IPDPS49936.2021.00107"},{"key":"1_CR40","doi-asserted-by":"publisher","unstructured":"Renzullo, J., Weimer, W., Moses, M., Forrest, S.: Neutrality and epistasis in program space. In: ICSE 2018, Gothenburg, Sweden, vol. 18, pp. 1\u20138. IEEE Computer Society (June 2018). https:\/\/doi.org\/10.1145\/3194810.3194812. https:\/\/dl.acm.org\/doi\/10.1145\/3194810.3194812","DOI":"10.1145\/3194810.3194812"},{"key":"1_CR41","doi-asserted-by":"publisher","unstructured":"Schulte, E., Forrest, S., Weimer, W.: Automated program repair through the evolution of assembly code. In: ASE 2010, Antwerp, Belgium, pp. 313\u2013316. ACM (2010). https:\/\/doi.org\/10.1145\/1858996.1859059. http:\/\/portal.acm.org\/citation.cfm?doid=1858996.1859059","DOI":"10.1145\/1858996.1859059"},{"key":"1_CR42","doi-asserted-by":"publisher","unstructured":"Schulte, E., Fry, Z.P., Fast, E., Weimer, W., Forrest, S.: Software mutational robustness. Genet. Program. Evolvable Mach. 15(3), 281\u2013312 (2014). https:\/\/doi.org\/10.1007\/s10710-013-9195-8. https:\/\/link.springer.com\/article\/10.1007\/s10710-013-9195-8","DOI":"10.1007\/s10710-013-9195-8"},{"key":"1_CR43","doi-asserted-by":"publisher","unstructured":"Smith, E.K., Barr, E.T., Le Goues, C., Brun, Y.: Is the cure worse than the disease? Overfitting in automated program repair. In: ESEC\/FSE 2015, Bergamo, Italy, pp. 532\u2013543. ACM (2015). https:\/\/doi.org\/10.1145\/2786805.2786825","DOI":"10.1145\/2786805.2786825"},{"key":"1_CR44","doi-asserted-by":"crossref","unstructured":"Soto, M.: Improving patch quality by enhancing key components of automatic program repair. In: 2019 34th IEEE\/ACM International Conference on Automated Software Engineering (ASE), pp. 1230\u20131233. IEEE (2019)","DOI":"10.1109\/ASE.2019.00147"},{"key":"1_CR45","doi-asserted-by":"publisher","unstructured":"Staats, M., Hong, S., Kim, M., Rothermel, G.: Understanding user understanding: determining correctness of generated program invariants. In: ISSTA 2012, Minneapolis, MN, p. 188. ACM (2012). https:\/\/doi.org\/10.1145\/2338965.2336776. http:\/\/dl.acm.org\/citation.cfm?doid=2338965.2336776","DOI":"10.1145\/2338965.2336776"},{"key":"1_CR46","doi-asserted-by":"publisher","unstructured":"Tan, S.H., Yoshida, H., Prasad, M.R., Roychoudhury, A.: Anti-patterns in search-based program repair. In: ESEC\/FSE 2016, November, vol. 13\u201318, pp. 727\u2013738. ACM, New York (November 2016). https:\/\/doi.org\/10.1145\/2950290.2950295. https:\/\/dl.acm.org\/doi\/10.1145\/2950290.2950295","DOI":"10.1145\/2950290.2950295"},{"key":"1_CR47","doi-asserted-by":"publisher","unstructured":"Urli, S., Yu, Z., Seinturier, L., Monperrus, M., Monperrus, M.: How to design a program repair bot? Insights from the repairnator project. In: ICSE-SEIP 2018, vol. 10 (2018). https:\/\/doi.org\/10.1145\/3183519","DOI":"10.1145\/3183519"},{"key":"1_CR48","doi-asserted-by":"publisher","unstructured":"Veerapen, N., Daolio, F., Ochoa, G.: Modelling genetic improvement landscapes with local optima networks. In: GECCO 2017, vol. 6, pp. 1543\u20131548. ACM, New York (July 2017). https:\/\/doi.org\/10.1145\/3067695.3082518. https:\/\/dl.acm.org\/doi\/10.1145\/3067695.3082518","DOI":"10.1145\/3067695.3082518"},{"key":"1_CR49","doi-asserted-by":"publisher","unstructured":"Veerapen, N., Ochoa, G.: Visualising the global structure of search landscapes: genetic improvement as a case study. Genet. Program. Evolvable Mach. 19(3), 317\u2013349 (September 2018). https:\/\/doi.org\/10.1007\/s10710-018-9328-1","DOI":"10.1007\/s10710-018-9328-1"},{"issue":"2","key":"1_CR50","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1145\/358024.358057","volume":"26","author":"I Vessey","year":"1983","unstructured":"Vessey, I., Weber, R.: Some factors affecting program repair maintenance: an empirical study. Commun. ACM 26(2), 128\u2013134 (1983)","journal-title":"Commun. ACM"},{"key":"1_CR51","doi-asserted-by":"publisher","unstructured":"Villanueva, O.M., Trujillo, L., Hernandez, D.E.: Novelty search for automatic bug repair. In: GECCO 2020, Cancun, Mexico, pp. 1021\u20131028. ACM (2020). https:\/\/doi.org\/10.1145\/3377930.3389845. https:\/\/dl.acm.org\/doi\/10.1145\/3377930.3389845","DOI":"10.1145\/3377930.3389845"},{"key":"1_CR52","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1145\/3324884.3416590","volume":"2020","author":"S Wang","year":"2020","unstructured":"Wang, S., et al.: Automated patch correctness assessment: how far are we? ASE 2020, 968\u2013980 (2020). https:\/\/doi.org\/10.1145\/3324884.3416590","journal-title":"ASE"},{"key":"1_CR53","doi-asserted-by":"publisher","unstructured":"Weimer, W., Fry, Z.P., Forrest, S.: Leveraging program equivalence for adaptive program repair: models and first results. In: ASE 2013, Silicon Valley, USA, pp. 356\u2013366. IEEE (2013). https:\/\/doi.org\/10.1109\/ASE.2013.6693094","DOI":"10.1109\/ASE.2013.6693094"},{"key":"1_CR54","doi-asserted-by":"publisher","unstructured":"Weimer, W., Nguyen, T., Le Goues, C., Forrest, S.: Automatically finding patches using genetic programming. In: ICSE 2009, Vancouver, Canada, pp. 364\u2013367. IEEE (2009). https:\/\/doi.org\/10.1109\/ICSE.2009.5070536","DOI":"10.1109\/ICSE.2009.5070536"},{"key":"1_CR55","doi-asserted-by":"publisher","unstructured":"Wen, M., Chen, J., Wu, R., Hao, D., Cheung, S.C.: Context-aware patch generation for better automated program repair. In: ICSE 2018, Pittsburgh, Pennsylvania, January, vol. 2018, pp. 1\u201311. IEEE Computer Society (2018). https:\/\/doi.org\/10.1145\/3180155.3180233","DOI":"10.1145\/3180155.3180233"},{"key":"1_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-030-04272-1_3","volume-title":"Software Analysis, Testing, and Evolution","author":"D Yang","year":"2018","unstructured":"Yang, D., Qi, Y., Mao, X.: Evaluating the strategies of statement selection in automated program repair. In: Bu, L., Xiong, Y. (eds.) SATE 2018. LNCS, vol. 11293, pp. 33\u201348. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04272-1_3"},{"key":"1_CR57","series-title":"Genetic and Evolutionary Computation","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-030-39831-6_26","volume-title":"Evolution in Action: Past, Present and Future","author":"Y Yuan","year":"2020","unstructured":"Yuan, Y., Banzhaf, W.: Making better use of repair templates in automated program repair: a multi-objective approach. In: Evolution in Action: Past, Present and Future. GEC, pp. 385\u2013407. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39831-6_26"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14721-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:47:13Z","timestamp":1710262033000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.75","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}