|
|
Use-Case of BDD Process in Testing of PHP Applications
Kudaiberdiyeva, Farida ; Letko, Zdeněk (referee) ; Smrčka, Aleš (advisor)
This bachalor's thesis is focused on revealing of main advantages and disadvatages of Behavior Driven Development using by software companies in Czech Republic and abroad. It is dedicated to diferences and grey areas of BDD testing technique in comparison with classic approach of testing of web application using Selenium framework. The goal of this thesis is to find out, whether using of BDD is more appropriate and effective than classic approach of testing. Two frameworks have been compared: PHP Selenium Client by Nearsoft and Behat. Criteria for comparing are: coverage of test cases, way of writing and execution of the scenario, understandability for non-programmers, time for tests creating, probability of not introducing new faults while creating the test, and the level of test's abstraction. From the achieved results is possible to define main pros and cons of each framework. The most effective way of testing is the combination of two of them, i.e. using of Behat framework with adding user-defined sentences and programming code. The least effective way of testing is using just sentences provided by Behat. Additional goal of this bachalor's thesis is to find out, if BDD is appropriate and effective for Dixons Carphone (earlier Dixons Retail) company by providing of independended view on the problem based on real examples.
|
|
|
Coverage-Driven Testing for Multithreaded Programs
Lietavcová, Zuzana ; Šimková, Hana (referee) ; Letko, Zdeněk (advisor)
This work deals with a problem of searching errors in multithreaded programs using a coverage-driven testing technique as perceived in program Maple. The testing consists of two phases. In the first phase of testing a set of coverable behaviours of the tested program is being built. Consequently, the algorithm tries to achieve these behaviours with a help of deterministic test execution. The main acquisition of the work lays in a compact description of Maple including all the technical details. Based on the study of the tool there were weak places identified. Some of them are studied in detail, especially those which use random decision making and prioritizing of the forced behaviours. The result are several modifications of Maple, from which some lead to a higher number of exposed behaviours and higher error exposition in some cases. This is demonstrated on a test suite of parallel programs.
|
|
|
Testing of Concurrent Software with Noise
Kotyz, Jan ; Smrčka, Aleš (referee) ; Letko, Zdeněk (advisor)
The aim of this bachelor thesis is to create a tool for testing of concurrent software written in Python. This testing tool monitors run of the concurrent program with bytecode instrumentation and performs noise injection at selected locations. This results in a dramatic increase in the probability of bug manifestation and therefore allows more efficient detection of bugs typical for concurrent software. The result of this thesis is concurrency testing tool for Python.
|
|
|
Practical Efficiency of Containers
Halámka, Jan ; Letko, Zdeněk (referee) ; Holík, Lukáš (advisor)
This thesis is about theorethical and practical comparrison of following data containers: vector, deque, list, hash table, avl-tree, rb-tree, splay-tree, sg-tree, treap, B-tree, binomial heap, fibonacci heap, rope and skiplist while implementing sets. Asymptotic, amortized and average-case complexity for each of those structures are noted, as well as details about their implementation and description of how are they stored in computer memory. There was also created a set of tests for comparrison purposes, its results are also part of this paper.
|
|
|
Test Optimization by Search-Based Algorithms
Starigazda, Michal ; Holík, Lukáš (referee) ; Letko, Zdeněk (advisor)
Testing of multi-threaded programs is a demanding work due to the many possible thread interleavings one should examine. The noise injection technique helps to increase the number of tested thread interleavings by noise injection to suitable program locations. This work optimizes meta-heuristics search techniques in the testing of concurrent programs by utilizing deterministic heuristic in the application of genetic algorithms in a space of legal program locations suitable for the noise injection. In this work, several novel deterministic noise injection heuristics without dependency on the random number generator are proposed in contrary to the most of currently used heuristic. The elimination of the randomness should make the search process more informed and provide better, more optimal, solutions thanks to increased stability in the results provided by novel heuristics. Finally, a benchmark of programs, used for the evaluation of novel noise injection heuristics is presented.
|
|
|
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.
|
guest ::
