{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T18:49:46Z","timestamp":1782672586327,"version":"3.54.5"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031711114","type":"print"},{"value":"9783031711121","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-71112-1_23","type":"book-chapter","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T02:02:14Z","timestamp":1725328934000},"page":"316-331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Benchmarking Regular Expression Matching"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Roodt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brendan Keith Mark","family":"Watling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Willem","family":"Bester","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brink","family":"van der Merwe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sicheol","family":"Sung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yo-Sub","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,9,3]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","unstructured":"Barri\u00e8re, A., Pit-Claudel, C.: Linear matching of javascript regular expressions. CoRR abs\/2311.17620 (2023). https:\/\/doi.org\/10.48550\/arXiv.2311.17620","DOI":"10.48550\/arXiv.2311.17620"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Berglund, M., Drewes, F., van\u00a0der Merwe, B.: Analyzing catastrophic backtracking behavior in practical regular expression matching. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) Proceedings 14th International Conference on Automata and Formal Languages, AFL 2014, Szeged, Hungary, May 27-29, 2014. EPTCS, vol.\u00a0151, pp. 109\u2013123 (2014)","DOI":"10.4204\/EPTCS.151.7"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2016.09.006","volume":"679","author":"M Berglund","year":"2017","unstructured":"Berglund, M., van der Merwe, B.: On the semantics of regular expression parsing in the wild. Theor. Comput. Sci. 679, 69\u201382 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BFb0023820","volume-title":"LATIN \u201992","author":"A Br\u00fcggemann-Klein","year":"1992","unstructured":"Br\u00fcggemann-Klein, A.: Regular expressions into finite automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 87\u201398. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0023820"},{"key":"23_CR5","unstructured":"Cox, R.: Regular expression matching: the virtual machine approach (2009). https:\/\/swtch.com\/~rsc\/regexp\/regexp2.html. Accessed 19 Apr 2024"},{"key":"23_CR6","unstructured":"Cox, R.: Regular expression matching in the wild: A tour of RE2, an efficient, production regular expression implementation (2010). https:\/\/swtch.com\/~rsc\/regexp\/regexp3.html. Accessed 30 Apr 2024"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-63387-9_3","volume-title":"Computer Aided Verification","author":"L D\u2019Antoni","year":"2017","unstructured":"D\u2019Antoni, L., Veanes, M.: The power of symbolic automata and transducers. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 47\u201367. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_3"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Davis, J.C., IV, L.G.M., Coghlan, C.A., Servant, F., Lee, D.: Why aren\u2019t regular expressions a lingua franca? An empirical study on the re-use and portability of regular expressions. In: Dumas, M., Pfahl, D., Apel, S., Russo, A. (eds.) Proceedings of the ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC\/SIGSOFT FSE 2019, Tallinn, Estonia, August 26-30, 2019, pp. 443\u2013454. ACM (2019)","DOI":"10.1145\/3338906.3338909"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Davis, J.C., Servant, F., Lee, D.: Using selective memoization to defeat regular expression denial of service (redos). In: 42nd IEEE Symposium on Security and Privacy, SP 2021, San Francisco, CA, USA, 24-27 May 2021, pp. 1\u201317. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00032"},{"issue":"1\u20133","key":"23_CR10","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0166-218X(03)00299-3","volume":"134","author":"D Giammarresi","year":"2004","unstructured":"Giammarresi, D., Ponty, J., Wood, D., Ziadi, D.: A characterization of Thompson digraphs. Discret. Appl. Math. 134(1\u20133), 317\u2013337 (2004)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"23_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"VM Glushkov","year":"1961","unstructured":"Glushkov, V.M.: The abstract theory of automata. Russ. Math. Surv. 16(5), 1\u201353 (1961)","journal-title":"Russ. Math. Surv."},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-030-79121-6_4","volume-title":"Implementation and Application of Automata","author":"B van der Merwe","year":"2021","unstructured":"van der Merwe, B., Mouton, J., van Litsenborgh, S., Berglund, M.: Memoized regular expressions. In: Maneth, S. (ed.) CIAA 2021. LNCS, vol. 12803, pp. 39\u201352. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79121-6_4"},{"key":"23_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-031-07469-1_3","volume-title":"Implementation and Application of Automata","author":"S Sung","year":"2022","unstructured":"Sung, S., Cheon, H., Han, Y.: How to settle the ReDoS problem: back to the classical automata theory. In: Caron, P., Mignot, L. (eds.) CIAA 2022. LNCS, vol. 13266, pp. 34\u201349. Springer, Cham (2022)"},{"issue":"6","key":"23_CR14","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K Thompson","year":"1968","unstructured":"Thompson, K.: Programming techniques: regular expression search algorithm. Commun. ACM 11(6), 419\u2013422 (1968)","journal-title":"Commun. ACM"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-319-40946-7_27","volume-title":"Implementation and Application of Automata","author":"N Weideman","year":"2016","unstructured":"Weideman, N., van der Merwe, B., Berglund, M., Watson, B.: Analyzing matching time behavior of backtracking regular expression matchers by using ambiguity of NFA. In: Han, Y.-S., Salomaa, K. (eds.) CIAA 2016. LNCS, vol. 9705, pp. 322\u2013334. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40946-7_27"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-71112-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T02:04:05Z","timestamp":1725329045000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71112-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031711114","9783031711121"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71112-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"3 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Akita","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}