Treffer: About Methods for Extracting Algorithms from Binary Code.

This paper proposes an iterative method for extracting algorithms from binary code and constructing their high-level representation. The construction of algorithms by using the proposed method is implemented as an analysis of dynamic slices. The method is based on an algorithm for data flow tracking in forward and backward directions. Two levels of representation of the extracted algorithms are proposed: a slice functional diagram and an algorithm execution diagram. The slice functional diagram is a structured slice representation; as compared to the algorithm execution diagram, it is a lower-level representation. The algorithm execution diagram is a representation that consists only of function summaries and function parameters. The proposed method for constructing algorithms and methods for their representation make it possible to increase the analyst's productivity in solving problems of code security analysis, as well as improve the quality of the results. The developed algorithm representation methods can be used to implement algorithms for automated code security analysis. In addition, the paper overviews some other approaches to extraction of algorithms from binary code and considers their representations in static analysis tools, including some of their flaws and limitations. [ABSTRACT FROM AUTHOR]

Copyright of Programming & Computer Software is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)