{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T08:03:12Z","timestamp":1784793792274,"version":"3.55.0"},"publisher-location":"Cham","reference-count":67,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032325181","type":"print"},{"value":"9783032325198","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T00:00:00Z","timestamp":1784851200000},"content-version":"vor","delay-in-days":204,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We present a new Programming-by-Examples (PBE) approach to repairing regex-dependent string-manipulation programs. Our approach has the following key features: (1) the support for a\n                    <jats:italic>wide range of functions<\/jats:italic>\n                    including regex-dependent functions such as , , , list manipulation functions such as , , , and numerical functions such as , , , (2) the support for\n                    <jats:italic>real-world regexes<\/jats:italic>\n                    with non-standard semantics such as greedy\/lazy Kleene star and extensions such as lookarounds and backreferences, (3) the focus on a\n                    <jats:italic>method-chaining style<\/jats:italic>\n                    that starts the chain of calls with a regex-dependent function, reflecting a code style used in the real-world, and (4) novel\n                    <jats:italic>origin-enriched<\/jats:italic>\n                    examples that allow users to communicate\n                    <jats:italic>intensional<\/jats:italic>\n                    behavior of programs in addition to the standard extension behavior communicated via ordinary input-output examples, and a novel\n                    <jats:italic>origin-tracking<\/jats:italic>\n                    semantics that formally defines when a program conforms to the behavior stipulated by such examples. We have implemented our approach as a tool named  and evaluated it on real-world benchmarks collected from GitHub and StackOverflow. The results show that  finds high-quality repairs efficiently.\n                  <\/jats:p>","DOI":"10.1007\/978-3-032-32519-8_14","type":"book-chapter","created":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T07:18:42Z","timestamp":1784791122000},"page":"258-283","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Repairing Regex-Dependent String-Manipulation Programs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9542-9234","authenticated-orcid":false,"given":"Nariyoshi","family":"Chida","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5305-4916","authenticated-orcid":false,"given":"Tachio","family":"Terauchi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,24]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Alur, R., \u010cern\u00fd, P.: Streaming transducers for algorithmic verification of single-pass list-processing programs. In: Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL \u201911, pp. 599\u2013610. Association for Computing Machinery, New York (2011). https:\/\/doi.org\/10.1145\/1926385.1926454","DOI":"10.1145\/1926385.1926454"},{"issue":"3","key":"14_CR2","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0019-9958(78)90683-6","volume":"39","author":"D Angluin","year":"1978","unstructured":"Angluin, D.: On the complexity of minimum inference of regular sets. Inf. Control 39(3), 337\u2013350 (1978). https:\/\/doi.org\/10.1016\/S0019-9958(78)90683-6","journal-title":"Inf. Control"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Arasu, A., Chaudhuri, S., Kaushik, R.: Learning string transformations from examples. Proc. VLDB Endow. 2(1), 514\u2013525 (2009). https:\/\/doi.org\/10.14778\/1687627.1687686","DOI":"10.14778\/1687627.1687686"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Barke, S., Peleg, H., Polikarpova, N.: Just-in-time learning for bottom-up enumerative synthesis. Proc. ACM Program. Lang. 4(OOPSLA) (2020). https:\/\/doi.org\/10.1145\/3428295","DOI":"10.1145\/3428295"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Bartoli, A., De\u00a0Lorenzo, A., Medvet, E., Tarlao, F.: Playing regex golf with genetic programming. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, GECCO \u201914, pp. 1063\u20131070. Association for Computing Machinery, New York (2014). https:\/\/doi.org\/10.1145\/2576768.2598333","DOI":"10.1145\/2576768.2598333"},{"issue":"5","key":"14_CR6","doi-asserted-by":"publisher","first-page":"2612","DOI":"10.1109\/TCYB.2019.2918337","volume":"51","author":"A Bartoli","year":"2021","unstructured":"Bartoli, A., De Lorenzo, A., Medvet, E., Tarlao, F.: Automatic search-and-replace from examples with coevolutionary genetic programming. IEEE Trans. Cybern. 51(5), 2612\u20132624 (2021). https:\/\/doi.org\/10.1109\/TCYB.2019.2918337","journal-title":"IEEE Trans. Cybern."},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-662-43951-7_3","volume-title":"Automata, Languages, and Programming","author":"M Boja\u0144czyk","year":"2014","unstructured":"Boja\u0144czyk, M.: Transducers with origin information. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 26\u201337. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_3"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Bose, S., Muscholl, A., Penelle, V., Puppis, G.: Origin-equivalence of two-way word transducers is in PSPACE. In: Ganguly, S., Pandya, P. (eds.) 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0122, pp. 22:1\u201322:18. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2018). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2018.22","DOI":"10.4230\/LIPIcs.FSTTCS.2018.22"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Br\u0101dzma, A.: Efficient identification of regular expressions from representative examples. In: Proceedings of the Sixth Annual Conference on Computational Learning Theory, COLT \u201993, pp. 236\u2013242. Association for Computing Machinery, New York (1993). https:\/\/doi.org\/10.1145\/168304.168340","DOI":"10.1145\/168304.168340"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-59119-2_194","volume-title":"Computational Learning Theory","author":"A Br\u0101zma","year":"1995","unstructured":"Br\u0101zma, A.: Learning of regular expressions by pattern matching. In: Vit\u00e1nyi, P. (ed.) EuroCOLT 1995. LNCS, vol. 904, pp. 392\u2013403. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59119-2_194"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/3-540-58520-6_55","volume-title":"Algorithmic Learning Theory","author":"A Br\u0101zma","year":"1994","unstructured":"Br\u0101zma, A., \u010cer\u0101ns, K.: Efficient learning of regular expressions from good examples. In: Arikawa, S., Jantke, K.P. (eds.) AII\/ALT -1994. LNCS, vol. 872, pp. 76\u201390. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58520-6_55"},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF03037562","volume":"15","author":"A Br\u0101zma","year":"1997","unstructured":"Br\u0101zma, A., \u010cer\u0101ns, K.: Noise-tolerant efficient inductive synthesis of regular expressions from good examples. New Gen. Comput. 15(1), 105\u2013140 (1997). https:\/\/doi.org\/10.1007\/BF03037562","journal-title":"New Gen. Comput."},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Cambronero, J., et al.: Flashfill++: scaling programming by example by cutting to the chase. Proc. ACM Program. Lang. 7(POPL) (2023). https:\/\/doi.org\/10.1145\/3571226","DOI":"10.1145\/3571226"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Chen, Q., Wang, X., Ye, X., Durrett, G., Dillig, I.: Multi-modal synthesis of regular expressions. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2020, pp. 487\u2013502. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3385412.3385988","DOI":"10.1145\/3385412.3385988"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Chen, T., et al.: Solving string constraints with regex-dependent functions through transducers with priorities and variables. Proc. ACM Program. Lang. 6(POPL) (2022). https:\/\/doi.org\/10.1145\/3498707","DOI":"10.1145\/3498707"},{"key":"14_CR16","unstructured":"Chida, N.: R3-s3 (2026). https:\/\/github.com\/NariyoshiChida\/CAV2026. Accessed 3 May 2026"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Chida, N., Terauchi, T.: Repairing dos vulnerability of real-world regexes. In: 2022 IEEE Symposium on Security and Privacy (SP), pp. 2060\u20132077 (2022). https:\/\/doi.org\/10.1109\/SP46214.2022.9833597","DOI":"10.1109\/SP46214.2022.9833597"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Chida, N., Terauchi, T.: Repairing regular expressions for extraction. Proc. ACM Program. Lang. 7(PLDI) (2023). https:\/\/doi.org\/10.1145\/3591287","DOI":"10.1145\/3591287"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Chida, N., Terauchi, T.: Repairing regex-dependent string functions. In: Proceedings of the 39th IEEE\/ACM International Conference on Automated Software Engineering, ASE \u201924, pp. 294\u2013305. Association for Computing Machinery, New York (2024). https:\/\/doi.org\/10.1145\/3691620.3695005","DOI":"10.1145\/3691620.3695005"},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Clause, J., Li, W., Orso, A.: Dytan: a generic dynamic taint analysis framework. In: Proceedings of the 2007 International Symposium on Software Testing and Analysis, ISSTA \u201907, pp. 196\u2013206. Association for Computing Machinery, New York (2007). https:\/\/doi.org\/10.1145\/1273463.1273490","DOI":"10.1145\/1273463.1273490"},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Graham, R.M., Harrison, M.A., Sethi, R. (eds.) Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, California, USA, January 1977, pp. 238\u2013252. ACM (1977). https:\/\/doi.org\/10.1145\/512950.512973","DOI":"10.1145\/512950.512973"},{"key":"14_CR22","doi-asserted-by":"publisher","unstructured":"Dalton, M., Kannan, H., Kozyrakis, C.: Raksha: a flexible information flow architecture for software security. In: Proceedings of the 34th Annual International Symposium on Computer Architecture., ISCA \u201907, pp. 482\u2013493. Association for Computing Machinery, New York (2007). https:\/\/doi.org\/10.1145\/1250662.1250722","DOI":"10.1145\/1250662.1250722"},{"key":"14_CR23","doi-asserted-by":"publisher","unstructured":"Davis, J.C., Coghlan, C.A., Servant, F., Lee, D.: The impact of regular expression denial of service (redos) in practice: an empirical study at the ecosystem scale. In: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC\/FSE 2018, pp. 246\u2013256. Association for Computing Machinery, New York (2018). https:\/\/doi.org\/10.1145\/3236024.3236027","DOI":"10.1145\/3236024.3236027"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"De\u00a0Lorenzo, A., Medvet, E., Bartoli, A.: Automatic string replace by examples. In: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, GECCO \u201913, pp. 1253\u20131260. Association for Computing Machinery, New York (2013). https:\/\/doi.org\/10.1145\/2463372.2463532","DOI":"10.1145\/2463372.2463532"},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Deng, D., et al.: Unsupervised string transformation learning for entity consolidation. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 196\u2013207 (2019). https:\/\/doi.org\/10.1109\/ICDE.2019.00026","DOI":"10.1109\/ICDE.2019.00026"},{"issue":"5","key":"14_CR26","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/360051.360056","volume":"19","author":"DE Denning","year":"1976","unstructured":"Denning, D.E.: A lattice model of secure information flow. Commun. ACM 19(5), 236\u2013243 (1976). https:\/\/doi.org\/10.1145\/360051.360056","journal-title":"Commun. ACM"},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"Ding, Y., Qiu, X.: A concurrent approach to string transformation synthesis. Proc. ACM Program. Lang. 9(PLDI) (2025). https:\/\/doi.org\/10.1145\/3729336","DOI":"10.1145\/3729336"},{"key":"14_CR28","unstructured":"ECMA International: Ecmascript\u00ae 2023 language specification (2022). https:\/\/tc39.es\/ecma262\/2023\/. Accessed 28 Jan 2026]"},{"key":"14_CR29","doi-asserted-by":"publisher","unstructured":"Eghbali, A., Pradel, M.: No strings attached: an empirical study of string-related software bugs. In: Proceedings of the 35th IEEE\/ACM International Conference on Automated Software Engineering, ASE \u201920, pp. 956\u2013967. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3324884.3416576","DOI":"10.1145\/3324884.3416576"},{"issue":"4","key":"14_CR30","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.ic.2008.12.008","volume":"207","author":"H Fernau","year":"2009","unstructured":"Fernau, H.: Algorithms for learning regular expressions from positive data. Inf. Comput. 207(4), 521\u2013541 (2009). https:\/\/doi.org\/10.1016\/j.ic.2008.12.008","journal-title":"Inf. Comput."},{"key":"14_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-030-72016-2_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Ferreira","year":"2021","unstructured":"Ferreira, M., Terra-Neves, M., Ventura, M., Lynce, I., Martins, R.: FOREST: an interactive multi-tree synthesizer for regular expressions. In: TACAS 2021. LNCS, vol. 12651, pp. 152\u2013169. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72016-2_9"},{"key":"14_CR32","doi-asserted-by":"publisher","unstructured":"Filiot, E., Jecker, I., L\u00f6ding, C., Winter, S.: A regular and complete notion of delay for streaming string transducers. In: Berenbrink, P., Bouyer, P., Dawar, A., Kant\u00e9, M.M. (eds.) 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0254, pp. 32:1\u201332:16. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2023). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2023.32","DOI":"10.4230\/LIPIcs.STACS.2023.32"},{"key":"14_CR33","doi-asserted-by":"publisher","unstructured":"Filiot, E., Maneth, S., Reynier, P.A., Talbot, J.M.: Decision problems of tree transducers with origin. Inf. Comput. 261, 311\u2013335 (2018). https:\/\/doi.org\/10.1016\/j.ic.2018.02.011","DOI":"10.1016\/j.ic.2018.02.011"},{"key":"14_CR34","doi-asserted-by":"publisher","unstructured":"Fisher, K., Walker, D., Zhu, K.Q.: Learnpads: automatic tool generation from ad hoc data. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201908, pp. 1299\u20131302. Association for Computing Machinery, New York (2008). https:\/\/doi.org\/10.1145\/1376616.1376759","DOI":"10.1145\/1376616.1376759"},{"key":"14_CR35","volume-title":"Automatically Hardening Web Applications Using Precise Tainting","author":"S Guarnieri","year":"2005","unstructured":"Guarnieri, S.: Automatically Hardening Web Applications Using Precise Tainting. USENIX Association, Baltimore (2005)"},{"issue":"1","key":"14_CR36","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1145\/1925844.1926423","volume":"46","author":"S Gulwani","year":"2011","unstructured":"Gulwani, S.: Automating string processing in spreadsheets using input-output examples. SIGPLAN Not. 46(1), 317\u2013330 (2011). https:\/\/doi.org\/10.1145\/1925844.1926423","journal-title":"SIGPLAN Not."},{"key":"14_CR37","doi-asserted-by":"publisher","unstructured":"He, Y., et al.: Transform-data-by-example (tde): extensible data transformation in excel. In: Proceedings of the 2018 International Conference on Management of Data, SIGMOD \u201918, pp. 1785\u20131788. Association for Computing Machinery, New York (2018). https:\/\/doi.org\/10.1145\/3183713.3193539","DOI":"10.1145\/3183713.3193539"},{"key":"14_CR38","doi-asserted-by":"publisher","unstructured":"Jin, Z., Anderson, M.R., Cafarella, M., Jagadish, H.V.: Foofah: transforming data by example. In: Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD \u201917, pp. 683\u2013698. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3035918.3064034","DOI":"10.1145\/3035918.3064034"},{"key":"14_CR39","doi-asserted-by":"publisher","unstructured":"Kandel, S., Paepcke, A., Hellerstein, J., Heer, J.: Wrangler: interactive visual specification of data transformation scripts. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, CHI \u201911, pp. 3363\u20133372. Association for Computing Machinery, New York (2011). https:\/\/doi.org\/10.1145\/1978942.1979444","DOI":"10.1145\/1978942.1979444"},{"key":"14_CR40","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-15488-1_9","volume-title":"Grammatical Inference: Theoretical Results and Applications","author":"E Kinber","year":"2010","unstructured":"Kinber, E.: Learning regular expressions from representative examples and membership queries. In: Sempere, J.M., Garc\u00eda, P. (eds.) ICGI 2010. LNCS (LNAI), vol. 6339, pp. 94\u2013108. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15488-1_9"},{"key":"14_CR41","doi-asserted-by":"publisher","unstructured":"Klein, D., Barber, T., Bensalim, S., Stock, B., Johns, M.: Hand sanitizers in the wild: a large-scale study of custom javascript sanitizer functions. In: 2022 IEEE 7th European Symposium on Security and Privacy (EuroS&P), pp. 236\u2013250. IEEE Computer Society, Los Alamitos (2022). https:\/\/doi.org\/10.1109\/EuroSP53844.2022.00023","DOI":"10.1109\/EuroSP53844.2022.00023"},{"key":"14_CR42","doi-asserted-by":"publisher","unstructured":"Le, V., Gulwani, S.: Flashextract: a framework for data extraction by examples. In: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI \u201914, pp. 542\u2013553. Association for Computing Machinery, New York (2014). https:\/\/doi.org\/10.1145\/2594291.2594333","DOI":"10.1145\/2594291.2594333"},{"issue":"3","key":"14_CR43","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/3093335.2993244","volume":"52","author":"M Lee","year":"2016","unstructured":"Lee, M., So, S., Oh, H.: Synthesizing regular expressions from examples for introductory automata assignments. SIGPLAN Not. 52(3), 70\u201380 (2016). https:\/\/doi.org\/10.1145\/3093335.2993244","journal-title":"SIGPLAN Not."},{"key":"14_CR44","doi-asserted-by":"publisher","unstructured":"Lee, W.: Combining the top-down propagation and bottom-up enumeration for inductive program synthesis. Proc. ACM Program. Lang. 5(POPL) (2021). https:\/\/doi.org\/10.1145\/3434335","DOI":"10.1145\/3434335"},{"key":"14_CR45","doi-asserted-by":"publisher","unstructured":"Lekies, S., Stock, B., Johns, M.: 25 million flows later: large-scale detection of dom-based xss. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, CCS \u201913, pp. 1193\u20131204. Association for Computing Machinery, New York (2013). https:\/\/doi.org\/10.1145\/2508859.2516703","DOI":"10.1145\/2508859.2516703"},{"key":"14_CR46","doi-asserted-by":"publisher","unstructured":"Li, Y., et al.: Transregex: multi-modal regular expression synthesis by generate-and-repair. In: Proceedings of the 43rd International Conference on Software Engineering, ICSE \u201921, pp. 1210\u20131222. IEEE Press (2021). https:\/\/doi.org\/10.1109\/ICSE43902.2021.00111","DOI":"10.1109\/ICSE43902.2021.00111"},{"key":"14_CR47","doi-asserted-by":"crossref","unstructured":"Melicher, W., Das, A., Sharif, M., Bauer, L., Jia, L.: Riding out domsday: towards detecting and preventing dom cross-site scripting. In: Network and Distributed System Security Symposium (2018). https:\/\/api.semanticscholar.org\/CorpusID:3389782","DOI":"10.14722\/ndss.2018.23309"},{"key":"14_CR48","doi-asserted-by":"publisher","unstructured":"Miltner, A., Fisher, K., Pierce, B.C., Walker, D., Zdancewic, S.: Synthesizing bijective lenses. Proc. ACM Program. Lang. 2(POPL) (2017). https:\/\/doi.org\/10.1145\/3158089","DOI":"10.1145\/3158089"},{"key":"14_CR49","doi-asserted-by":"publisher","unstructured":"Nakamaru, T., Matsunaga, T., Yamazaki, T., Akiyama, S., Chiba, S.: An empirical study of method chaining in java. In: Proceedings of the 17th International Conference on Mining Software Repositories, MSR \u201920, pp. 93\u2013102. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3379597.3387441","DOI":"10.1145\/3379597.3387441"},{"key":"14_CR50","unstructured":"OpenAI: Openai gpt-5 system card (2025). arXiv preprint arXiv:2601.03267"},{"key":"14_CR51","doi-asserted-by":"publisher","unstructured":"Pan, R., Hu, Q., Xu, G., D\u2019Antoni, L.: Automatic repair of regular expressions. Proc. ACM Program. Lang. 3(OOPSLA) (2019). https:\/\/doi.org\/10.1145\/3360565","DOI":"10.1145\/3360565"},{"key":"14_CR52","doi-asserted-by":"publisher","unstructured":"Polozov, O., Gulwani, S.: Flashmeta: a framework for inductive program synthesis. In: Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2015, pp. 107\u2013126. Association for Computing Machinery, New York (2015). https:\/\/doi.org\/10.1145\/2814270.2814310","DOI":"10.1145\/2814270.2814310"},{"issue":"1","key":"14_CR53","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1145\/2103621.2103678","volume":"47","author":"D Ray","year":"2012","unstructured":"Ray, D., Ligatti, J.: Defining code-injection attacks. SIGPLAN Not. 47(1), 179\u2013190 (2012). https:\/\/doi.org\/10.1145\/2103621.2103678","journal-title":"SIGPLAN Not."},{"key":"14_CR54","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-93037-4_6","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"T Rebele","year":"2018","unstructured":"Rebele, T., Tzompanaki, K., Suchanek, F.M.: Adding missing words to regular expressions. In: Phung, D., Tseng, V.S., Webb, G.I., Ho, B., Ganji, M., Rashidi, L. (eds.) PAKDD 2018. LNCS (LNAI), vol. 10938, pp. 67\u201379. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93037-4_6"},{"key":"14_CR55","doi-asserted-by":"publisher","unstructured":"Singh, R.: Blinkfill: semi-supervised programming by example for syntactic string transformations. Proc. VLDB Endow. 9(10), 816\u2013827 (2016). https:\/\/doi.org\/10.14778\/2977797.2977807","DOI":"10.14778\/2977797.2977807"},{"key":"14_CR56","doi-asserted-by":"publisher","unstructured":"Singh, R., Gulwani, S.: Learning semantic string transformations from examples. Proc. VLDB Endow. 5(8), 740\u2013751 (2012). https:\/\/doi.org\/10.14778\/2212351.2212356","DOI":"10.14778\/2212351.2212356"},{"key":"14_CR57","unstructured":"StackOverflow: Find and replace numbers in string with regex (2012). https:\/\/stackoverflow.com\/questions\/12432237\/find-and-replace-numbers-in-string-with-regex. Accessed 28 Jan 2026"},{"key":"14_CR58","unstructured":"StackOverflow: Count the numbers inside the brackets in a string (2017). https:\/\/stackoverflow.com\/questions\/41660778\/count-the-numbers-inside-the-brackets-in-a-string. Accessed 28 Jan 2026"},{"key":"14_CR59","doi-asserted-by":"publisher","unstructured":"Valizadeh, M., Berger, M.: Search-based regular expression inference on a gpu. Proc. ACM Program. Lang. 7(PLDI) (2023). https:\/\/doi.org\/10.1145\/3591274","DOI":"10.1145\/3591274"},{"issue":"5","key":"14_CR60","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/S0747-7171(06)80004-0","volume":"15","author":"A van Deursen","year":"1993","unstructured":"van Deursen, A., Klint, P., Tip, F.: Origin tracking. J. Symb. Comput. 15(5), 523\u2013545 (1993). https:\/\/doi.org\/10.1016\/S0747-7171(06)80004-0","journal-title":"J. Symb. Comput."},{"key":"14_CR61","doi-asserted-by":"publisher","unstructured":"Veanes, M., Hooimeijer, P., Livshits, B., Molnar, D., Bjorner, N.: Symbolic finite state transducers: algorithms and applications. In: Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL \u201912, pp. 137\u2013150. Association for Computing Machinery, New York (2012). https:\/\/doi.org\/10.1145\/2103656.2103674","DOI":"10.1145\/2103656.2103674"},{"issue":"6","key":"14_CR62","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1145\/3140587.3062365","volume":"52","author":"C Wang","year":"2017","unstructured":"Wang, C., Cheung, A., Bodik, R.: Synthesizing highly expressive SQL queries from input-output examples. SIGPLAN Not. 52(6), 452\u2013466 (2017). https:\/\/doi.org\/10.1145\/3140587.3062365","journal-title":"SIGPLAN Not."},{"issue":"6","key":"14_CR63","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/1273442.1250739","volume":"42","author":"G Wassermann","year":"2007","unstructured":"Wassermann, G., Su, Z.: Sound and precise analysis of web applications for injection vulnerabilities. SIGPLAN Not. 42(6), 32\u201341 (2007). https:\/\/doi.org\/10.1145\/1273442.1250739","journal-title":"SIGPLAN Not."},{"key":"14_CR64","doi-asserted-by":"publisher","unstructured":"Yip, A., Wang, X., Zeldovich, N., Kaashoek, M.F.: Improving application security with data flow assertions. In: Proceedings of the ACM SIGOPS 22nd Symposium on Operating Systems Principles, SOSP \u201909, pp. 291\u2013304. Association for Computing Machinery, New York (2009). https:\/\/doi.org\/10.1145\/1629575.1629604","DOI":"10.1145\/1629575.1629604"},{"key":"14_CR65","doi-asserted-by":"publisher","unstructured":"Yu, F., Alkhalaf, M., Bultan, T.: Patching vulnerabilities with sanitization synthesis. In: Proceedings of the 33rd International Conference on Software Engineering, ICSE \u201911, pp. 251\u2013260. Association for Computing Machinery, New York (2011). https:\/\/doi.org\/10.1145\/1985793.1985828","DOI":"10.1145\/1985793.1985828"},{"key":"14_CR66","doi-asserted-by":"publisher","unstructured":"Zhang, T., Lowmanstone, L., Wang, X., Glassman, E.L.: Interactive program synthesis by augmented examples. In: Proceedings of the 33rd Annual ACM Symposium on User Interface Software and Technology, UIST \u201920, pp. 627\u2013648. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3379337.3415900","DOI":"10.1145\/3379337.3415900"},{"key":"14_CR67","doi-asserted-by":"publisher","unstructured":"Zhou, X., Bodik, R., Cheung, A., Wang, C.: Synthesizing analytical SQL queries from computation demonstration. In: Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, PLDI 2022, pp. 168\u2013182. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3519939.3523712","DOI":"10.1145\/3519939.3523712"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-32519-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T07:18:46Z","timestamp":1784791126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-32519-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032325181","9783032325198"],"references-count":67,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-32519-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"24 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","label":"Disclosure of Interests","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"The artifact of this paper is available at [\n                      \n                      ].","order":2,"name":"Ethics","label":"Data-Availability Statement","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"38","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.floc26.org\/program","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}