Talks & master-classes

Linux Process Tree Reconstruction Using The Attributed Grammar-Based Tree Transformation Model

October 13, 14:50
Room IV

Discuss the presentation

The problem of constructing attribute grammar and syntactic-semantic interface for restoring chains of system calls generating some input tree of Linux processes is considered. An experimental comparison is made with the BPSF method presented on SEC(R) -2017, and the advantages of new proposed method are demonstrated, and the theoretical estimations of time complexity are provided. Finally, some generalization problems are also discussed.

The main idea of this research is: “Why do we parse lines, if the Linux processes are joined into a tree? Let’s parse trees!”

Nikolay Efanov

Николай Ефанов. Восстановление дерева процессов Linux трансформациями дерева, управляемыми атрибутной грамматикой

Teaching assistant/PhD Student, MIPT

Since 2017 works on a list of ML Projects in MIPT.

2016-2017 Worked on a grant from the Infotecs-Academy, winner of the research support program.

2015-2016 Worked as a Junior Software Developer in Virtuozzo(former Parallels).

2014-2015 Worked as a Junior Software Developer in Parallels.

2010-2016 Studying at the Moscow Institute of Physics and Technology. Graduated from the Faculty of Management and Applied Mathematics in 2016. Postgraduate student of the Department of Informatics.

2007-2010 Studied at the Taurida NU at the Faculty of Applied Mathematics

Born in Simferopol in 1990.

Sponsors & Partners

Sponsors

Gold

JetBrainsFirst Line Software

Sponsors

BellSoftPVS-Studio

Embedded

Auriga

Partners

Gold

Digital October

Main partners

RUSSOFTAP KIT

In cooperation

ACM Special Interest Group on Software EngineeringAssociation for Computing Machinery

Technical partners

CUSTIS0x1.tvMajordomo

Organizers

Software Russiai-Help