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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Programming and computer software Ročník 51; číslo 6; s. 415 - 428
Hlavní autoři: Kulagin, I. I., Padaryan, V. A., Koshkin, V. A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Moscow Pleiades Publishing 01.12.2025
Springer Nature B.V
Témata:
Algorithms
Artificial Intelligence
Binary codes
Codes
Computer Science
Data compression
Iterative methods
Operating Systems
Representations
Reverse engineering
Security
Software
Software Engineering
Software Engineering/Programming and Operating Systems
algorithm recovery
dynamic code analysis
binary code analysis
program slicing
ISSN:0361-7688, 1608-3261
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0361-7688
1608-3261
DOI:10.1134/S0361768825700288