{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:55Z","timestamp":1759638655980,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030025076"},{"type":"electronic","value":"9783030025083"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-02508-3_6","type":"book-chapter","created":{"date-parts":[[2018,10,13]],"date-time":"2018-10-13T14:22:47Z","timestamp":1539440567000},"page":"99-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Formalising Boost POSIX Regular Expression Matching"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3692-6994","authenticated-orcid":false,"given":"Martin","family":"Berglund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0016-7623","authenticated-orcid":false,"given":"Willem","family":"Bester","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5010-9934","authenticated-orcid":false,"given":"Brink","family":"van der Merwe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,15]]},"reference":[{"key":"6_CR1","unstructured":"PCRE: Perl compatible regular expressions. \n                      https:\/\/www.pcre.org\/\n                      \n                    . Accessed 26 May 2018"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Portable Operating System Interface (POSIX) Base Specifications, Issue 7. IEEE Standard 1003.1-2017 (2017). (Revision of IEEE Standard 1003.1-2008) \n                      https:\/\/doi.org\/10.1109\/ieeestd.2008.4694976","DOI":"10.1109\/ieeestd.2008.4694976"},{"key":"6_CR3","unstructured":"Regex(3) BSD Library Functions Manual, September 2011. as available on macOS 10.11.6"},{"key":"6_CR4","unstructured":"Regular expression routines: OpenBSD library functions manual, May 2016. \n                      http:\/\/man.openbsd.org\/regexec"},{"key":"6_CR5","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). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2016.09.006","journal-title":"Theor. Comput. Sci."},{"key":"6_CR6","unstructured":"Berglund, M., van der Merwe, B.: Re-examining regular expressions with backreferences. In: Holub, J., \u017dd\u2019\u00e1rek, J. (eds.) Proceedings of Prague Stringology Conference, PSC 2017, Prague, August 2017, pp. 30\u201341. Czech Technical University Prague (2017). \n                      http:\/\/www.stringology.org\/event\/2017\/p04.html"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1006\/inco.1997.2688","volume":"140","author":"A Br\u00fcggemann-Klein","year":"1998","unstructured":"Br\u00fcggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Inf. Comput. 140(2), 229\u2013253 (1998). \n                      https:\/\/doi.org\/10.1006\/inco.1997.2688","journal-title":"Inf. Comput."},{"key":"6_CR8","unstructured":"Fowler, G.: An interpretation of the POSIX regex standard. Technical report, AT&T Research, Florham Park, NJ (2003). \n                      http:\/\/gsf.cococlyde.org\/download"},{"key":"6_CR9","volume-title":"Mastering Regular Expressions","author":"JEF Friedl","year":"2006","unstructured":"Friedl, J.E.F.: Mastering Regular Expressions, 3rd edn. O\u2019Reilly, Sebastopol (2006)","edition":"3"},{"key":"6_CR10","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). \n                      https:\/\/doi.org\/10.1007\/978-3-540-27836-8_53"},{"key":"6_CR11","unstructured":"Houston, G.: Henry Spencer\u2019s regular expression libraries. Git repositories. \n                      https:\/\/garyhouston.github.io\/regex\/\n                      \n                    . Accessed 26 May 2018"},{"issue":"8","key":"6_CR12","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1002\/spe.4380210803","volume":"21","author":"SM Kearns","year":"1991","unstructured":"Kearns, S.M.: Extending regular expressions with context operators and parse extraction. Softw. Pract. Exp. 21(8), 787\u2013804 (1991). \n                      https:\/\/doi.org\/10.1002\/spe.4380210803","journal-title":"Softw. Pract. Exp."},{"key":"6_CR13","unstructured":"Kuklewicz, C.: Regex-TDFA. \n                      https:\/\/hackage.haskell.org\/package\/regex-tdfa\n                      \n                    . Accessed 26 May 2018"},{"key":"6_CR14","unstructured":"Kuklewicz, C.: Summoned: Response to blog entry on lambda the ultimate: the programming languages weblog, February 2007. \n                      http:\/\/lambda-the-ultimate.org\/node\/2064\n                      \n                    . Accessed 26 May 2018"},{"key":"6_CR15","unstructured":"Kuklewicz, C.: regex-posix-unittest (2009). \n                      https:\/\/hackage.haskell.org\/package\/regex-posix-unittest\n                      \n                    . Accessed 26 May 2018"},{"key":"6_CR16","unstructured":"Kuklewicz, C.: Regex Posix. Haskell Wiki, March 2017. \n                      https:\/\/wiki.haskell.org\/Regex_Posix\n                      \n                    . Accessed 26 May 2018"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Laurikari, V.: NFAs with tagged transitions, their conversion to deterministic automata and application to regular expressions. In: Proceedings of 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000, A Coru\u00f1a, September 2000, pp. 181\u2013187. IEEE (2000). \n                      https:\/\/doi.org\/10.1109\/spire.2000.878194","DOI":"10.1109\/spire.2000.878194"},{"key":"6_CR18","unstructured":"Laurikari, V.: TRE: The free and portable regex matching library. Git repository. \n                      https:\/\/github.com\/laurikari\/tre\/\n                      \n                    . Accessed 26 May 2018"},{"key":"6_CR19","unstructured":"Laurikari, V.: TRE documentation. \n                      https:\/\/laurikari.net\/tre\/documentation\/regex-syntax\/\n                      \n                    . Accessed 26 May 2018"},{"key":"6_CR20","unstructured":"Laurikari, V.: Efficient submatch addressing for regular expressions. Master\u2019s thesis, Helsinki University of Technology, November 2001"},{"key":"6_CR21","unstructured":"Maddock, J.: Boost.Regex (2013). \n                      https:\/\/www.boost.org\/doc\/libs\/1_67_0\/libs\/regex\/doc\/html\/index.html\n                      \n                    . Accessed 26 May 2018"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-18098-9_25","volume-title":"Implementation and Application of Automata","author":"S Okui","year":"2011","unstructured":"Okui, S., Suzuki, T.: Disambiguation in regular expression matching via position automata with augmented transitions. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 231\u2013240. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-18098-9_25"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-07151-0_13","volume-title":"Functional and Logic Programming","author":"M Sulzmann","year":"2014","unstructured":"Sulzmann, M., Lu, K.Z.M.: POSIX regular expression parsing with derivatives. In: Codish, M., Sumii, E. (eds.) FLOPS 2014. LNCS, vol. 8475, pp. 203\u2013220. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-07151-0_13"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-319-40946-7_22","volume-title":"Implementation and Application of Automata","author":"M Sulzmann","year":"2016","unstructured":"Sulzmann, M., Lu, K.Z.M.: Derivative-based diagnosis of regular expression ambiguity. In: Han, Y.-S., Salomaa, K. (eds.) CIAA 2016. LNCS, vol. 9705, pp. 260\u2013272. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-40946-7_22"},{"issue":"6","key":"6_CR25","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). \n                      https:\/\/doi.org\/10.1145\/363347.363387","journal-title":"Commun. ACM"},{"key":"6_CR26","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). \n                      https:\/\/doi.org\/10.1007\/978-3-319-40946-7_27"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2018"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02508-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T02:48:50Z","timestamp":1583203730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02508-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030025076","9783030025083"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02508-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"15 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Stellenbosch","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"South Africa","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ictac.org.za\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}