This paper discusses the implementation of a suitable algorithm for code generation from UML state machine diagrams. The work includes analysis of state machines described in UML, followed by a description of the input fi le format of the proposed design of the generator and the generator itself. The generator was fully implemented in the work along with other functional requirements. At the end of this thesis is a description of the resulting implementation.

Diplomová práce popisuje vývojovou techniku model based design a její použití pro návrh a testování algoritmů. Popis této techniky je proveden na příkladu praktického využití v praxi při vývoji modulu monitorování stavu motoru ve spolupráci se společností Unis. Vývoj v oblasti současné letecké techniky klade velký důraz na monitorování životnosti zařízení. Podle výstupů algoritmu se dají naplánovat preventivní opravy s ohledem na aktuální podmínky opotřebení a provozování. Implementace algoritmů je provedena v prostředí Matlab/Simulink s následným testováním na platformě dSpace

In order to prevent, detect and fix errors in software, various tools for programmers are available, while some of them are able to reason about the behaviour of the program. In the case of C# programming language, the main representatives are Microsoft FxCop, Code Contracts and Pex. Those tools can, indeed, help to build a highly reliable software. However, when a company wants to include them in the software development process, there is a significant overhead involved. Therefore, we created a "light- weight" assertion verification tool called AskTheCode that can help the user to focus on a particular problem at a time that needs to be solved. Because of its goal-driven approach, we decided to implement it using backward symbolic execution. Although it can currently handle only basic C# statements and data types, the evaluation against the existing tools shows that it has the potential to eventually provide significant added value to the user once developed further. Powered by TCPDF (www.tcpdf.org)

Both J2BP and PANDA tools verify compiled Java programs. By now, these tools are not able to process some programs with specific JVM bytecode instruction sequences in the correct way. We described these instruction sequences and proposed their transformations. We developed the new application, called BytecodeTransformer, based on these propositions. This application transforms compiled Java programs and replaces the problematic instruction sequences with some others. Usage of BytecodeTransformer enlarges the set of programs that can be verified by both J2BP and PANDA. We also evaluated BytecodeTransformer on several Java programs, including own tests and well-known open-source programs. These tests demonstrated the correct functionality of BytecodeTransformer. Powered by TCPDF (www.tcpdf.org)

The topic of this paper is creation of new ServiceNow development tool. ServiceNow is cloud based IT service support management tool. It is widely customizable, mainly by creating scripts. The problem is that scripts are created via web browser, which is not very user friendly. The main goal of this paper is to design better solution for creating scripts in ServiceNow and implement it for selected integrated development environment - Eclipse. Created development tool should support these operations - checking out scripts from ServiceNow to local workspace, editing them in special editor, updating them to newest version and committing them back to ServiceNow with check that work of some other developer is not overwritten. The main contribution of this paper is created ServiceNow development tool that provides better user experience than existing solutions. This paper is only start of development. It will continue in the future.

This paper describes information about current most widespread methods, which are used by rootkits. It contains basic information connected with development of rootkits, such as process registers, memory protection and native API of Windows operation system. The primary objective of this paper is to provide overview of techniques, such as hooking, code patching and direct kernel object modification, which are used by rootkits and present methods to detect them. These methods will be then implemented by detection and removal tools of rootkits based on these techniques.

The thesis deals with the development of the web-based Helpdesk application which ensures and supports the communication with Internet users. The first section of the thesis contains a brief description of the individual means and tools used by the developer. The practical part describes the design and development of the individual layers of the web-based application concerned. The latter section also mentions the development and usage of the required synchronization and code generation tools.

In this project I deal with basic description of source code obfuscation and size reduction techniques of programming languages. The project is primary aimed on scripting language named JavaScript and involved analysis of free obfuscation tools for this language. In the final stage I have created an application is based on theoretical scope of this project and able to obfuscate JavaScript source codes on different levels.

One of the important feature of application specific processors is performance. To maximize it, the compiler must adapt to needs of processor that it is going to compile for and it must generate the most efficient code. One of the ways to do that is to search for appropriate instructions that can be implemented as one instruction with multiple outputs. Afterwards the generated code can be parsed through peephole optimizations that search for instruction patterns and replace them with other instructions to make code more effective. This paper describes the problem of finding and selecting suitable candidates for multiple output instructions. It also provides a brief overview of the few best known algorithms that solve this problem. Eventually it examines possibilities of incorporating this optimizations to LLVM compiler.

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.