|
|
Principles of test stimuli generation
Čekan, Ondřej ; Kubátová, Hana (referee) ; Plíva, Zdeněk (referee) ; Kotásek, Zdeněk (advisor)
Výzkum prezentovaný v této práci je zaměřen na návrh obecných principů v oblasti generování stimulů pro různé systémy. Stimuly představují vstupní data systému, které určují jeho chování. Značnou výhodou je využití těchto principů v oblasti funkční verifikace. Funkční verifikace je jedna z verifikačních technik, která ověřuje správné chování systému monitorováním jeho vstupů a výstupů. Návrh zohlednil čtyři klíčová kritéria z hlediska generování stimulů - parametrizovatelnost, rychlost, náhodnost, univerzálnost. Na základě návrhu byla definována architektura generování stimulů pro obecné použití. Pro popis stimulů slouží vstupní struktury, které definují požadovaný formát stimulu a omezující podmínky na něj kladené. Díky tomu je možno získat jak validní stimul, tak měnit omezující podmínky v průběhu generování, což je vhodné především pro získání vyššího pokrytí ve funkční verifikaci. Obecnost definice stimulů je zajištěna pomocí formálního popisu. V rámci výzkumu byly definovány principy tvorby stimulů pro procesory, funkční jednotky i aplikační data. Představený způsob dosahuje zlepšení oproti konvenčním přístupům.
|
|
|
Multi-Dimentional Automata and Their Languages
Hladík, Zdeněk ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This work includes brief overview of the theory behind two-dimentional languages which was the main theme examined in previous work. Based upon this theory there are next chapters introducing a new concept of three-dimentional and multi-dimentional languages. For each type of language there is a definition of corresponding type of strings and string operations. Finally, for each type of language there are definitions of developed formal gramatics and automata. Along with theory, in work there is an demonstration of developed program, which provides simulation of introduced multidimensional automata.
|
|
| |
|
|
Demonstration of Tree Controlled Grammars Properties
Kunštátský, Martin ; Čermák, Martin (referee) ; Koutný, Jiří (advisor)
Tree controlled grammars are grammars regulated by restriction placed on its derivation trees. It is simple and natural extension of context-free grammars. There are several types of derivation tree control, two principles are mentioned in this work: horizontal and vertical control. Application demonstrating tree controlled grammars properties, implemented in Python programming language, is also part of this work.
|
|
|
Generator of 3D Objects Based on L-Systems
Kvita, Jakub ; Solár, Peter (referee) ; Vrábel, Lukáš (advisor)
The aim of this bachelor thesis was to create an interactive system for generating 3D models. The generator is based on L-systems as a kind of formal grammars and turtle graphics for 3D modeling. The application was created in Java SE using JOGL library as access point for OpenGL and rendering. The thesis analyze the theoretical basis of L-systems, turtle graphics and rendering 3D objects and then describes creation of application using the acquired knowledge.
|
|
|
Grammar-based genetic programming
Nohejl, Adam ; Mráz, František (advisor) ; Iša, Jiří (referee)
Tree-based genetic programming (GP) has several known shortcomings: difficult adaptability to specific programming languages and environments, the problem of closure and multiple types, and the problem of declarative representation of knowledge. Most of the methods that try to solve these problems are based on formal grammars. The precise effect of their distinctive features is often difficult to analyse and a good comparison of performance in specific problems is missing. This thesis reviews three grammar-based methods: context-free grammar genetic programming (CFG-GP), including its variant GPHH recently applied to exam timetabling, grammatical evolution (GE), and LOGENPRO, it discusses how they solve the problems encountered by GP, and compares them in a series of experiments in six applications using success rates and derivation tree characteristics. The thesis demonstrates that neither GE nor LOGENPRO provide a substantial advantage over CFG-GP in any of the experiments, and analyses the differences between the effects of operators used in CFG-GP and GE. It also presents results from a highly efficient implementation of CFG-GP and GE.
|
|
|
Multi-Dimentional Automata and Their Languages
Hladík, Zdeněk ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This work includes brief overview of the theory behind two-dimentional languages which was the main theme examined in previous work. Based upon this theory there are next chapters introducing a new concept of three-dimentional and multi-dimentional languages. For each type of language there is a definition of corresponding type of strings and string operations. Finally, for each type of language there are definitions of developed formal gramatics and automata. Along with theory, in work there is an demonstration of developed program, which provides simulation of introduced multidimensional automata.
|
|
|
Grammar-based genetic programming
Nohejl, Adam ; Mráz, František (advisor) ; Iša, Jiří (referee)
Tree-based genetic programming (GP) has several known shortcomings: difficult adaptability to specific programming languages and environments, the problem of closure and multiple types, and the problem of declarative representation of knowledge. Most of the methods that try to solve these problems are based on formal grammars. The precise effect of their distinctive features is often difficult to analyse and a good comparison of performance in specific problems is missing. This thesis reviews three grammar-based methods: context-free grammar genetic programming (CFG-GP), including its variant GPHH recently applied to exam timetabling, grammatical evolution (GE), and LOGENPRO, it discusses how they solve the problems encountered by GP, and compares them in a series of experiments in six applications using success rates and derivation tree characteristics. The thesis demonstrates that neither GE nor LOGENPRO provide a substantial advantage over CFG-GP in any of the experiments, and analyses the differences between the effects of operators used in CFG-GP and GE. It also presents results from a highly efficient implementation of CFG-GP and GE.
|
|
| |
|
|
Generator of 3D Objects Based on L-Systems
Kvita, Jakub ; Solár, Peter (referee) ; Vrábel, Lukáš (advisor)
The aim of this bachelor thesis was to create an interactive system for generating 3D models. The generator is based on L-systems as a kind of formal grammars and turtle graphics for 3D modeling. The application was created in Java SE using JOGL library as access point for OpenGL and rendering. The thesis analyze the theoretical basis of L-systems, turtle graphics and rendering 3D objects and then describes creation of application using the acquired knowledge.
|
guest ::
