National Repository of Grey Literature 159 records found  beginprevious78 - 87nextend  jump to record: Search took 0.00 seconds. 
Pascal with Truffle
Flimmel, Július ; Horký, Vojtěch (advisor) ; Bednárek, David (referee)
Trupple is an unconventional Pascal interpreter built on top of Oracle's Truffle frame- work. By using this framework, it is virtually platform independent because it runs in Java Virtual Machine and can also easily communicate with other Truffle-based languages and Java itself. The interpreter builds an abstract syntax tree from any Pascal source code and consequently executes the tree from its root node. It supports Pascal according to ISO 7185 standard and implements some commonly used exten- sions introduced by Borland's Turbo Pascal compiler. In this work, we describe the architecture of the interpreter, important design decisions, used technologies and we also provide a brief performance evaluation of Trupple. 1
SIMD code generator
Tuček, Karel ; Bednárek, David (advisor) ; Arcaini, Paolo (referee)
Title: SIMD code generator Author: Karel Tuček Department: Department of Software Engineering Supervisor: RNDr. David Bednárek, Ph.D., Department of Software Engineering Abstract: The center of our interest is a problem of pipelined realisation of a special case of data processing networks. These realisations are supposed to realise some computations on series of independent data sets while utilizing SIMD instructions. The aim of this paper is to theoretically investigate the possibilities and the problems of employment of control flow in these networks and also to implement a general framework suitable for generation of these realisations. The main idea is utilisation of an algorithm crawling over partitions of a network factorised with respect to its control flow. Our idea is that SIMD parallelism should take place on the same instruction realised across multiple data sets. We illustrate the problems relevant to employment of branching and loops in these networks. We especially discuss a problem of data ordering and also provide relevant proofs. In the analytical part, we show implementation of a general framework which we believe to be suitable for processing of these networks. We also provide examples utilising Intel's SIMD Streaming Extensions. Keywords: Processing networks SIMD Parallelism iii
A decompiler for Objective-C
Mráček, Jakub ; Yaghob, Jakub (advisor) ; Bednárek, David (referee)
Objective-C is a popular programming language primarily used on the OS X and iOS platforms. We present a practical approach to decompilation of programs written in Objective-C and compiled for the x86 and AArch64 architectures using LLVM. Based on already-known generic reverse engineering techniques and compiler theory, this thesis analyzes new challenges and opportunities that occur in Objective-C binaries. We then offer solutions and algorithms that allow a decompiler to better recognize the high-level structures commonly used in Objective-C source codes. The thesis introduces an implementation of a new decompiler called "Cricket", an interactive GUI application for OS X, which uses the described algorithms and pattern matching methods to reconstruct source code in Objective-C. The decompiler tries to maximize readability of the output and allows user interaction to further modify the generated source code. The implemented software is then evaluated on a popular open-source framework and the results are compared to a competing product. Powered by TCPDF (www.tcpdf.org)
Kind parser generator
Dzurenko, Tomáš ; Žemlička, Michal (advisor) ; Bednárek, David (referee)
Title: Kind parser generator Author: Bc. Tomáš Dzurenko Department: Network and Labs Management Center Supervisor: RNDr. Michal Žemlička, Ph.D., Department of Software and Com- puter Science Education Abstract: This thesis introduces a generator which takes as its input a definition k-kind grammar and creates source code of analyzer or translator for the language generated by this kind grammar. Opposed to traditional LL(k) grammars, k-kind grammars allow usage of direct left recursion in its rules. This allows for more comfortable and clearer formulation of input grammar rules. Keywords: parser, translator, generator, C++, kind grammar
Compiler from Scheme to C/C++
Novák, Jan ; Yaghob, Jakub (advisor) ; Bednárek, David (referee)
Scheme is a simple language which is well suited for analyzing various constructs of programming languages and experiments with code optimization. To implement this language we use an intermediate code called continuation-passing-style, which is widely used in implementations of functional languages. We present its relation to conventional implementations which use stack to control the program. Then we describe simple methods of global static analysis of the language. Analyses are based on abstract interpretation which uses abstract garbage collector. It allows many optimizations such as variable globalization, variable renaming and elimination of unused assignments. Powered by TCPDF (www.tcpdf.org)
A SQL front-end for the Bobox system
Klimperová, Lucie ; Bednárek, David (advisor) ; Lokoč, Jakub (referee)
The goal of this thesis is to design and implement a SQL frontend for Bobox framework which is being developed by Department of software engineering MFF UK. The development of the Bobox framework is motivated by the effort to simplify writing parallel software. The Bobox framework is one of many system implementations for processing stream data and provides runtime environment for evaluating execution plans in the parallel environment. This thesis deals with implementation of a frontend for this framework. The input is a query in SQL language and information about database structure. Frontend will perform syn- tactic and semantic analysis and then translate the input query into intermediate code. The output of this frontend is the intermediate code in the form of relatio- nal algebra written as XML and is used as the input for the following optimizing backend.
Nízkoúrovňový funkcionální programovací jazyk
Kratochvíl, Miroslav ; Bednárek, David (advisor) ; Hric, Jan (referee)
The goal of this thesis is to explore the current possibilities of implementation of compilers of low-level functional languages. It is expected to evaluate theoretical possibilities of functional programming languages, possible limitations that arise from the absence of run-time code support in low-level environment, and to implement a language compiler that demonstrates some chosen properties. Powered by TCPDF (www.tcpdf.org)
Vyhodnocování relačních dotazů v proudově orientovaném prostředí
Kikta, Marcel ; Bednárek, David (advisor) ; Černý, Tomáš (referee)
This thesis deals with the design and implementation of an optimizer and a transformer of relational queries. Firstly, the thesis describes the theory of the relational query compilers. Secondly, we present the data structures and algorithms used in the implemented tool. Finally, the important implementation details of the developed tool are discussed. Part of the thesis is the selection of used relational algebra operators and design of an appropriate input. Input of the implemented software is a query written in a XML file in the form of relational algebra. Query is optimized and transformed into physical plan which will be executed in the parallelization framework Bobox. Developed compiler outputs physical plan written in the Bobolang language, which serves as an input for the Bobox. Powered by TCPDF (www.tcpdf.org)
Implementation of the DEECo component framework for embedded systems
Matěna, Vladimír ; Bureš, Tomáš (advisor) ; Bednárek, David (referee)
Recent development in the field of distributed and decentralized cyber-physical systems led to emerge of DEECo model. As many DEECo use cases are embedded applications it is interesting to evaluate DEECo on embedded hardware. Currently there is only reference DEECo implementation which is written in Java thus cannot be used for embedded applications. As part of this thesis C++ DEECo mapping and embedded CDEECo++ framework were designed using FreeRTOS operating system for task scheduling and synchronization. An example application designed for the STM32F4 board demonstrates usability of the framework. This thesis contains description of the DEECo mapping into the C++ language, source codes of the CDEECo++ framework, documentation and example application including basic measurement of its real- time properties. Powered by TCPDF (www.tcpdf.org)
Static analysis of C# programs
Malý, Petr ; Bednárek, David (advisor) ; Parízek, Pavel (referee)
The goal of this diploma thesis is to study and implement selected methods of static code analysis for C# programs translated into the Common Intermediate Language. The results of this work are integrated into the ParallaX Development Environment system. This diploma thesis focuses on Structural, Points-to and Dependence. analysis. Powered by TCPDF (www.tcpdf.org)

National Repository of Grey Literature : 159 records found   beginprevious78 - 87nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.