
Ekaterina Вербицкая
Исследовательские группы
Биография
В 2015 году получила диплом на кафедре системного программирования математико-механического факультета СПбГУ.
Профессиональная активность
Работаю над специализацией реляционного языка программирования miniKanren.
Публикации
An Empirical Study of Partial Deduction for MiniKanren
Март 2021
Ekaterina Verbitskaia, Daniil Berezun, Dmitry Boulytchev
Relational Interpreters for Search Problems
2019
Parser combinators for context-free path querying
Сентябрь 2018
Ekaterina Verbitskaia, Ilya Kirillov, Ilya Nozkin, Semyon Grigorev
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.
Relaxed Parsing of Regular Approximations of String-Embedded Languages
Июнь 2016
Ekaterina Verbitskaia , Semyon Grigorev, Dmitry Avdyukhin
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.
String-embedded Language Support in Integrated Development Environment
2014
Semen Grigorev, Ekaterina Verbitskaia, Andrei Ivanov, Marina Polubelova, and Ekaterina Mavchun