Публикации
- Procedia Computer Science,
-
Logic, Language, Information, and Computation,
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.
- Lanbook publishing,
- Entertainment Computing,
-
Benchmarking Inter and Intra Operator Parallelism on Contemporary Desktop HardwareSYRCoDIS. – С. 62-67.,
- arXiv,
- Proceedings of International Conference on Language and Automata Theory and Applications. - 2015. - P. 611-622.,
- Journal of Experimental Medicine,
- In Tadeusz Morzy, Patrick Valduriez, and Ladjel Bellatreche, editors, New Trends in Databases and Information Systems - ADBIS 2015 Short Papers and Workshops, BigDap, DCSA, GID, MEBIS, OAIS, SW4CH, WISARD, Poitiers, France, September 8-11, 2015. Proceedings, volume 539 of Communications in Computer and Information Science, pages 153–161. Springer,
- Saint-Petersburg, ISBN 978-5-6043094-2-1,
- Present and Ulterior Software Engineering (pp. 119--137),
-
46th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2019). Lisbon, Portugal,
Project page: http://plv.mpi-sws.org/imm/
- CVPR Workshop,
- 13th International Workshop on Cooperative and Human Aspects of Software Engineering (CHASE),
-
MFCS 2020: 45th International Symposium on Mathematical Foundations of Computer Science