Formal language theory has a deep connection with such areas as static code analysis, graph database querying, formal verification, and compressed data processing. Many application problems can be formulated in terms of languages intersection. The Bar-Hillel theorem states that context-free languages are closed under intersection with a regular set. This theorem has a constructive proof and thus provides a formal justification of correctness of the algorithms for applications mentioned above. Mechanization of the Bar-Hillel theorem, therefore, is both a fundamental result of formal language theory and a basis for the certified implementation of the algorithms for applications. In this work, we present the mechanized proof of the Bar-Hillel theorem in Coq.
CITATION STYLE
Bozhko, S., Khatbullina, L., & Grigorev, S. (2019). Bar-Hillel Theorem Mechanization in Coq. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11541 LNCS, pp. 264–281). Springer Verlag. https://doi.org/10.1007/978-3-662-59533-6_17
Mendeley helps you to discover research relevant for your work.