{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:46:57Z","timestamp":1742914017371,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319223599"},{"type":"electronic","value":"9783319223605"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-22360-5_24","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T08:24:42Z","timestamp":1437985482000},"page":"292-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Semantics of Regular Expression Parsing in the Wild"],"prefix":"10.1007","author":[{"given":"Martin","family":"Berglund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brink","family":"van der Merwe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-38771-5_8","volume-title":"Developments in Language Theory","author":"M Berglund","year":"2013","unstructured":"Berglund, M., Bj\u00f6rklund, H., Drewes, F., van der Merwe, B., Watson, B.: Cuts in regular expressions. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 70\u201381. Springer, Heidelberg (2013)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Berglund, M., Drewes, F., van der Merwe, B.: Analyzing catastrophic backtracking behavior in practical regular expression matching. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z., (eds.) Proceedings of the 14th International Conference on Automata and Formal Languages, pp. 109\u2013123 (2014)","DOI":"10.4204\/EPTCS.151.7"},{"issue":"6","key":"24_CR3","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1142\/S012905410300214X","volume":"14","author":"C C\u00e2mpeanu","year":"2003","unstructured":"C\u00e2mpeanu, C., Salomaa, K., Yu, S.: A formal study of practical regular expressions. Int. J. Found. Comput. Sci. 14(6), 1007\u20131018 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"24_CR4","unstructured":"Cox, R.: Implementing regular expressions (2007). http:\/\/swtch.com\/rsc\/regexp\/. (Accessed 3 March 2015)"},{"key":"24_CR5","volume-title":"Mastering Regular Expressions","author":"J Friedl","year":"2006","unstructured":"Friedl, J.: Mastering Regular Expressions, 3rd edn. O\u2019Reilly Media Inc., Sebastopol (2006)","edition":"3"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-540-27836-8_53","volume-title":"Automata, Languages and Programming","author":"A Frisch","year":"2004","unstructured":"Frisch, A., Cardelli, L.: Greedy regular expression matching. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 618\u2013629. Springer, Heidelberg (2004)"},{"key":"24_CR7","unstructured":"Rathnayake, A., Thielecke, H.: Static analysis for regular expression exponential runtime via substructural logics. CoRR, abs\/1405.7058 (2014)"},{"key":"24_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"J Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, New York (2009)"},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.jal.2011.11.003","volume":"10","author":"Y Sakuma","year":"2012","unstructured":"Sakuma, Y., Minamide, Y., Voronkov, A.: Translating regular expression matching into transducers. J. Applied Logic 10(1), 32\u201351 (2012)","journal-title":"J. Applied Logic"},{"issue":"6","key":"24_CR10","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K Thompson","year":"1968","unstructured":"Thompson, K.: Regular expression search algorithm. Commun. ACM 11(6), 419\u2013422 (1968)","journal-title":"Commun. ACM"},{"key":"24_CR11","unstructured":"Wang, J.: Handbook of Finite State Based Models and Applications. 1st edn. Chapman & Hall\/CRC, Boca Raton (2012)"}],"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-319-22360-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T12:20:22Z","timestamp":1674908422000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22360-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319223599","9783319223605"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22360-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}