|
|
Frege IDE with JetBrains MPS
Satmári, István ; Parízek, Pavel (advisor) ; Kratochvíl, Miroslav (referee)
Frege is an open-source project which brings the popular functional programming language Haskell to the Java ecosystem. JetBrains MPS is an open-source language workbench which allows users to design a new language and build an integrated development environment with a projectional (structured) editor for the created language. In this work we analyzed Frege grammar and created an IDE based on MPS that assists developers with writing code in the Frege language. Our environment includes a set of intuitive editors for editing Frege syntax, provides a simple type checking and implements code generators for the Frege language. Aim of the Frege IDE is its usability. Additionally, the thesis compares projectional editors with the more common plain-text IDEs, such as Eclipse, and evaluates whether they offer any advantage for editing purely functional programming languages.
|
|
|
Artificial player for Dota 2
Kočur, Jan ; Gemrot, Jakub (advisor) ; Parízek, Pavel (referee)
Dota 2 is one of the most popular strategic computer games of the Multiplayer Online Battle Arena (MOBA) genre. MOBA games are based on teamwork and tactical thinking. That makes them an interesting platform for the artificial intelligence (AI) research, that aims to create artificial agents capable of playing the game. However, there does not exist any framework, that would allow the development of complex agents. First, we developed a framework that allows the creation of agents for Dota 2 in Java. Second, we implemented an agent above the framework, that is capable of playing the game.We have divided the work into two parts. First, we have analyzed requirements for our framework and described its architecture. Second, we have analyzed Dota 2 from the AI perspective and implemented agents above our framework. Our agents were capable of playing the game. The framework can be used for further research.
|
|
|
Dynamic Analysis for Finding Endianity Bugs
Kápl, Roman ; Parízek, Pavel (advisor) ; Yaghob, Jakub (referee)
When two computer systems communicate, for example over a network, they must agree on the ordering of bytes within numbers. This ordering is called endianess. Often one of the systems has to swap the order of bytes to the agreed standard. Results of this work help programmers to find places in their program where they forgot to swap the bytes. We have developed a dynamic data-flow analysis built upon the popular Valgrind tool. Compared to the static analysis currently used by the Linux kernel developers, our approach does not require annotation of variables with their endianess. Typically only few places in the program source code will need to be annotated. The analysis can also detect potential bugs that would only manifest if the program was run on computer with opposite endianess. Our approach has been validated on an existing program known to contain yet unfixed endianess problems (RadeonSI OpenGL driver). It has identified all endianess-related bugs and provided useful diagnostic messages together with their location.
|
|
|
A virtual playground for DEECo applications
Khalyeyev, Danylo ; Hnětynka, Petr (advisor) ; Parízek, Pavel (referee)
DEECo is a novel component model for designing software-intensive cyber- physical systems. As a practical realization of this model there was developed the JDEECo implementation, written in Java. The usage of this framework was shown in a number of different scenarios. However, at the moment there are only limited ways to systematically create, simulate, and visualize new scenarios written with this model. This thesis presents a virtual playground that allows to create scenarios featuring autonomic robots programmed in DEECo. The playground offers a number of options in creation of scenarios, including pro- gramming robots and their interactions, customizing and extending the physical environment, and adding interactive objects. These scenarios can also be visu- alized with the developed application. The parameters of visualization can be customized for needs of a specific scenario. The functionality of the application is demonstrated on several example scenarios.
|
|
|
Soothsharp: A C#-to-Viper translator
Hudeček, Petr ; Parízek, Pavel (advisor) ; Ježek, Pavel (referee)
Viper is a verification infrastructure developed at ETH Zurich. Using this infrastructure, programs written in the Viper language may be analyzed for correctness with respect to assertions and contracts. In this thesis, we develop a contracts library and a translator program that compiles C# code into the Viper language and thus allows it to be verified. A user may annotate their C# program with these contracts and then use the translator to determine its functional correctness. The translator supports most C# features, including types and arrays. It also integrates with Visual Studio, showing translation and verification errors to the user on-the-fly.
|
|
|
Monitoring Tool for Distributed Java Applications
Háva, Jakub ; Parízek, Pavel (advisor) ; Hnětynka, Petr (referee)
The main goal of this thesis is to create a monitoring platform and library that can be used to monitor distributed Java-based applications. This work is inspired by Google Dapper and shares a concept called "Span" with the aforementioned project. Spans represent a small specific part of the computation and are used to capture state among multiple communicating nodes. In order to be able to col- lect spans without recompiling the original application's code, instrumentation techniques are highly used in the thesis. The monitoring tool, which is called Distrace, consists of two parts: the native agent and the instrumentation server. Users of the Distrace tool are supposed to extend the instrumentation server and specify the points in their application's code where new spans should be created and closed. In order to achieve high performance and affect the running appli- cation at least as possible, the instrumentation server is used for instrumenting the code. The Distrace tool is aimed to have a small foot-print on the monitored applications, should be easy to deploy and is transparent to target applications from the point of view of the final user. 1
|
|
|
String Analysis for Code Contracts
Dort, Vlastimil ; Parízek, Pavel (advisor) ; Kofroň, Jan (referee)
Using contracts such as method preconditions, postconditions, and class invariants in code is an approach to preventing bugs in object-oriented programs. In the .NET Framework, this is possible due to the framework of Code Contracts, which includes Clousot, a tool for static program analysis based on abstract interpretation. Although string is a fundamental type in .NET programs, Clousot does not have a usable support for analysis of string values. In this thesis, we explore the specifics of string manipulation in the C# language and in the .NET Framework, and show how they can be covered by static analysis. Our approach is to use the methods of the String class and a subset of regular expressions to specify string properties in code, and to use abstract interpretation with non-relational abstract domains to reason about those properties. We chose a small number of already published abstract domains for strings, which vary in their complexity and ability to represent different properties. We adapted those domains to our setting, including definitions of abstract semantics for the supported string methods. We implemented the abstract domains in Clousot in a way that cooperates with numerical analysis and allows adding more string abstract domains in the future. Powered by TCPDF (www.tcpdf.org)
|
|
|
Grammar to JetBrains MPS Convertor
Vysoký, Přemysl ; Parízek, Pavel (advisor) ; Yaghob, Jakub (referee)
JetBrains MPS is a language workbench focusing on domain-specific languages. Unlike many other language workbenches and IDEs, it uses a projectional editor for code. The developer directly manipulates the program in its tree form (AST) and not by editing a text source code. This brings many advantages, but on the other hand requires time-consuming and complicated MPS language definition. The thesis elaborates on the possibility of automating the process of creating MPS language definition from its grammar description. It introduces the MPS editor, evaluates approaches of related projects and describes author's efforts to implement an MPS plugin that allows this import. The chosen approach and the selection of tools used for implementation are justified in the thesis. We point out important problems that any similar project might deal with and we introduce some possible solutions. Furthermore, the thesis contains examples of imported languages, showing the potency of the chosen approach. The thesis also aims to lay groundwork for future extensions and suggest possible improvements.
|
|
|
Web System for Crowdfunding Based on Selling Items with Custom Imprint
Škvařil, Jan ; Parízek, Pavel (advisor) ; Nečaský, Martin (referee)
The aim of this thesis was to design and implement a web system for organization of crowdfunding campaigns that are based on the sale of items with custom imprint. The implemented system automates and facilitates the whole campaign lifecycle from the design of the imprint in an integrated editor through campaign evaluation up to the distribution of final products to customers. Therefore, there is a minimum number of points where the administrator's action is required. Part of the implementation was also seamless integration with external services like on-line payments, printing house, and social networks. Powered by TCPDF (www.tcpdf.org)
|
|
|
Design and implementation of a language for code-golf challenge
Kliber, Filip ; Parízek, Pavel (advisor) ; Kratochvíl, Miroslav (referee)
Code-golf is one of types of programming competitions. Primary objective of such competition is to provide a solution to relatively simple programming task, such that the length of the source code is minimal in terms of bytes. The goal of my thesis is to design and implement a programming language that is suited for code-golf challenges. The language is designed with respect to beginners in the code-golf domain. It preserves readability and intelligibility, and it is based on popular programming languages, but still provides facilities for concise writing of algorithmical solutions for code-golf tasks. The work also contains implementation of a standard library as support for runtime environment of the language. 1
|
guest ::
RSS feed.