{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:13:09Z","timestamp":1743005589126,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031331695"},{"type":"electronic","value":"9783031331701"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33170-1_25","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:55:27Z","timestamp":1685710527000},"page":"414-429","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Verified ALL(*) Parsing with\u00a0Semantic Actions and\u00a0Dynamic Input Validation"],"prefix":"10.1007","author":[{"given":"Sam","family":"Lasser","sequence":"first","affiliation":[]},{"given":"Chris","family":"Casinghino","sequence":"additional","affiliation":[]},{"given":"Derek","family":"Egolf","sequence":"additional","affiliation":[]},{"given":"Kathleen","family":"Fisher","sequence":"additional","affiliation":[]},{"given":"Cody","family":"Roux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"unstructured":"Congress-legislators database (2022). https:\/\/github.com\/unitedstates\/congress-legislators","key":"25_CR1"},{"issue":"3","key":"25_CR2","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1002\/evan.20251","volume":"19","author":"C Arnold","year":"2010","unstructured":"Arnold, C., Matthews, L.J., Nunn, C.L.: The 10kTrees website: a new online resource for primate phylogeny. Evol. Anthropol. Issues News Rev. 19(3), 114\u2013118 (2010)","journal-title":"Evol. Anthropol. Issues News Rev."},{"issue":"368","key":"25_CR3","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1080\/01621459.1979.10481038","volume":"74","author":"WS Cleveland","year":"1979","unstructured":"Cleveland, W.S.: Robust locally weighted regression and smoothing scatterplots. J. Am. Stat. Assoc. 74(368), 829\u2013836 (1979)","journal-title":"J. Am. Stat. Assoc."},{"doi-asserted-by":"publisher","unstructured":"Danielsson, N.A.: Total parser combinators. In: International Conference on Functional Programming (2010). https:\/\/doi.org\/10.1145\/1863543.1863585","key":"25_CR4","DOI":"10.1145\/1863543.1863585"},{"doi-asserted-by":"publisher","unstructured":"Edelmann, R., Hamza, J., Kun\u010dak, V.: Zippy LL(1) parsing with derivatives. In: Programming Language Design and Implementation (2020). https:\/\/doi.org\/10.1145\/3385412.3385992","key":"25_CR5","DOI":"10.1145\/3385412.3385992"},{"doi-asserted-by":"crossref","unstructured":"Egolf, D., Lasser, S., Fisher, K.: Verbatim: a verified lexer generator. In: LangSec Workshop (2021). https:\/\/langsec.org\/spw21\/papers.html#verbatim","key":"25_CR6","DOI":"10.1109\/SPW53761.2021.00022"},{"doi-asserted-by":"publisher","unstructured":"Egolf, D., Lasser, S., Fisher, K.: Verbatim++: verified, optimized, and semantically rich lexing with derivatives. In: Certified Programs and Proofs (2022). https:\/\/doi.org\/10.1145\/3497775.3503694","key":"25_CR7","DOI":"10.1145\/3497775.3503694"},{"key":"25_CR8","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"},{"unstructured":"Lasser, S., Casinghino, C., Egolf, D., Fisher, K., Roux, C.: GitHub repository for the CoStar++ development and performance evaluation framework (2022). https:\/\/github.com\/slasser\/CoStar","key":"25_CR9"},{"doi-asserted-by":"publisher","unstructured":"Lasser, S., Casinghino, C., Fisher, K., Roux, C.: A verified LL(1) parser generator. In: Interactive Theorem Proving (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ITP.2019.24","key":"25_CR10","DOI":"10.4230\/LIPIcs.ITP.2019.24"},{"doi-asserted-by":"publisher","unstructured":"Lasser, S., Casinghino, C., Fisher, K., Roux, C.: CoStar: a verified ALL(*) parser. In: Programming Language Design and Implementation (2021). https:\/\/doi.org\/10.1145\/3453483.3454053","key":"25_CR11","DOI":"10.1145\/3453483.3454053"},{"doi-asserted-by":"publisher","unstructured":"Momot, F., Bratus, S., Hallberg, S.M., Patterson, M.L.: The seven turrets of babel: a taxonomy of LangSec errors and how to expunge them. In: IEEE Cybersecurity Development (2016). https:\/\/doi.org\/10.1109\/SecDev.2016.019","key":"25_CR12","DOI":"10.1109\/SecDev.2016.019"},{"unstructured":"Open American National Corpus (2010). https:\/\/www.anc.org\/data\/oanc\/download\/","key":"25_CR13"},{"doi-asserted-by":"publisher","unstructured":"Parr, T., Harwell, S., Fisher, K.: Adaptive LL(*) parsing: the power of dynamic analysis. In: Object-Oriented Programming, Systems, Languages, and Applications (2014). https:\/\/doi.org\/10.1145\/2660193.2660202","key":"25_CR14","DOI":"10.1145\/2660193.2660202"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-25379-9_10","volume-title":"Certified Programs and Proofs","author":"T Ridge","year":"2011","unstructured":"Ridge, T.: Simple, functional, sound and complete parsing for all context-free grammars. In: Jouannaud, J.-P., Shao, Z. (eds.) CPP 2011. LNCS, vol. 7086, pp. 103\u2013118. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25379-9_10"},{"issue":"7","key":"25_CR16","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.entcs.2010.08.041","volume":"253","author":"E Scott","year":"2010","unstructured":"Scott, E., Johnstone, A.: GLL parsing. Elect. Notes Theor. Comput. Sci. 253(7), 177\u2013189 (2010). https:\/\/doi.org\/10.1016\/j.entcs.2010.08.041","journal-title":"Elect. Notes Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33170-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:59:58Z","timestamp":1685710798000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33170-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331695","9783031331701"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33170-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Houston, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2023","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":"nfm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/nfm-2023","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":"75","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":"26","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":"3","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":"35% - 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.9","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":"6","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)"}}]}}