|
|
Extension of Tool for Executable-File Analysis
Zavoral, Milan ; Ďurfina, Lukáš (referee) ; Matula, Peter (advisor)
This work deals with extension of a tool for executable-files analysis, which is a~part of a retargetable decompiler developed within the Lissom project. This thesis has two main goals. Firstly, it is necessary to analyze the original implementation of this tool and to find its drawbacks. Secondly, we have to implement a whole new tool without the lacks of its predecessor. This solution must be a full-featured analyzer of executable files. Within this thesis, we also focus on accuracy of compiler and packer detection. Among others, this task is achieved by using special heuristics technics of detection that can also recognize polymorphic packers. In the conclusion, the achieved results of this work and their contribution for the retargetable decompiler are discussed.
|
|
|
Decompilation of PowerPC Applications
Mišák, Ján ; Matula, Peter (referee) ; Ďurfina, Lukáš (advisor)
This bachelor thesis deals with the implementing of decompilation of PowerPC applications feature into a decompiler´s front-end. It also contains basic information about PowerPC architecture and information about the Lissom decompiler, especially its front-end. The goal of this work is to implement a feature into the front-end of the decompiler, which provides decompilation of PowerPC binaries. As a result of this bachelor thesis I have created and implemented a couple of analyses as a C++ classes and I have also fixed some earlier implemented code to achieve the required functionality.
|
|
|
Utilization of Compiler Information in Decompilation
Rudolf, Josef ; Ďurfina, Lukáš (referee) ; Křoustek, Jakub (advisor)
This thesis deals with the tool for decompilation of binary code into a higher level language, which is being developed as a part of the Lissom project. In this thesis, we present a method to improve efficiency of extraction of information from binary files, based on the detected compiler. Namely the extraction of parameters, return types and names of function from symbol names via the so-called demangling. As a part of this thesis, differences between mangling schemes of different compilers are compared. Afterwards, the implementation of the demangler is described and finally, demangler is tested and demangling success rate is compared for mangled names created by different compilers. The subsequent task is to propose and implement better integration of tools in preprocessing and front-end parts of the Lissom decompiler and optimize parameter distribution among them.
|
|
|
C Back-End for a Decompiler
Urban, Martin ; Ďurfina, Lukáš (referee) ; Zemek, Petr (advisor)
This thesis deals with the implementation of the back-end of the decompiler, which produces a code in C language. It contains basic information about the principals and using of the reverse engineering either in the area of information technology or apart from it. The main goal is to create the back-end of the decompiler which would generate a code that would be equivalent against the input and will be translatable into a binary code. Functionality of the output code will be conserved in state of the functionality of the source code. The output is the implementation of the classes in C++ language. It does described activity as a part of the general decompiler which is developed in terms of the project Lissom.
|
|
|
Optimizations in the Decompiler's Back-End
Kollár, Jaroslav ; Ďurfina, Lukáš (referee) ; Zemek, Petr (advisor)
This bachelor's thesis describes the design and implementation of optimizations in the retargetable decompiler's back-end. The purpose of these optimizations is to improve readability of the produced source code. In the introduction, basic information about reverse engineering and decompilation is provided. Then, there is an analysis of the source code produced by the decompiler to familiarize the reader with the proposed optimizations. After that, there is the main part of this work, which describes the design and implementation of the proposed optimizations. It is followed by mentioning the techniques that were used for testing. The present work is concluded by a summary of the achieved results and their benefits.
|
|
|
Generic Decompilation of Bytecode into High-Level Representation
Mrázek, Petr ; Zemek, Petr (referee) ; Křoustek, Jakub (advisor)
The work describes methods and principles of decompilation, basic information about reverse engineering and its use in both software engineering and engineering in general. Furthermore, it introduces the decompiler developed within the Lissom project at BUT FIT. The goal of the work is to design and implement a retargetable decompiler for bytecode, which extends the original decompiler.
|
|
|
Source-Code Migration Using Decompilation
Korec, Tomáš ; Ďurfina, Lukáš (referee) ; Zemek, Petr (advisor)
This thesis deals with source-code migration of high-level programming languages using decompilation. A migration tool developed within the thesis is built on top of the middle-end and back-end parts of Lissom project decompiler. Several compilers generating LLVM IR code from input languages are discussed. Compilers suitable for integration to the migration tool were chosen. Compiled LLVM IR code is an input of the decompiler's optimizing middle-end. The output from the migration tool is a code in the C language or Python-like language generated by the back-end of the decompiler. The input languages are Fortran and its dialects, C/C++/Objective-C/Objective-C++, and D. The thesis describes problems connected with migration of these languages, their solutions, and ways to improve quality and readability of the produced source code.
|
|
|
Code Structuring in Decompiler Back-End
Hrbek, David ; Matula, Peter (referee) ; Zemek, Petr (advisor)
The goal of this thesis was to design and implement an algorithm for code structuring in Lissom decompiler's back-end. This algorithm eliminates indirect jumps (branch/goto) from low-level code with a use of high-level constructs, such as conditional statements (if, switch) and loops (for, while). This thesis contains an introduction into the topic of decompilation, some information about the Lissom project's decompiler, a proposal of the structuring algorithm, details of its implementation, testsuite description and results summary.
|
|
|
Java AST Query Language
Bílek, Jiří ; Matula, Peter (referee) ; Křivka, Zbyněk (advisor)
The purpose of this thesis is to design a Java AST query language and implement tool that uses the query language. This work overviews graph databases and their libraries with focus on Neo4J and Titan. This thesis overviews tools Java bytecode analysis as well. Libraries Procyon and BCEL are described in detail. The work includes a proposal the query language and detailed description of the tool implementation, together with the detailed description of the way how Java entities are stored into the graph databases. In the end, the work deals with experiments and the evaluation of the time complexity of the library.
|
|
|
Reverse engineering of platforms Java and Android
Žák, Josef ; Pecinovský, Rudolf (advisor) ; Oraný, Vladimír (referee)
This thesis deals with reverse engineering of Android and Java. It contains a description of existing tools and techniques, including techniques of defense. The first part is focused on available research about the topic. The next part discusses usage of reverse engineering in software development. The next chapters describe Android operating system and concept of a virtual machine on both platforms. Both kinds of architectures are compared (register-based vs stack-based machine). Core of the work is focused on static analysis (content of APK file, disassembling, decompilation). Available decompilers of class and dex files are compared. Testing is made with various versions of Java. The final chapter contains techniques and tools of defense against reverse engineering including a description of pros and cons. Two popular obfuscators are tested (Proguard, DashO).
|
guest ::
