Nikolay Efanov

Nikolay Efanov
Moscow Institute of Physics and Technology | MIPT · Department of Control/Management and Applied Mathematics

PhD

About

11
Publications
526
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
14
Citations
Introduction
My primary research area is a discrete mathematical modeling for computer science and different applications.

Publications

Publications (11)
Conference Paper
Full-text available
The mathematical model of userspace-based process tree reconstruction via syscall sequences is constructed on the basis of the type-0 formal grammar and prototyped as two-staged grammar analyser with 3 heuristics for grammar shortening. The prototype has been developed to compare with profile-based techniques of syscall collection. The results indi...
Conference Paper
Full-text available
The attributed grammar-based model of userspace process tree reconstruction via syscall sequences is constructed; the method of reconstruction by downward analysis of input tree as input and intermediate representation is proposed. The reconstruction is based on the specified tree transformation iterative process with syntax-semantic interface, whi...
Preprint
The method and tool for detecting characteristic patterns on graph-structured intermediate representations of programs by solving the reachability problem with context- free (CF) constraints are considered. The areas of applicability of the study are: static and hybrid analysis of code, software execution traces and call-graphs analysis. Article pr...
Conference Paper
Full-text available
This paper paper provides the results of experiments on process trees reconstruction using graph rewriting-based method, that is theoretically proved to reconstruct in polynomial time any configuration of process tree with different process’ identifiers as sessions, process groups, reverse-reparents and attributes with the same semantics of process...
Thesis
В работе обсуждаются вопросы применимости существующих способов эмбеддингов графов и построения графовых ядер к задаче сравнения деревьев процессов и их графов реконструкции, а также вопросы реализации подходящих способов на практике для экспериментального сравнения, вопросы сбора и генерации данных для построения экспериментальных наборов данных и...
Thesis
Full-text available
Рассматривается задача построения формальной грамматики с односторонним (правым) контекстом, порождающей язык, описывающий некоторые базовые конструкции кода на языке С++, и позволяющей извлекать элементы семантики на стадии синтаксического анализа токенизированного представления программы.
Preprint
Full-text available
The generalized theory of process tree reconstruction is presented to unify the algorithms of reconstruction graphs searching and extend them to wider class of attributes, which represents different system resources-process credentials, namespaces, file descriptors, IPC primitives, memory mappings etc. The generalization is provided via set of stat...
Article
Full-text available
Рассматривается пример дерева процессов Linux, на котором использование жад-ных алгоритмов построения графа реконструкции даёт аномальные результаты. Осуществляется анализ зависимостей между состояниями процессов в графе рекон-струкции, заключается нарушение полурешёточной упорядоченности по зависимостям в полученных графах. Предлагаются поправки в...
Article
Full-text available
The paper examines the Linux process tree data structure, which arises from the hierarchical scheme of processes generation in Unix-like operating systems. The purpose of study is to highlight the properties of the Linux process trees, which allow to conclude the applicable methods for analyzing such trees, in aim to solve the checkpoint-restore pr...

Questions

Question (1)
Question
Do you know any practically-adequate alternatives for layered queuing networks in the field of model-based performance engineering?

Network

Projects

Projects (2)
Project
Developing a list of formal language theory-based methods for software static analysis. It includes such directions as: 1) Usage of grammars with one-sided contexts for patterns detection in source code 2) Control-Flow and Execution graphs analysis using graph reachability problem with context-free and regular paths labeling.