|
|
Design of Environment for Many-Core Systems Debugging
Klčo, Michal ; Matula, Peter (referee) ; Hynek, Jiří (advisor)
This thesis describe problem of debugging many-core systems using the integrated development environments. It presents some of the integrated environments, debuggers, their features and analyse them. This thesis also describe designs and implementation of modifications of these tools that helps user to debug many-core system more efficiently and comfortable.
|
|
|
C Language Source Files Similarity Detection
Rek, Petr ; Kučera, Jiří (referee) ; Matula, Peter (advisor)
This thesis deals with design, implementation and testing of the csim tool, which compares two C source files by their similarity. The primary purpose of this tool is testing of a decompiler developed by AVG Technologies s.r.o. Testing is based on comparing abstract syntax trees of the original and decompiled source files. The reader is introduced to the basics of reverse engineering, especially reverse engineering of a binary file into a high-level programming language source file. The process of compiling followed by decompiling of a file is described along with its effect on reverse engineering. The LLVM project and the Clang compiler is introduced to the reader, since its libraries are the foundation upon which the csim tool is built.
|
|
|
Code Structuring in Decompiler Back-End
Porwolik, Tomáš ; Kučera, Jiří (referee) ; Matula, Peter (advisor)
This thesis deals with a decompilation tool which converts low-level binary code to a high-level representation. This tool is being developed by AVG Technologies. The aim of this work is to design and implement a method for code structuring in the decompiler back-end. The designed method works by traversing the control-flow graph with matching of predefined patterns. It is not always possible to structure code using conditional statements and loops. Sometimes also goto statements must be used. The implemented solution is compared with the original solution in the decompiler. According to the results the new solution is faster, better tested, but in greater number of test cases generates invalid code. From the viewpoint of structuring the results are different and sometimes the code is structured better, but sometimes worse.
|
|
|
Advanced Analysis of Control Flow in Malware
Porwolik, Tomáš ; Matula, Peter (referee) ; Ďurfina, Lukáš (advisor)
This thesis deals with the tool for decompilation of binary code to high-level programming language. This tool is being developed within the project Lissom. The aim of this work is the implementation of advanced analysis in control flow. This work is focused on reconstruction the switch statement and calling function through pointer. These problems are solved by adding new methods to control flow analysis. They are described in detail and solution is proposed, implemented and tested. Created solution allows reconstruct the switch statement in most cases and calling function through pointer in simpler cases. The contribution of this work is an improvement of the tool for decompilation in case that decompiled programs use these advanced structures.
|
|
|
Decompilation of Selected C++ Constructions
Mihulka, Tomáš ; Zemek, Petr (referee) ; Matula, Peter (advisor)
This bachelor's thesis deals with the reconstruction of a hierarchy of classes and their virtual methods from programmes created by C++ language . The aim of this work is to extend a decompiler , which has been developed as a part of the Lissom project, by an analysis of those reconstructions for various decompilers . The reconstructions are created through detection of RTTI and virtual tables . The first part of this thesis involves a description of reverse engineering as well as of the Lissom project in terms of the decompiler . The following section of the paper explains the basics of C++ language , its structures and different possibilities of their decompilation . The final part of the paper deals with a design, implementation and testing of a recognition of RTTI and virtual tables .
|
|
|
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.
|
|
|
Reconstruction of Data Types for Decompilation
Matula, Peter ; Ďurfina, Lukáš (referee) ; Křoustek, Jakub (advisor)
This document describes methods for a reconstruction of data types in the decompilation problem. It defines the concept of reverse engineering and introduces decompiler developed by the Lissom project. It presents existing methods of reconstruction of the simple and complex data types, and explains in detail approaches based on data-flow analysis and analysis of the memory operation offsets. The core of this thesis is the design of a new technique of reconstructing simple and complex data types, suitable for deployment in a retargetable decompiler environment of the Lissom project. Basic principles of the new technique, its implementation and related changes in decompiler and intermediate language are described. The solution is tested and the conclusion discusses the achievements, shortcomings and direction of the further work.
|
|
|
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.
|
guest ::
