|
| |
|
|
Code Analysis and Transformation To a High-Level Language
Křoustek, Jakub ; Masařík, Karel (referee) ; Meduna, Alexandr (advisor)
This paper describes methods and procedures used for code analysis and transformation. It contains basic information of a science discipline called reverse engineering and its use in information technologies. The primary objective is a construction of a generic reverse compiler or decompiler, i.e. tool that can recompile from binary form (optionally from symbolic machine code) to a high level language. This operation is highly dependent on the concrete instruction set and processor architecture. This problem is solved with description of semantic of each instruction by a special language designed for this use. The output is the high level language code and is functionally equivalent to the input. The program is therefore able to work with each instruction set and code written by it can be transformed into the chosen high level language. This proposal is implemented in practice as a part of project Lissom. Generic decompiler is completely new idea. The thesis contains entirely new techniques from theory of compilers and optimizations made by the author.
|
|
|
Systems that Combine Automata and Grammars
Petřík, Patrik ; Křivka, Zbyněk (referee) ; Meduna, Alexandr (advisor)
This work deals with Systems that combine automata and grammars. We investigate their properties compared with grammar systems and automaton systems. Work is focused on systems, which components are finite state automata, right linear grammars, pushdown automata or context free grammars. We also investigate usage of these systems in compilers.
|
|
|
Processor of TSQL2 on a Relational Database System
Tomek, Jiří ; Chmelař, Petr (referee) ; Rychlý, Marek (advisor)
This thesis is focused on design and implementation of TSQL2 language interpreter for SQL. It briefly introduces temporal database and language TSQL2. Currently available implementations of temporal database systems are introduced and their practical usability for temporal data is reviewed. Main part of this thesis covers design and implementation of TSQL2 interpreter. A working TSQL2 interpreter implemented in Java as JDBC adapter is the result of this work.
|
|
|
Functions Detection in Decompilation
Kábele, Břetislav ; Ďurfina, Lukáš (referee) ; Křoustek, Jakub (advisor)
This work describes methods of functions detection in decompilation. It contains basic information about reverse engineering and its applications in computer science and beyond. Decompiler developed by research group Lissom at FIT VUT Brno is introduced. The main objective is to elucidate several methods of functions detection, discuss their advantages and disadvantages, and identify the problems of functions detection. After detecting the start, end and body of function, it is needed to find the parameters and return values. There are some algorithms presented in this area. The output of this thesis is design and implementation of architecture independent function detection and parameter detection.
|
|
|
Optimalisation of Agent Languages Compiler
Kalmár, Róbert ; Kočí, Radek (referee) ; Zbořil, František (advisor)
The aim of this work is an optimization of AHLL language compiler. Several intermediate representations of compiled code along with code optimization techniques are introduced. The main part of the work is focused on implementing these optimization techniques and generation of the target code in ALLL language. At the end of the work, the results achieved by new version of AHLL compiler are presented. In addition, there are also presented some ideas for the future work on AHLL and the compiler.
|
|
|
Programming CUDA with C#
Zajíc, Jiří ; Kačic, Matej (referee) ; Jurnečka, Peter (advisor)
This master's thesis is focused on GPU accelerated calculations on NVidia graphics card. CUDA technology is used and converted to implementation on a .NET platform. The problem is solved as a compiler from C# programing language to NVidia CUDA language with expression atrributes of C# language that preserves the same semantics of actions. Application is implemented in C# programing language and uses NRefactory, the open-source library.
|
|
|
Optimizations in C Compiler for VLIW Architectures
Baručák, Robert ; Přikryl, Zdeněk (referee) ; Masařík, Karel (advisor)
Presented is implementation of algorithm for alias analysis, which was integrated into LLVM framework. Properties and limitations of various alias analysis algorithms are discussed. Demonstrated are different approaches to working with predicates and integration of these principles with LLVM. One of the outcomes of this master's thesis is design and implementation of algorithm for profile guided if-conversion.
|
|
|
Mobile System for Travelling Support
Blatný, Petr ; Zelený, Jan (referee) ; Očenášek, Pavel (advisor)
This master's thesis describes process of design and development of a mobile system for travelling support. Application named TravelHelper is developed for Android operating system therefore is implemented in Java programing language. In thesis's text is described used platform and its primary construction blocks. Main function of application is a journeys' diary, which allows storing activities of a trips. Application also allows backing up and sharing journeys on a social networks. Other functions of the application are searching for interesting places nearby, manager of travel expenses, translator, currency converter, and a packing list.
|
|
|
A Compiler of Language Python Subset
Falhar, Radek ; Křivka, Zbyněk (referee) ; Kolář, Dušan (advisor)
Python is dynamically typed interpreted programming language. Thanks to its dynamic type system, it is difficult to compile it into statically typed source code. The kind of source code, where it is exactly specified what types exist and what their structure is. Multiple approaches exist how to achieve this and one of the primary ones is type inference. This approach is attempting to infer the type structure from the source code. In case of Python language, this approach is difficult, because resulting type system is quite complex and language itself is not designed for type inference. In this work, I have focused on identifying subset of this language, so that type inference is possible while keeping the natural way the language is used. Then I implemented a compiler, which will compile this subset into statically typed language, which can be translated into native code.
|
guest ::
