|
|
Port of OptaPlanner on Android
David, Tomáš ; Rogalewicz, Adam (referee) ; Letko, Zdeněk (advisor)
This thesis deals with portation of the OptaPlanner tool to the Android operating system. The OptaPlanner is used for solving planning problems and it is completely written in the Java programming language which is also used for application development of the Android operating system. However, Android does not contain all of the Java Standard Edition Application Programming Interface libraries and porting of OptaPlanner to Android thus causes dependency problems. The result of the thesis is solution design and implementation of the problems mentioned above and model Android Vehicle Routing Problem application which uses ported OptaPlanner tool.
|
|
|
Educational Tool for Coloured Petri Nets
Navrátil, Ondřej ; Kočí, Radek (referee) ; Rogalewicz, Adam (advisor)
Coloured Petri nets (CPN) are an extension of a standard place-transition Petri nets (P/T PN). Every token and place have its type (and eventually a value) and various inscriptions can be inserted into the net. CPN excel with great readibility and expresivity. At the same time, they carry a well-defined formal basis, which eases its computer simulation and allows limited verification of certain attributes to be performed. Motivation for doing this project is the simple fact that currently only one public software tool is available for CPN creation and simulation - CPNTools developed on the Aarhus university. The program, however, is quite complicated and hard to handle for an unexperienced user. The goal is to research capabilities and properties of both CPNs and CPNTools and on this basis design and implement a didactic application with swift and intuitive interface that helps users without deeper theoretical insight to get a grasp of the problematics.
|
|
|
Chart Builder Ansible Automation Analytics
Berky, Levente ; Smrčka, Aleš (referee) ; Rogalewicz, Adam (advisor)
Tato práce se zaměřuje na vytvoření webové komponenty k vykreslení grafů ze strukturovanýho datovýho formátu (dále jen schéma) a vytvoření uživatelského rozhraní pro editaci schématu pro Ansible Automation Analytics. Práce zkoumá aktuální implementaci Ansible Automation Analytics a odpovídající API. Dále zkoumá vhodné knihovny pro vykreslování grafů a popisuje základy použitých technologií. Praktická část popisuje požadavky na komponentu a popisuje vývoj a implementaci pluginu. Dále práce popisuje proces testování a~plány budoucího vývoje pluginu.
|
|
|
Using of Linux Containers in Test Fixture
Országh, Marián ; Rogalewicz, Adam (referee) ; Smrčka, Aleš (advisor)
The main focus of this thesis is the study of Linux containers and their application in creation of software test fixtures. The program solution divides the problem into several segments. At first, a configurationisset upin accordance with the user’s specification, next a container is created according to given configuration, and in the end,the created container is launched alongside supplied tests while using the Docker platform. The program itself meets initial requirements although its functionality is not guaranteed as a result of usage of third-party software such as package managers, which may cause unexpected runtime errors. Primary asset of the thesis is the wrapping of the Docker platform to the degree, that its user needs minimal, or no knowledge of the platform, and allows them to create containers in a simplified way
|
|
|
Centralization of Java Security Policy Management
Kalina, Jan ; Rogalewicz, Adam (referee) ; Letko, Zdeněk (advisor)
WildFly is a platform for distributed environment which meets specification of Java Enterprise Edition. This thesis deals with possibilities of centralized management of security policies in this environment. Security policy is a set of permissions to which the Java virtual machine (JVM) limits possibilities of running applications. Just possibilities of security policy using was in WildFly so far heavily restricted. The result of the thesis are extensions of WildFly which add possibility of central deployment of security policies to individual servers, without need for restart that server, into program interface of WildFly and into WildFly management console. Part of result is also patch of core of WildFly, which solve problem of exchange security policy at runtime of JVM.
|
|
|
Analysis of C Programs with Dynamic Linked Data Structures
Šoková, Veronika ; Rogalewicz, Adam (referee) ; Vojnar, Tomáš (advisor)
This master's thesis deals with the analysis of dynamic linked data structures using shape analysis used in the Predator tool. It describes the chosen abstract domain for heap representation - symbolic memory graphs. It deals with the design of framework for the development of static analyzers based on Clang/LLVM. The main contribution is implementing and testing LLVM's transformation passes that simplify the LLVM IR. Second contribution is the optimization of parameters for parallel run of several variants of the Predator tool. Parameters are tuned for benchmark from SV-COMP'16, where our tool won gold medal in Heap Data Structures category. Last contribution is the design of verification core with the focus on the SMG domain.
|
|
|
Web Application for Ebook Library Management
Kocman, Radim ; Rogalewicz, Adam (referee) ; Lengál, Ondřej (advisor)
The aim of this work is to create a web application for ebook library management which builds a web interface around Calibre. A particular focus was given to extensibility and accessibility for a large spectrum of users. The base of the system is the PHP programming language and the Nette Framework library. The text of this thesis describes the complete development process from the analysis of current situation, requirements analysis, system design and user interface design to implementation details and the analysis of testing on a sample of users.
|
|
|
A Tool for Development of OVAL Definitions within OpenSCAP Project
Černý, Jan ; Rogalewicz, Adam (referee) ; Smrčka, Aleš (advisor)
This thesis deals with the SCAP standard, used in area of computer security, and describes its open source implementation OpenSCAP. The analysis focuses on OVAL, a language for determining vulnerabilities and configuration issues on computer systems. Typical problems of OVAL are discussed. Based on obtained findings, an extension of the OpenSCAP project for reporting and diagnostics of OVAL interpretation has been designed. The thesis describes implementation, integration and testing of proposed extension.
|
|
|
Testing Applications Using Linux Containers
Marhefka, Matúš ; Rogalewicz, Adam (referee) ; Smrčka, Aleš (advisor)
This thesis discusses software containers (Docker containers in particular) as a variant of server virtualization. Instead of virtualizing hardware, software containers rest on top of a single operating system instance and are much more efficient than hypervisors in system resource terms. Docker containers make it easy to package and ship applications, and guarantee that applications will always run the same, regardless of the environment they are running in. There is a whole range of use cases of containers, this work examines their usage in the field of software testing. The thesis proposes three main use case categories for running software systems in Docker containers. It introduces aspects for applications running in containers, which should give a better overview about an application setting within containers infrastructure. Subsequently, possible issues with testing software systems running inside Docker containers are discussed and the testing methods which address the presented issues are proposed. One proposed testing method was also used in the implementation of the framework for testing software running in Docker containers which was developed within this work.
|
|
|
Efficient Algorithms for Finite Automata
Hruška, Martin ; Rogalewicz, Adam (referee) ; Lengál, Ondřej (advisor)
Nondeterministic finite automata are used in many areas of computer science, including, but not limited to, formal verification, the design of digital circuits or for the representation of a regular language. Their advantages over deterministic finite automata is that they may represent a language in even exponentially conciser way. However, this advantage may be lost if a naive approach to some operations is taken, in particular for checking language inclusion of a pair of automata, the naive implementation of which performs an explicit determinization of one of the automata. Recently, several new techniques for this operation that avoid explicit determinization (using the so-called antichains or bisimulation up to congruence) have been proposed. The main goal of the presented work is to efficiently implement these techniques as a new extension of the VATA library. The implementation has been evaluated and is superior to other implementations in over 90% of tested cases by the factor of 2 to 100.
|
guest ::
