• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
Of all publications in the section: 143
Sort:
by name
by year
Article
Емеленко А., Маллачиев К., Пакулин Н. В. Труды Института системного программирования РАН. 2017. Т. 29. № 4. С. 295-302.
Added: Feb 12, 2018
Article
С.Д, Кузнецов, Мендкович Н. А. Труды Института системного программирования РАН. 2013. Т. 25. С. 113-130.

This paper describes enhanced algorisms of lexical optimization query. These algorisms detect and remove redundant conditions from query restriction to simplify it. The paper also presents results of implementation of these optimization techniques and those effects on query processing speed. The paper includes four sections. The first section (Introduction) provides general context of the paper. The second section describes three proposed algorithms of lexical query optimization. The first one is the algorithm of absorption. This algorithm allows to find and remove a wide set of conditions that are redundant but are not equal textually even after standardization of whole restriction expression. The second algorithm is an adaptation of well-known Quin-McCluskey algorithm initially designed for minimization of Boolean functions. The last algorithm of lexical query optimization is based on techniques for optimization of systems of linear inequalities. The third section of the paper discusses results of efficiency evaluation of the proposed algorithms. The forth section concludes the paper.

Added: Jan 30, 2018
Article
С.Д. Кузнецов, Мендкович Н. А. Труды Института системного программирования РАН. 2013. Т. 25. С. 113-130.

This paper describes enhanced algorisms of lexical optimization query. These algorisms detect and remove redundant conditions from query restriction to simplify it. The paper also presents results of implementation of these optimization techniques and those effects on query processing speed. The paper includes four sections. The first section (Introduction) provides general context of the paper. The second section describes three proposed algorithms of lexical query optimization. The first one is the algorithm of absorption. This algorithm allows to find and remove a wide set of conditions that are redundant but are not equal textually even after standardization of whole restriction expression. The second algorithm is an adaptation of well-known Quin-McCluskey algorithm initially designed for minimization of Boolean functions. The last algorithm of lexical query optimization is based on techniques for optimization of systems of linear inequalities. The third section of the paper discusses results of efficiency evaluation of the proposed algorithms. The forth section concludes the paper.

Added: Nov 6, 2017
Article
Дробышевский М., Коршунов А., Turdakov D. Y. Proceedings of the Institute for System Programming of the RAS. 2016. Vol. 28. No. 6. P. 153-170.
Added: Aug 28, 2017
Article
Трофимович Ю., Козлов И., Турдаков Д. Ю. Труды Института системного программирования РАН. 2016. Т. 28. № 6. С. 185-196.
Added: Aug 28, 2017
Article
Гетьман А. И., Маркин Ю. В., Обыденков Д. О. и др. Труды Института системного программирования РАН. 2016. Т. 28. № 6. С. 103-110.
Added: Sep 5, 2019
Article
Подымов В. В., Захаров В. А. Труды Института системного программирования РАН. 2014. Т. 26. № 3. С. 145-166.
Added: Sep 29, 2015
Article
Захаров В. А., Новикова Т. А. Труды Института системного программирования РАН. 2012. Т. 22. С. 435-455.
Strong (logic&term) equivalence of programs is the weakest decidable equivalence relation which approximates the functional equivalence of programs. In this paper we develop a new variant of the algorithm for checking strong equivalence of programs. A distinguished feature of our algorithm is that it relies completely on the algebra of finite substitutions which includes the operations of composition and antiunification. The paper begins with a short introduction to the theory of first-order substitutions. In the next section the formal first-order model of sequential programs and strong equivalence are defined. We also describe a preliminary variant of equivalence checking algorithm. This algorithm deals with composition and antiunification operations on finite substitutions. Since the complexity of these operations depends on data structures that represent substitutions, we consider in Section 4 graph-theoretic representations of substitutions as well as upper and lower bounds on the complexity of basic operations on substitutions. To reduce the complexity of equivalence checking algorithm for sequential programs we introduce in Section 5 a new class of truncated substitutions and study the basic algebraic properties of composition and antiunification operations on truncated substitutions. In Section 6 we showed that both operations on truncated substitutions can be performed in time O(n^2) . Finally, in Section 7 using the properties of truncated substitutions we introduced an improved version of the equivalence checking algorithm and proved that its time complexity is O(n^6 ) on the size of programs to be checked.
Added: Sep 30, 2015
Article
Федотов А., Каушан В., Гайсарян С. С. и др. Труды Института системного программирования РАН. 2017. Т. 29. № 6. С. 151-162.

Approaches for code execution using program vulnerabilities are considered in this paper. Particularly, ways of code execution using buffer overflow on stack and on heap, using use-after-free vulnerabilities and format string vulnerabilities are examined in section 2. Methods for automatic generation input data, leading to code execution are described in section 3. This methods are based on dynamic symbolic execution. Dynamic symbolic execution allows to gain input data, which leads program along the path of triggering vulnerability. The security predicate is an extra set of symbolic formulas, describing program's state in which code execution is possible. To get input data, leading to code execution, path and security predicates need to be united, and then the whole system should be solved. Security predicates for pointer overwrite, function pointer overwrite and format string vulnerability, that leads to stack buffer overflow are presented in the paper. Represented security predicates were used in method for software defect severity estimation. The method was applied to several binaries from Darpa Cyber Grand Challenge. Testing security predicate for format string vulnerability, that leads to buffer overflow was conducted on vulnerable version of Ollydbg. As a result of testing it was possible to obtain input data that leads to code execution.

Added: Feb 12, 2018
Article
Шмид А. В. Труды Института системного программирования РАН. 2020. Т. 32. № 5. С. 57-66.

This article describes the family of emulators for IBM mainframe architectures, their development history, functional features and capability, as well as the experience of many years (since 1994) of emulators development and their implementation area. There was sold the relatively simple task (for modern standards) of creating a virtual machine in the VSE/ESA operating system for transferring legacy platform-dependent applications to this target environment. The problem was solved at first for EU computers in Russia, and then for IBM 9221 in Germany and in the other western countries. The transfer was made to the OS/390 environment, and to IBM AIX, quite modern at that time. The virtual execution of any existing IBM mainframe operating systems in the main server OS environments: Linux, Windows, AIX, Z/OS, ZLinux had been provided. There was developed the solution for combining any types of formed virtual computing nodes into heterogeneous geographically distributed computing networks that provide, in particular, multiple mutual redundancy of nodes in the network.

Added: Dec 9, 2020
Article
Гуськова М. С., Бараш Л. Ю., Щур Л. Н. Труды Института системного программирования РАН. 2018. Т. 30. № 1. С. 115-126.

The generation of uniformly distributed random numbers is necessary for computer simulation by Monte Carlo methods and molecular dynamics. Generators of pseudo-random numbers (GPRS) are used to generate random numbers. GPRS uses deterministic algorithms to calculate numbers, but the sequence obtained in this way has the properties of a random sequence. For a number of problems using Monte Carlo methods, random number generation takes up a significant amount of computational time, and increasing the generation capacity is an important task. This paper describes applying SIMD instructions (Single Instruction Multiple Data) to parallelize generation of pseudorandom numbers. We review SIMD instruction set extensions such as MMX, SSE, AVX2, AVX512. The example of AVX512 implementation is given for the LFSR113 pseudorandom number generator. Performance is compared for different algorithm implementations.

Added: Mar 26, 2018
Article
Захаров В. А., Новикова Т. А. Труды Института системного программирования РАН. 2011. Т. 21. С. 141-166.
Many problems in software engineering such as program refactoring, deobfuscation, vulnerability detection, require an efficient toolset for detecting pieces of code that have similar behavior. Current state of art in software clone detection makes it possible to find out only those pieces of code which have the same syntactic structure since. A more profound analysis of functional properties of programs encounters with undecidability of equivalence checking problem for Turing-complete models of computation. To overcome this principal deficiency of modern clone detection techniques we suggest to use equivalence relations on programs that are more strong than functional equivalence. One of such equivalences is a so called logic&term program equivalence introduced by V.E. Itkin in 1972 г. In this paper we build a new algorithm for checking logic&term equivalence of programs. This algorithm is based on the operations for computing the least upper bound and the greatest upper bound in the lattice of finite substitutions. Using this algorithm we also develop a procedure for solving the unification problem for sequential programs, i.e. the problem of computing the most general common instance (specialization) of a given pair of programs (pieces of code).
Added: Sep 30, 2015
Article
Захаров В. А., Подымов В. В. Труды Института системного программирования РАН. 2015. Т. 27. № 4.

Equivalence checking algorithms found vast applications in system programming; they are used in software refactoring, security checking, malware detection, program integration, regression verification, compiler verification and validation. In this paper we show that equivalence checking procedures can be utilized for the development of global optimization transformation of programs. We consider minimization problem for two formal models of programs: deterministic finite state transducers over finitely generated decidable groups that are used as a model of sequential reactive programs, and deterministic program schemata that are used as a model of sequential imperative programs. Minimization problem for both models of programs can be solved following the same approach that is used for minimization of finite state automata by means of two basic optimizing transformations, namely, removing of useless states and joining equivalent states. The main results of the paper are Theorems 1 and 2. Theorems 1. If G is a finitely generated group and the word problem in G is decidable in polynomial time then minimization problem for finite state deterministic transducers over G is decidable in polynomial time as well. Theorem 2. If S is a decidable left-contracted ordered semigroup of basic program statements and the word problem in S is decidable in polynomial time then minimization problem for program schemata operating on the interpretation over S is decidable in polynomial time as well.

Added: Oct 13, 2015
Article
С.С.Гайсарян, Нурмухаметов А., Курмангалеев Ш. и др. Труды Института системного программирования РАН. 2014. Т. 26. № 3. С. 113-126.
Added: Sep 13, 2016
Article
С.С.Гайсарян, Курмангалеев Ш., Долгорукова К. и др. Труды Института системного программирования РАН. 2014. Т. 26. № 1. С. 315-326.
Added: Sep 13, 2016
Article
Pozin B., Berezin A., Novikov R. et al. Proceedings of the Institute for System Programming of the RAS. 2020. Vol. 32. No. 5. P. 121-130.
Added: Dec 7, 2020
Article
Berezin A., Novopashin M., B.A. Pozin и др. Труды Института системного программирования РАН. 2020. Т. 32. № 5. С. 121-130.

Method for conducting a non-invasive screening of the population for carbohydrate metabolism disorders (CMD) has been developed and described. The novelty of the method is that there are no medical standards in the field of endocrinology for the non-invasive type of screening, so the method was based on the results of a clinical study of electrocardiographic abnormalities in patients with CMD, where the method of non-invasive determination of CMD by first-lead ECG was used [1].

During the development of the method, an additional analysis of the ECG sample obtained during the study was performed [1]. As a result of the analysis, it was concluded that the effectiveness of the method (sensitivity and specificity) vary slightly depending on the time of taking an ECG during the day. This means that the patient can come to the screening using the new method of non-invasive detection of CMD not only in the morning and not necessarily on an empty stomach, in contrast to the invasive methods (fasting plasma glucose test and oral glucose tolerance test) [2]. To make a decision «there is a suspicion of CMD /there is no suspicion of CMD», the patient only needs to take up to 2 ECGs.

Added: Dec 8, 2020
Article
Массобрио Р., Несмачнов С., Черных А. и др. Труды Института системного программирования РАН. 2016. Т. 28. № 6. С. 121-140.
Added: Aug 28, 2017
Article
Позин Б. А. Труды Института системного программирования РАН. 2018. Т. 30. № 1. С. 103-114.
Added: Dec 10, 2020
Article
Семакин А. Н. Труды Института системного программирования РАН. 2017. Т. 29. № 5. С. 311-328.
Added: Dec 25, 2017
Article
Кузнецов С. Д., Турдаков Д. Ю., Борисенко О. Д. и др. Труды Института системного программирования РАН. 2014. Т. 26. № 4. С. 45-54.

This article is an overview of scalable infrastructure for storage and processing of genome data in genetics problems. The overview covers used technologies descriptions, the organization of unified access to genome processing API of different underlying services. The article also covers methods for scalable and cloud computing technologies support. The first service in virtual genome processing laboratory is provided and presented. The service solves transcription factors bindning sites prediction problem. The main principles of service construction are provided. Basic requirements for underlying comptutaion software in virtual laboratory environments are provided. Overview describes the implemented web-service (https://api.ispras.ru/demo/gen) for transcription factors binding site prediction. Provided solution is based on ISPRAS API project as an API gateway and load-balancer; the middle-ware task-manager software for pool of workers support and for communications with Openstack infrastructure; OpenZFS as an intermediate storage with transparent compression support. The described solution is easy to extend with new services fitting the basic requirements.

Added: Nov 26, 2017