{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T12:52:50Z","timestamp":1754398370181,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030035914"},{"type":"electronic","value":"9783030035921"}],"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-03592-1_10","type":"book-chapter","created":{"date-parts":[[2018,11,23]],"date-time":"2018-11-23T04:45:32Z","timestamp":1542948332000},"page":"177-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Formalization of the ABNF Notation and a Verified Parser of ABNF Grammars"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Coglio","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,24]]},"reference":[{"key":"10_CR1","volume-title":"Compilers: Principles, Techniques, and Tools","author":"AV Aho","year":"2007","unstructured":"Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools, 2nd edn. Pearson, London (2007)","edition":"2"},{"key":"10_CR2","unstructured":"Avigad, J., Zach, R.: The epsilon calculus. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy, summer 2016 edn. Metaphysics Research Lab, Stanford University (2016). https:\/\/plato.stanford.edu\/archives\/sum2016\/entries\/epsilon-calculus\/"},{"issue":"5","key":"10_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/367236.367262","volume":"3","author":"JW Backus","year":"1960","unstructured":"Backus, J.W., et al.: Report on the algorithmic language ALGOL 60. Commun. ACM 3(5), 299\u2013314 (1960)","journal-title":"Commun. ACM"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Barthwal, A.: A formalisation of the theory of context-free languages in higher-order logic. Ph.D. thesis. The Australian National University (2010)","DOI":"10.1007\/978-3-642-15205-4_11"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-00590-9_12","volume-title":"Programming Languages and Systems","author":"A Barthwal","year":"2009","unstructured":"Barthwal, A., Norrish, M.: Verified, executable parsing. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 160\u2013174. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00590-9_12"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Berners-Lee, T., Fielding, R., Masinter, L.: Uniform Resource Identifier (URI): Generic syntax. Request for Comments (RFC) 3986, January 2005","DOI":"10.17487\/rfc3986"},{"key":"10_CR7","volume-title":"A Computational Logic","author":"RS Boyer","year":"1979","unstructured":"Boyer, R.S., Moore, J.S.: A Computational Logic. Academic Press, Cambridge (1979)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Bray, T.: The JavaScript Object Notation (JSON) data interchange format. Request for Comments (RFC) 7159, March 2014","DOI":"10.17487\/rfc7159"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Crocker, D., Overell, P.: Augmented BNF for syntax specifications: ABNF. Request for Comments (RFC) 5234, January 2008","DOI":"10.17487\/rfc5234"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-319-03545-1_6","volume-title":"Certified Programs and Proofs","author":"C Doczkal","year":"2013","unstructured":"Doczkal, C., Kaiser, J.-O., Smolka, G.: A constructive theory of regular languages in Coq. In: Gonthier, G., Norrish, M. (eds.) CPP 2013. LNCS, vol. 8307, pp. 82\u201397. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03545-1_6"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Fielding, R., Reschke, J.: Hypertext Transfer Protocol (HTTP\/1.1): Message syntax and routing. Request for Comments (RFC) 7230, June 2014","DOI":"10.17487\/rfc7230"},{"key":"10_CR12","unstructured":"Gross, J.S.: An extensible framework for synthesizing efficient, verified parsers. Master\u2019s thesis. Massachusetts Institute of Technology (2015)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-642-28869-2_20","volume-title":"Programming Languages and Systems","author":"J-H Jourdan","year":"2012","unstructured":"Jourdan, J.-H., Pottier, F., Leroy, X.: Validating LR(1) parsers. In: Seidl, H. (ed.) ESOP 2012. LNCS, vol. 7211, pp. 397\u2013416. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28869-2_20"},{"key":"10_CR14","unstructured":"Kaufmann, M., Moore, J.S.: The ACL2 theorem prover: Web page. http:\/\/www.cs.utexas.edu\/users\/moore\/acl2"},{"key":"10_CR15","unstructured":"Kaufmann, M., Moore, J.S.: A precise description of the ACL2 logic. Technical report. Department of Computer Sciences, University of Texas at Austin (1998)"},{"issue":"2","key":"10_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-7(2:18)2011","volume":"7","author":"A Koprowski","year":"2011","unstructured":"Koprowski, A., Binsztok, H.: TRX: a formally verified parser interpreter. Log. Methods Comput. Sci. 7(2), 1\u201326 (2011)","journal-title":"Log. Methods Comput. Sci."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Kumar, R., Myreen, M.O., Norrish, M., Owens, S.: CakeML: a verified implementation of ML. In: Proceedings of 41st ACM SIGPLAN Symposium on Principles of Programming Languages, POPL, pp. 179\u2013191 (2014)","DOI":"10.1145\/2535838.2535841"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Kyzivat, P.: Case-sensitive string support in ABNF. Request for Comments (RFC) 7405, December 2014","DOI":"10.17487\/rfc7405"},{"key":"10_CR19","unstructured":"Linhart, C., Klein, A., Heled, R., Orrin, S.: HTTP request smuggling. White paper, Watchfire (2005)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Nipkow, T.: Verified lexical analysis. In: Proceedings of 11th International Conference on Theorem Proving in Higher-Order Logics, TPHOL, pp. 1\u201315 (1998)","DOI":"10.1007\/BFb0055126"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Parr, T., Fisher, K.: LL(*): the foundation of the ANTLR parser generator. In: Proceedings of 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI, pp. 425\u2013436 (2011)","DOI":"10.1145\/1993316.1993548"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-11245-9_15","volume-title":"Software Language Engineering","author":"T Ridge","year":"2014","unstructured":"Ridge, T.: Simple, efficient, sound and complete combinator parsing for all context-free grammars, using an Oracle. In: Combemale, B., Pearce, D.J., Barais, O., Vinju, J.J. (eds.) SLE 2014. LNCS, vol. 8706, pp. 261\u2013281. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11245-9_15"},{"key":"10_CR23","unstructured":"Swords, S., Davis, J.: Fix your types. In: Proceedings of 13th International Workshop on the ACL2 Theorem Prover and Its Applications (2015)"},{"key":"10_CR24","unstructured":"The ACL2 Community: The ACL2 theorem prover and community books: Source code. http:\/\/github.com\/acl2\/acl2"},{"key":"10_CR25","unstructured":"The ACL2 Community: The ACL2 theorem prover and community books: User manual. http:\/\/www.cs.utexas.edu\/~moore\/acl2\/manuals\/current\/manual"},{"key":"10_CR26","unstructured":"Thomas, L.D.: APG: ABNF Parser Generator. http:\/\/www.coasttocoastresearch.com"},{"key":"10_CR27","unstructured":"Wisnesky, R., Malecha, G., Morrisett, G.: Certified web services in Ynot. In: Proceedings of 5th International Workshop on Automated Specification and Verification of Web Systems, WWV, pp. 5\u201319 (2009)"}],"container-title":["Lecture Notes in Computer Science","Verified Software. Theories, Tools, and Experiments"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03592-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T15:05:20Z","timestamp":1657206320000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-03592-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030035914","9783030035921"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03592-1_10","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":"24 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VSTTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Working Conference on Verified Software: Theories, Tools, and Experiments","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"18 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vstte2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/vstte18.it.uu.se\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"79% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}