{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:08:56Z","timestamp":1783008536363,"version":"3.54.5"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319409450","type":"print"},{"value":"9783319409467","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40946-7_27","type":"book-chapter","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T07:52:20Z","timestamp":1467705140000},"page":"322-334","source":"Crossref","is-referenced-by-count":26,"title":["Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA"],"prefix":"10.1007","author":[{"given":"Nicolaas","family":"Weideman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brink","family":"van der Merwe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Berglund","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruce","family":"Watson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,7,6]]},"reference":[{"key":"27_CR1","unstructured":"Regexlib. http:\/\/www.regxlib.com . Accessed 06 Oct 2015"},{"key":"27_CR2","unstructured":"Regular expression static analysis project page. http:\/\/www.cs.sun.ac.za\/~abvdm\/regex.html . Accessed 30 Apr 2016"},{"key":"27_CR3","unstructured":"Snort. http:\/\/www.snort.org . Accessed 06 Oct 2015"},{"key":"27_CR4","unstructured":"Adam, B.: Regular expression dos and node.js (2014). https:\/\/blog.liftsecurity.io\/2014\/11\/03\/regular-expression-dos-and-node.js"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/978-3-540-85780-8_8","volume-title":"Developments in Language Theory","author":"C Allauzen","year":"2008","unstructured":"Allauzen, C., Mohri, M., Rastogi, A.: General algorithms for testing the ambiguity of finite automata. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 108\u2013120. Springer, Heidelberg (2008). http:\/\/dx.doi.org\/10.1007\/978-3-540-85780-8_8"},{"key":"27_CR6","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 14th International Conference on Automata and Formal Languages, AFL 2014, EPTCS, vol. 151, Szeged, Hungary, 27\u201329 May 2014, pp. 109\u2013123 (2014). http:\/\/dx.doi.org\/10.4204\/EPTCS.151.7","DOI":"10.4204\/EPTCS.151.7"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/978-3-319-22360-5_24","volume-title":"Implementation and Application of Automata","author":"M Berglund","year":"2015","unstructured":"Berglund, M., van der Merwe, B.: On the semantics of regular expression parsing in the wild. In: Drewes, F. (ed.) CIAA 2015. LNCS, vol. 9223, pp. 292\u2013304. Springer, Heidelberg (2015). http:\/\/dx.doi.org\/10.1007\/978-3-319-22360-5_24"},{"key":"27_CR8","unstructured":"Cox, R.: Implementing regular expressions (2007). http:\/\/swtch.com\/~rsc\/regexp\/ . Accessed 26 Feb 2016"},{"issue":"1\/2","key":"27_CR9","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/S0019-9958(67)90369-5","volume":"11","author":"J Gray","year":"1967","unstructured":"Gray, J., Harrison, M.A., Ibarra, O.H.: Two-way pushdown automata. Inf. Control 11(1\/2), 30\u201370 (1967). http:\/\/dx.doi.org\/10.1016\/S0019-9958(67)90369-5","journal-title":"Inf. Control"},{"key":"27_CR10","unstructured":"Rathnayake, A., Thielecke, H.: Static analysis for regular expression exponential runtime via substructural logics. CoRR abs\/1405.7058 (2014). http:\/\/arxiv.org\/abs\/1405.7058"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40946-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T13:50:49Z","timestamp":1498312249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40946-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319409450","9783319409467"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40946-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}