Publications

Logic, Language, Information, and Computation,
The BarHillel theorem states that contextfree 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 BarHillel 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 BarHillel theorem in Coq.
 Entertainment Computing,

Benchmarking Inter and Intra Operator Parallelism on Contemporary Desktop HardwareSYRCoDIS. – С. 6267.,
 arXiv,
 Proceedings of International Conference on Language and Automata Theory and Applications.  2015.  P. 611622.,
 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 811, 2015. Proceedings, volume 539 of Communications in Computer and Information Science, pages 153–161. Springer,

Bioinformatics Institute 2018/19 project abstractsSaintPetersburg, ISBN 9785604309421,
 Present and Ulterior Software Engineering (pp. 119137),

46th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2019). Lisbon, Portugal,
Project page: http://plv.mpisws.org/imm/
 CVPR Workshop,
 Proceedings of 6th International Andrei Ershov Memorial Conference on Perspectives of System Informatics,
 SoftwareMining 2016: Proceedings of the 5th International Workshop on Software Mining,
 22nd International Workshop On Design, Optimization, Languages and Analytical Processing of Big Data (DOLAP 2020), EDBT/ICDT 2020, Copenhagen, Denmark,
 Proceedings of the Institute for System Programming,