- 2006 – 2012 Saint Petersburg State University, master's degree in Information Technology, thesis: Automated transformation of dynamic SQL queries in information system reengineering.
- 2012 – 2016 Ph.D. student at Saint Petersburg State University. PhD thesis: Parsing of dynamically generated code.
- 2013 – 2017 Senior Lecturer at the Saint Petersburg State University.
- 2012 – to date researcher at JetBrains.
- 2017 – to date Associate Professor at the Saint Petersburg State University.
Formal language theory and application for biology, graph databases, static code analysis, formal grammars and other languages specification formalisms, parallel and asynchronous computations.
- Formal Language Theory
- Graph Theory
- Algorithms and Data Structures
- Practice of Programming
- Russian Foundation for Basic Research grant 19-37-90101 (2019-today)
- Russian Science Foundation grant 18-11-00100 (2018-today)
- Russian Foundation for Basic Research grant 18-01-00380 А (2018-today)
- Russian Foundation for Basic Research grant 15-01-05431 А (2015-2017)
- SEIM-2017 -2018 -2019: PC member
- CIBB-2019 (Algebraic and Computational Methods for the Study of RNA Behaviour): PC member
- Invited research speaker at Inria-LINKS
- The Best Research paper in the field of software engineering, and the winner of the Bertrand Meyer’s Award (SECR-2014)
.NET and GPGPU integration based on F# quotations to OpenCL translator.
Modular tool for parser construction and grammars processing
The composition of formal grammars and artificial neural networks for secondary structure analysis.
Space for context-free path querying algorithms research and development.
Is it possible to use partial evaluation for GPGPU programs optimization?Project supervisor: Daniil Berezun
PPoPP '20: Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, February 2020
While GPU utilization allows one to speed up computations to the orders of magnitude, memory management remains the bottleneck making it often a challenge to achieve the desired performance. Hence, different memory optimizations are leveraged to make memory being used more effectively. We propose an approach automating memory management utilizing partial evaluation, a program transformation technique that enables data accesses to be pre-computed, optimized, and embedded into the code, saving memory transactions. An empirical evaluation of our approach shows that the transformed program could be up to 8 times as efficient as the original one in the case of CUDA C naïve string pattern matching algorithm implementation.
Programming and Computer Software, December 2019
Path querying with conjunctive grammars is known to be undecidable. There is an algorithm for path querying with linear conjunctive grammars which provides an over-approximation of the result, but there is no algorithm for arbitrary conjunctive grammars. We propose the first algorithm for path querying with arbitrary conjunctive grammars. The proposed algorithm is matrix-based and allows us to efficiently apply GPGPU computing techniques and other optimizations for matrix operations.
Recently proposed matrix multiplication based algorithm for context-free path querying (CFPQ) offloads the most performance-critical parts onto boolean matrices multiplication. Thus, it is possible to achieve high performance of CFPQ by means of modern parallel hardware and software. In this paper, we provide results of empirical performance comparison of different implementations of this algorithm on both real-world data and synthetic data for the worst cases.Proceedings of the 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), June 2019
Logic, Language, Information, and Computation, June 2019
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.
Proceedings of the 12th International Joint Conference on Biomedical Engineering Systems and Technologies - BIOINFORMATICS, March 2019
We propose a way to combine formal grammars and artificial neural networks for biological sequences processing. Formal grammars encode the secondary structure of the sequence and neural networks deal with mutations and noise. In contrast to the classical way, when probabilistic grammars are used for secondary structure modeling, we propose to use arbitrary (not probabilistic) grammars which simplifies grammar creation. Instead of modeling the structure of the whole sequence, we create a grammar which only describes features of the secondary structure. Then we use matrix-based parsing to extract features: the fact that some substring can be derived from some nonterminal is a feature. After that, we use a dense neural network to process features.
Proceedings of the Institute for System Programming, January 2019
One of the problems in graph data analysis is querying for specific paths. Such queries are usually performed by means of a formal grammar that describes the allowed edge-labeling of the paths. Path query is said to be calculated using relational query semantics if it is evaluated to triple ((A,v1,v2), such that there is a path from v1 to v2 such that the labels on the edges of this path form a string derivable from the nonterminal A. We focus on the Boolean languages that use Boolean grammars to describe the labeling of paths. Although path querying using relational query semantics and Boolean grammars is known to be undecidable, in this work we propose a path querying algorithm on acyclic graphs which uses relational query semantics and Boolean grammars and approximates the exact solution. To achieve better performance in compare with the naive algorithm, considered classes of graphs were limited to acyclic graphs.
Proceedings of the 9th ACM SIGPLAN International Symposium on Scala, September 2018
Transparent integration of a domain-specific language for specification of context-free path queries (CFPQs) into a general-purpose programming language as well as static checking of errors in queries may greatly simplify the development of applications using CFPQs. LINQ and ORM can be used for the integration, but they have issues with flexibility: query decomposition and reusing of subqueries are a challenge. Adaptation of parser combinators technique for paths querying may solve these problems. Conventional parser combinators process linear input, and only the Trails library is known to apply this technique for path querying. We demonstrate that it is possible to create general parser combinators for CFPQ which support arbitrary context-free grammars and arbitrary input graphs. We implement a library of such parser combinators and show that it is applicable for realistic tasks.
Extended abstract at TyDe 2018 (at ICFP).
Proceedings of the 13th Central & Eastern European Software Engineering Conference in Russia (CEE-SECR '17), December 2017
There are several solutions for CFPQ, but how to provide structural representation of query result which is practical for answer processing and debugging is still an open problem. In this paper we propose a graph parsing technique which allows one to build such representation with respect to given grammar in polynomial time and space for arbitrary context-free grammar and graph. Proposed algorithm is based on generalized LL parsing algorithm, while previous solutions are based mostly on CYK or Earley algorithms, which reduces time complexity in some cases.
Perspectives of System Informatics, June 2016
We present a technique for syntax analysis of a regular set of input strings. This problem is relevant for the analysis of string-embedded languages when a host program generates clauses of embedded language at run time. Our technique is based on a generalization of RNGLR algorithm, which, inherently, allows us to construct a finite representation of parse forest for regularly approximated set of input strings. This representation can be further utilized for semantic analysis and transformations in the context of reengineering, code maintenance, program understanding etc. The approach in question implements relaxed parsing: non-recognized strings in approximation set are ignored with no error detection.
Programming Languages and Tools Lab Head of group, researcher
- Formal Grammars and Languages
- Syntax Analysis
- Parsing Algorithms