|
| |
|
|
IDE for SCADA Development at CERN
Mareček, Matěj ; Holík, Lukáš (referee) ; Křivka, Zbyněk (advisor)
Cílem této magisterské práce je navrhnout a implementovat IDE (integrované vývojové prostředí), které zvýší efektivitu a bezpečnost vývoje pro SIMATIC WinCC Open Architecture. Tato práce je založena na výzkumu provedeném týmem z Technické univerzity v Eindhovenu a splňuje požadavky pocházející ze SCD sekce v CERN (Evropské organizace pro jaderný výzkum). Vyvinuté IDE je postaveno na platformě Eclipse, přičemž pro syntaktickou analýzu, linkování a sémantickou analýzu kódu používá Xtext framework. IDE nabízí také podporu pro nově vytvořený programovací jazyk, který umožňuje programátorům jednoduše nadefinovat šablonu pro konfigurační soubory používané WinCC OA. Interpret tohoto nového jazyka je schopen provést syntaktickou analýzu šablony a konfiguračního souboru a rozhodnout, zdali konfigurační soubor odpovídá šabloně. Praktickým výstupem této práce je integrované vývojové prostředí, které podporuje vývoj WinCC OA aplikací v CERN a periodicky provádí analýzu kódu těchto aplikací napsaného v jazyce Control script.
|
|
|
Entrepreneurial Project
Holík, Lukáš ; Krejčí, Jaromír (referee) ; Meluzín, Tomáš (advisor)
These Bachelor thesys is aimed on financial health analysis of company Dusab, spol. s.r.o. with asistence of financial analysis tools. The work is also evaluating company recent economical and marketing situation. Other goal of my thesys is drafting business plan, which aim is increasing of company overal turnover and work productivity to make the company Dusab, spol. s.r.o. successful. On the bases of this analysis there are proposed some solutions and last but not least part of the thesys is creating of the new web pages.
|
|
|
Data Structures with Paralell Access
Opletal, Tomáš ; Lengál, Ondřej (referee) ; Holík, Lukáš (advisor)
Parallel programming brings out, apart from the opportunity to spread out a program execution to many simultaneously running processes sharing data, some new problems. It is necessary to synchronize these processes running in parallel and make sure that during the process communication and data sharing there will not arise any troubles. These synchronization algorithms also cannot use too much resources that are otherwise used for the actual program. This thesis describes ways of process synchronization and also provides an implementation of several algorithms for parallel queue. Implemented algorithms were also tested for their performance.
|
|
|
A BDD Library
Troška, Karol ; Holík, Lukáš (referee) ; Lengál, Ondřej (advisor)
Binary decision program is a data structure used in many areas of information technology. This thesis describes BDD as a mathematical formalism and proposes possible representation of BDD in a computer. The propose is focused mainly on a reduction speed of number of memory allocation and on a simplicity and an intuitive system of using a library. There are several examples of a library usage and warnings which programmer should avoid of in the thesis. Proposed representation was implemented in C language.
|
|
|
Context Awareness for Mobile Phones
Szánto, Ladislav ; Holík, Lukáš (referee) ; Rozman, Jaroslav (advisor)
Táto práce má dva cíle. Prvním je pojdenáváni o context awareness dnešných mobilních telefónu a o možnostech jak by mohla byt context awareness využita v rúzných odvetvích biznisu. Druhý cíl je více praktický a pozestáva z implementace aplikace na jednom specifickem mobilním telefónu. Tahle aplikace by mela být schopná získavat rúzna data ze senzorú a ne-senzorú na mobilným telefónu. Také by mela do isté míry být schopná rozlišovat medzi jednotlivými kontextami.
|
|
| |
|
|
Cooperative Project Planning in Getting Things GNOME
Matušov, Izidor ; Holík, Lukáš (referee) ; Smrčka, Aleš (advisor)
This work dicusses the extension for Getting Things GNOME which makes it possible to use it for planning and managment of cooperative projects. Reader is introduced to basics of project planning and project management and selected methods. The target audience and their needs for the extension were identified and their solutions were proposed. This work includes a walkthrough the extension of the user interface in the form of wireframes. The proposed extension was implemented and tested.
|
|
|
Model-Based Testing of JBoss Drools
Široký, Petr ; Holík, Lukáš (referee) ; Letko, Zdeněk (advisor)
Model-based testing (MBT) is using a model of expected behavior of the system to automatically generate a set of tests. It aims at reducing the testing cost when compared to the traditional testing techniques. This work focuses on testing a real-world software system using the selected MBT tool OSMO. The tested system is responsible for compiling business rules and it is one of the main components of the Drools platform, developed by Red Hat. The work describes the introduction of MBT considering the good reception from the community of developers, then the creation of compiler input models and evaluation of the newly created test suite. The usage of the MBT resulted in detection of five reported and three potential issues in the tested code. Using the Drools compiler example, the work summarizes the main strengths and also weaknesses of practical use of MBT techniques.
|
|
|
A Verified Data Structures Library
Rychnovský, Jan ; Holík, Lukáš (referee) ; Lengál, Ondřej (advisor)
This bachelor thesis deals with a methodology of writing verified programs using the VCC tool. The mentioned methodology is based in the principle of extending the program code with additional annotations, which provide a specification of the desired functionality. The VCC tool then uses formal methods to check whether the source code is correct with respect to the given specification. The first part describes formal verification and three basic approaches to it. Subsequently, the satisfiability problems of propositional formulae (SAT) and formulae in theories of predicate logic (SMT) are described. Then the thesis describes the VCC verification tool, its functionality, methodology, syntax and semantics of commands of its intermediate annotation language BoogiePL. The second part of this thesis is focused on the design and implementation of a verified data structures library, which contains singly linked, doubly linked, and circular lists, a binary search tree and a Treiber's stack. The text concludes with a discussion of the learnt knowledge about the programming methodology based on writing verified code.
|
guest ::
RSS feed.