
Model and declarative specification language of binary data formats
Author(s) -
Alexander Aleksandrovich Evgin,
Михаил Александрович Соловьев,
V. A. Padaryan
Publication year - 2021
Publication title -
trudy instituta sistemnogo programmirovaniâ ran/trudy instituta sistemnogo programmirovaniâ
Language(s) - English
Resource type - Journals
eISSN - 2220-6426
pISSN - 2079-8156
DOI - 10.15514/ispras-2021-33(6)-3
Subject(s) - computer science , parsing , programming language , key (lock) , binary data , data model (gis) , field (mathematics) , binary number , data manipulation language , data modeling , data structure , feature (linguistics) , theoretical computer science , artificial intelligence , database , linguistics , philosophy , computer security , arithmetic , mathematics , pure mathematics
A number of tasks related to binary data formats include the tasks of parsing, generating and сonjoint code and data analysis. A key element for all of these tasks is a universal data format model. This paper proposes an approach to modeling binary data formats. The described model is expressive enough to specify the most common data formats. The distinctive feature of the model its flexibility in specifying field locations, as well as the ability to describe external fields, which do not resolve into detailed structure during parsing. Implemented infrastructure allows to create and modify a model using application programming interfaces. An algorithm is proposed for parsing binary data by a model, based on the concept of computability of fields. The paper also presents a domain-specific language for data format specification. The specified formats and potential applications of the model for programmatic analysis of formatted data are indicated.