{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:54:49Z","timestamp":1742968489369,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662595329"},{"type":"electronic","value":"9783662595336"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-662-59533-6_17","type":"book-chapter","created":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T19:02:35Z","timestamp":1561230155000},"page":"264-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bar-Hillel Theorem Mechanization in Coq"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Bozhko","sequence":"first","affiliation":[]},{"given":"Leyla","family":"Khatbullina","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7966-0698","authenticated-orcid":false,"given":"Semyon","family":"Grigorev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,9]]},"reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1006\/jcss.1999.1627","volume":"58","author":"Serge Abiteboul","year":"1999","unstructured":"Abiteboul, S., Vianu, V.: Regular path queries with constraints. J. Comput. Syst. Sci. 58(3), 428\u2013452 (1999). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000099916276","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR2","unstructured":"Alkhateeb, F.: Querying RDF(S) with Regular Expressions. Theses, Universit\u00e9 Joseph-Fourier - Grenoble I, June 2008. \nhttps:\/\/tel.archives-ouvertes.fr\/tel-00293206"},{"key":"17_CR3","first-page":"143","volume":"14","author":"Y Bar-Hillel","year":"1961","unstructured":"Bar-Hillel, Y., Perles, M., Shamir, E.: On formal properties of simple phrase structure grammars. Sprachtypologie und Universalienforschung 14, 143\u2013172 (1961)","journal-title":"Sprachtypologie und Universalienforschung"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Barthwal, A.: A formalisation of the theory of context-free languages in higher order logic. Ph.D. thesis, College of Engineering & Computer Science, The Australian National University, December 2010","DOI":"10.1007\/978-3-642-15205-4_11"},{"key":"17_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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-00590-9_12"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-15205-4_11","volume-title":"Computer Science Logic","author":"A Barthwal","year":"2010","unstructured":"Barthwal, A., Norrish, M.: A formalisation of the normal forms of context-free grammars in HOL4. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol. 6247, pp. 95\u2013109. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15205-4_11"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-13824-9_11","volume-title":"Logic, Language, Information and Computation","author":"A Barthwal","year":"2010","unstructured":"Barthwal, A., Norrish, M.: Mechanisation of PDA and grammar equivalence for context-free languages. In: Dawar, A., de Queiroz, R. (eds.) WoLLIC 2010. LNCS (LNAI), vol. 6188, pp. 125\u2013135. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13824-9_11"},{"key":"17_CR8","unstructured":"Beigel, R., Gasarch, W.: A Proof that if $$L = L_1 \\cap L_2$$ where $$L_1$$ is CFL and $$L_2$$ is Regular then $$L$$ is Context Free Which Does Not use PDAs. \nhttp:\/\/www.cs.umd.edu\/~gasarch\/BLOGPAPERS\/cfg.pdf\/"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR \u201997: Concurrency Theory","author":"A Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135\u2013150. Springer, Heidelberg (1997). \nhttps:\/\/doi.org\/10.1007\/3-540-63141-0_10"},{"key":"17_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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-03545-1_6"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s10817-018-9460-x","volume":"61","author":"C Doczkal","year":"2018","unstructured":"Doczkal, C., Smolka, G.: Regular language representations in the constructive type theory of Coq. J. Autom. Reason. 61(1), 521\u2013553 (2018). \nhttps:\/\/doi.org\/10.1007\/s10817-018-9460-x","journal-title":"J. Autom. Reason."},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/11730637_17","volume-title":"Hybrid Systems: Computation and Control","author":"M Emmi","year":"2006","unstructured":"Emmi, M., Majumdar, R.: Decision problems for the verification of real-time software. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol. 3927, pp. 200\u2013211. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11730637_17"},{"key":"17_CR13","unstructured":"Firsov, D.: Certification of Context-Free Grammar Algorithms (2016)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-319-03545-1_7","volume-title":"Certified Programs and Proofs","author":"D Firsov","year":"2013","unstructured":"Firsov, D., Uustalu, T.: Certified parsing of regular languages. In: Gonthier, G., Norrish, M. (eds.) CPP 2013. LNCS, vol. 8307, pp. 98\u2013113. Springer, Cham (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-319-03545-1_7"},{"issue":"5\u20136","key":"17_CR15","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/j.jlamp.2014.09.002","volume":"83","author":"D Firsov","year":"2014","unstructured":"Firsov, D., Uustalu, T.: Certified CYK parsing of context-free languages. J. Log. Algebraic Methods Program. 83(5\u20136), 459\u2013468 (2014)","journal-title":"J. Log. Algebraic Methods Program."},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Firsov, D., Uustalu, T.: Certified normalization of context-free grammars. In: Proceedings of the 2015 Conference on Certified Programs and Proofs, pp. 167\u2013174. ACM (2015)","DOI":"10.1145\/2676724.2693177"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Grigorev, S., Ragozina, A.: Context-free path querying with structural representation of result. arXiv preprint \narXiv:1612.08872\n\n (2016)","DOI":"10.1145\/3166094.3166104"},{"key":"17_CR18","unstructured":"Gross, J., Chlipala, A.: Parsing Parses A Pearl of (Dependently Typed) Programming and Proof (2015)"},{"key":"17_CR19","unstructured":"Hellings, J.: Conjunctive Context-Free Path Queries (2014)"},{"key":"17_CR20","unstructured":"Hellings, J.: Querying for paths in graphs using context-free path queries. arXiv preprint \narXiv:1502.02242\n\n (2015)"},{"key":"17_CR21","unstructured":"Hofmann, J.: Verified Algorithms for Context-Free Grammars in Coq (2016)"},{"key":"17_CR22","unstructured":"Kaiser, J.O.: Constructive formalization of regular languages. Ph.D. thesis, Saarland University (2012)"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-31235-9_12","volume-title":"Scientific and Statistical Database Management","author":"A Koschmieder","year":"2012","unstructured":"Koschmieder, A., Leser, U.: Regular path queries on large graphs. In: Ailamaki, A., Bowers, S. (eds.) SSDBM 2012. LNCS, vol. 7338, pp. 177\u2013194. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-31235-9_12"},{"key":"17_CR24","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1515\/gcc-2012-0016","volume":"4","author":"M Lohrey","year":"2012","unstructured":"Lohrey, M.: Algorithmics on SLP-compressed strings: a survey. Groups Complex. Cryptol. 4, 241\u2013299 (2012)","journal-title":"Groups Complex. Cryptol."},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-37051-9_4","volume-title":"Compiler Construction","author":"Y Lu","year":"2013","unstructured":"Lu, Y., Shang, L., Xie, X., Xue, J.: An incremental points-to analysis with CFL-reachability. In: Jhala, R., De Bosschere, K. (eds.) CC 2013. LNCS, vol. 7791, pp. 61\u201381. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-37051-9_4"},{"key":"17_CR26","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.is.2018.03.002","volume":"76","author":"Sebastian Maneth","year":"2018","unstructured":"Maneth, S., Peternek, F.: Grammar-based graph compression. Inf. Syst. 76, 19\u201345 (2018). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0306437917301680","journal-title":"Information Systems"},{"key":"17_CR27","doi-asserted-by":"publisher","unstructured":"Nederhof, M.J., Satta, G.: Parsing non-recursive context-free grammars. In: Proceedings of the 40th Annual Meeting on Association for Computational Linguistics, ACL 2002, pp. 112\u2013119. Association for Computational Linguistics, Stroudsburg (2002). \nhttps:\/\/doi.org\/10.3115\/1073083.1073104","DOI":"10.3115\/1073083.1073104"},{"issue":"2","key":"17_CR28","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.ic.2004.03.004","volume":"192","author":"Mark-Jan Nederhof","year":"2004","unstructured":"Nederhof, M.J., Satta, G.: The language intersection problem for non-recursive context-free grammars. Inf. Comput. 192(2), 172\u2013184 (2004). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540104000562","journal-title":"Information and Computation"},{"key":"17_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/11823230_7","volume-title":"Static Analysis","author":"P Pratikakis","year":"2006","unstructured":"Pratikakis, P., Foster, J.S., Hicks, M.: Existential label flow inference via CFL reachability. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, pp. 88\u2013106. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11823230_7"},{"key":"17_CR30","unstructured":"Ramos, M.V.M., de Queiroz, R.J.G.B.: Formalization of closure properties for context-free grammars. CoRR abs\/1506.03428 (2015). \nhttp:\/\/arxiv.org\/abs\/1506.03428"},{"key":"17_CR31","unstructured":"Ramos, M.V.M., de Queiroz, R.J.G.B., Moreira, N., Almeida, J.C.B.: Formalization of the pumping lemma for context-free languages. CoRR abs\/1510.04748 (2015). \nhttp:\/\/arxiv.org\/abs\/1510.04748"},{"key":"17_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-662-52921-8_21","volume-title":"Logic, Language, Information, and Computation","author":"MVM Ramos","year":"2016","unstructured":"Ramos, M.V.M., de Queiroz, R.J.G.B., Moreira, N., Almeida, J.C.B.: On the formalization of some results of context-free language theory. In: V\u00e4\u00e4n\u00e4nen, J., Hirvonen, \u00c5., de Queiroz, R. (eds.) WoLLIC 2016. LNCS, vol. 9803, pp. 338\u2013357. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-52921-8_21"},{"key":"17_CR33","unstructured":"Ramos, M.V., Almeida, J.C.B., de Queiroz, R.J., Moreira, N.: Some applications of the formalization of the pumping lemma for context-free languages. In: Proceedings of the 13th Workshop on Logical and Semantic Frameworks with Applications, pp. 43\u201356 (2018)"},{"key":"17_CR34","unstructured":"Ramos, M.V., de Queiroz, R.J.: Formalization of simplification for context-free grammars. arXiv preprint \narXiv:1509.02032\n\n (2015)"},{"issue":"3","key":"17_CR35","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1145\/373243.360208","volume":"36","author":"J Rehof","year":"2001","unstructured":"Rehof, J., F\u00e4hndrich, M.: Type-base flow analysis: from polymorphic subtyping to CFL-reachability. ACM SIGPLAN Not. 36(3), 54\u201366 (2001)","journal-title":"ACM SIGPLAN Not."},{"key":"17_CR36","doi-asserted-by":"publisher","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1995, pp. 49\u201361. ACM, New York (1995). \nhttps:\/\/doi.org\/10.1145\/199448.199462","DOI":"10.1145\/199448.199462"},{"issue":"7","key":"17_CR37","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. Electron. Notes Theor. Comput. Sci. 253(7), 177\u2013189 (2010)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"2","key":"17_CR38","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(91)90374-B","volume":"88","author":"Hiroyuki Seki","year":"1991","unstructured":"Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theor. Comput. Sci. 88(2), 191\u2013229 (1991). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/030439759190374B","journal-title":"Theoretical Computer Science"},{"key":"17_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/978-3-642-11957-6_30","volume-title":"Programming Languages and Systems","author":"D Vardoulakis","year":"2010","unstructured":"Vardoulakis, D., Shivers, O.: CFA2: a context-free approach to control-flow analysis. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 570\u2013589. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-11957-6_30"},{"key":"17_CR40","doi-asserted-by":"publisher","unstructured":"Yan, D., Xu, G., Rountev, A.: Demand-driven context-sensitive alias analysis for Java. In: Proceedings of the 2011 International Symposium on Software Testing and Analysis, ISSTA 2011, pp. 155\u2013165. ACM, New York (2011). \nhttps:\/\/doi.org\/10.1145\/2001420.2001440","DOI":"10.1145\/2001420.2001440"},{"issue":"1","key":"17_CR41","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1145\/3093333.3009848","volume":"52","author":"Q Zhang","year":"2017","unstructured":"Zhang, Q., Su, Z.: Context-sensitive data-dependence analysis via linear conjunctive language reachability. SIGPLAN Not. 52(1), 344\u2013358 (2017). \nhttps:\/\/doi.org\/10.1145\/3093333.3009848","journal-title":"SIGPLAN Not."},{"key":"17_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/978-3-319-46523-4_38","volume-title":"The Semantic Web \u2013 ISWC 2016","author":"X Zhang","year":"2016","unstructured":"Zhang, X., Feng, Z., Wang, X., Rao, G., Wu, W.: Context-free path queries on RDF graphs. In: Groth, P., et al. (eds.) ISWC 2016. LNCS, vol. 9981, pp. 632\u2013648. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-46523-4_38"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-59533-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T15:03:15Z","timestamp":1575644595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-59533-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783662595329","9783662595336"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-59533-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WoLLIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Language, Information, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Utrecht","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wollic2019.sites.uu.nl\/","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":"60","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":"41","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":"6","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":"68% - 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":"2,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":"8","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)"}}]}}