Abstract: The subject of the research is the method of splitting a disassembled code into logical blocks in automatic mode, searching for software vulnerabilities without using source code (using a binary file or its equivalent, obtained by reverse engineering).The object of the research is the existing code analyzers and features of their functionality.The aim of the study is to consider the possibility of splitting a disassembled code into logical blocks in automatic mode and some of the possible difficulties associated with this.Formulation of the problem. The complexity of analyzing large software products at the level of machine code necessitates the automation of this process. The research methodology is based on a combination of theoretical and empirical approaches using the methods of static and dynamic analysis, comparison, generalization, algorithmization, modeling, synthesis. Key findings. Splitting the code into blocks by sequential in line-by-line analysis of machine code in some cases can lead to misinterpretation. In addition, the analysis of the code according to the conclusions of the functions also does not guarantee the correctness of the determination of the boundaries of the functions. However, in general, the matrix method can be applied to analyze the dependencies of functions on the blocks of code thus selected.The scientific novelty is connected with the determination of promising vectors for the study of software code for vulnerability, the rationale for the approach (building the transition matrix from integer values), which may be the initial stage of preparation for the automated analysis of the disassembled code.

Keywords: Matrix method, Adjacency matrix, IDA Pro utility, FASM compiler, Disassembling, Code analyses, Vulnerabilities, Information security, Code blocks, Matrix building algorithm

References:
Kozachok A. V., Kochetkov E. V. Obosnovanie vozmozhnosti primeneniya verifikatsii programm dlya obnaruzheniya vredonosnogo koda. // Voprosy kiberbezopasnosti. — 2016. — Byp. 3(16). — S. 25–32. ISSN 2311-3456.
Padaryan V. A. Avtomatizirovannyy metod postroeniya eksploytov dlya uyazvimosti perepolneniya bufera na steke / V. A Padaryan, V. V. Kaushan, A. N. Fedotov // Trudy instituta sistemnogo programmirovaniya RAN. — 2014. — T. 26. — № 6. — S. 127–144. ISSN 2079-8156.
Metod poiska uyazvimosti formatnoy stroki / I. A. Vakhrushev [i dr.] // Trudy instituta sistemnogo programmirovaniya RAN. — 2015. — T. 27. — № 4. — S. 23-34. ISSN 2079-8156. DOI: 10.15514/ISPRAS-2015-27(4)-2
Fedotov A. N. Metod otsenki ekspluatiruemosti programmnykh defektov // Trudy instituta sistemnogo programmirovaniya RAN. — 2016. — T. 28. — № 4. — S. 137–148. ISSN 2079-8156. DOI: 10.15514/ISPRAS-2016-28(4)-8.
Nepomnyashchikh A. V., Kulikov G. V., Sosnin Yu. V., Nashchekin P. A. Metody otsenivaniya zashchishchennosti informatsii v avtomatizirovannykh sistemakh ot nesanktsio

Abstract: In article the approach to forecasting of time series groups with use of technologies of the cluster analysis and the principles of multiobjective optimization has been offered. The description of time series – centroids of clusters with use of the forecasting models on the base of the strictly binary trees and the multiobjective modified clonal selection algorithm in case of which the implementation of two quality indicators of models – the affinity indicator based on calculation of an average forecasting relative error and the tendencies discrepancy indicator are involved in selection process of the best forecasting models has been developed. Accounting of quality two indicators of the forecasting model is realized with use of the Pareto-dominance principles applied when forming new populations of the forecasting models in the multiobjective modified clonal selection algorithm. Within the solution of a problem of multiobjective optimization when forming new population of the forecasting models for maintenance of its high variety it is offered to consider values of the crowding distance of the forecasting models. Prospects of application of the general forecasting models created on the base of the strictly binary trees for forecasting of the time series entering one cluster are shown. The results of experimental studies confirming the efficiency of the offered approach to short-term and mid-term forecasting of time series groups within the solution of a problem of multiobjective optimization are given.

Keywords: tendencies discrepancy indicator, affinity indicator, multiobjective optimization, clonal selection algorithm, strictly binary tree, forecasting model, time series, average error rate, Pareto-dominance, crowding distance

References:
Andersen T. Statisticheskiy analiz vremennykh ryadov. Moskva: Mir. 1976. 756 s.
Belov V.V. Problemy faktornogo prognozirovaniya sotsial'no-ekonomicheskikh pokazateley // Vestnik Moskovskogo gosudarstvennogo universiteta priborostroeniya i informatiki. 2005. № 2. S. 116–122.
Terekhov A.A. Identifikatsiya statisticheskogo materiala i konsolidatsiya vremennykh ryadov // Vestnik Ryazanskogo gosudarstvennogo radiotekhnicheskogo universiteta. 2009. № 27. S. 62–70.
Petrushin V.N., Rytikov G.O. Formalizatsiya vremennogo ryada metodom dvoynogo sglazhivaniya // Cloud of Science. 2014. T. 1.№ 2. S. 230–238.
Demidova L. A. Razrabotka odnofaktornykh nechetkikh modeley dlya analiza tendentsiy vremennykh ryadov s ispol'zovaniem geneticheskogo algoritma // Nauchno-tekhnicheskie vedomosti SPbGPU. 2007. № 52-2. S. 156–164.
Demidova L.A. Genetic Algorithm For Optimal Parameters Search In The One-Factor Forecasting Model Based On Continuous Type-2 Fuzzy Sets // Automation and Remote Control. 2013. T. 74. № 2. S. 313–320.
Paklin N.B. Biznes-analit

Abstract: The source data is represented by three-dimensional truth table for 3-demensional functions of binary, ternary and mixed logics. The calculation of values of logic function is performed by geometric interpretations, disjunctive / conjunctive normal forms, non-fully connected artificial neural networks and perceptrons with hidden layer. The article reviews in detail the intermediate results of calculations in all given ways. The authors study properties of mixed logic functions: binary-ternary and 3-2 logics in cases of one, two and three dimensions. The article shows mutually equivalent implementations of logic functions in the form of DNF and non-fully connected artificial neural network. The authors perform replacement of continuous activation function on ternary threshold function. The study uses the methods of DNF constructing; direct synthesis of ANN weight matrices, perceptron is trained using Back Propagation algorithm, some conclusions are made by the laws of mathematical inductions. The paper shows that:

Minimizations of neuron quantity in the perceptron hidden layer implicitly leads to the use of multiple-valued logics;
Some functions of binary-ternary logics may be used for generating disjunctive forms;
There is a decisive way of converting DNF to ANN and vice versa;
In the one-dimension  3-2 logics there only 8 functions and all of them are listed;

The suggested ANN structure can implement any other function of ternary logics of any dimensions.

Keywords: three-valued logic, 3-2 logic, binary-ternary logic, perfect disjunctive form, activation function, separating hyperplane, perceptron, XOR problem, neural network training, Back Propagation algorithm

References:
Kodd E. F. Rasshirenie relyatsionnoy modeli dlya luchshego otrazheniya semantiki. // SUBD, 1996, №2. S. 141-160.
Deyt K.Dzh. Vvedenie v sistemy baz dannykh. Moskva. Vil'yams. 2000. 848 s.
URL: http://dit.ipg.pt./MBP
Giniyatullin V.M. Modelirovanie logicheskikh funktsiy v neyrosetevom bazise. // Neftegazovoe delo, 2008 № 1 C. 35-43.
URL: http://ru.wikipedia.org/wiki/Troichnye_funktsii

Abstract: In the project activities related to the creation of complex technical objects, apply automation design. The design process seems different models depending on the purpose of the application of these models adopted forms or rules of their construction. The concept of a formal representation of the design process, described in the works of Yoshikawa, was further developed in the theory of computer-aided design. During the design stages of release, project procedures and project operations. Stage consists of design procedures, each of which in turn includes a number of project operations. Project operation is a separate step in the design. Each design proce- Mr. completed design decision. In practice, the design of controlled-use network model, which is an organizational tool for project management. The main elements of the network model are: work, and the way the event. In the model, a network schedule, the complex design procedures depicted as a directed graph, which reflects its logical sequence and duration of the relationship. Gantt Chart is the most obvious way of presenting the project schedule.

Keywords: directed graph, network model, project, computer aided design, route design, project management, CAD, project activity, Gantt chart, design stages

References:
Goryachev, A. A. Instrumental'nye sredstva raboty nad proektami v SAPR: Ucheb. Posobie / A. A. Goryachev, A. V. Goryachev, N. E. Novakova.-SPb.: Izd-vo SPbGETU «LETI», 2011. – 72 s.
Novakova N.E. Ontologiya upravleniya znaniyami v proektnoy deyatel'nosti / N. E. Novakova // Izvestiya SPbGETU «LETI», – 2006. – № 3.– C. 8-15.
Novakova, N. E. Modeli i metody prinyatiya proektnykh resheniy v slozhnostrukturirovannykh predmetnykh oblastyakh / N. E. Novakova.-SPb.: Izd-vo SPbGETU «LETI», 2010. 168 s.
Strel'nikov Yu. N. Obobshchenie tipovykh proektnykh protsedur, vypolnyaemykh v SAPR / Yu. N. Strel'nikov // Avtomatizirovannoe proektirovanie v radioelektronike i priborostroenii: Mezhvuz. sb. nauch.tr. /Leningr.elektrotekhn. in-t im. V. I. Ul'yanova (Lenina). – L.: 1989.-C.11-I7.
Joshikawa, H. General design theory and artificial intelligence / Joshikawa, H. / Artificial Intelligence in Manufacturing. Key to Integration?-1987. P. 35-61
Norenkov, I. P. Osnovy avtomatizirovannogo proektirovaniya: Ucheb. dlya vuzov. 2-e izd., pererab. i dop. /

Abstract: The article presents the components and header modules written in Object Pascal, allowing to easy include libraries with such functions and procedures for numerical solution of linear-algebra as BLAS, LAPACK, ARPACK etc. written in FORTRAN. Using these libraries in modern programming languages such as C ++ or Object Pascal is hard due to significant problems associated with the methods of passing parameters to subroutines, as well as to the method of representation of an array in memory. Another serious problem is the numbering of the elements that start from 1 in FORTRAN. In Object Pascal considering this condition may require careful analysis and the modification of the algorithm for solving the problem. This greatly increases the complexity of programming and leads to hidden, difficult to detect algorithmic errors. To provide transparent access the routines of FORTRAN-libraries while programming in Object Pascal in Delphi environment the authors developed two classes of objects for representing one-dimensional arrays TVector and two-dimensional arrays TMatrix.

Keywords: programming, TMatrix, TVector, Object Pascal, delphi, linear algebra, library, fortran, algorithm, subroutine

References:
www.netlib.org/lapack
http://www.caam.rice.edu/software/ARPACK/