Thesis Details
Pokrytím řízené testování vícevláknových programů
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.
parallel programming, multithreaded programs, testing, dynamic analysis, instrumentation, virtualization, Maple, Pin
Černocký Jan, prof. Dr. Ing. (DCGM FIT BUT), člen
Holík Lukáš, doc. Mgr., Ph.D. (DITS FIT BUT), člen
Jaroš Jiří, doc. Ing., Ph.D. (DCSY FIT BUT), člen
Kočí Radek, Ing., Ph.D. (DITS FIT BUT), člen
@bachelorsthesis{FITBT17896, author = "Zuzana Lietavcov\'{a}", type = "Bachelor's thesis", title = "Pokryt\'{i}m \v{r}\'{i}zen\'{e} testov\'{a}n\'{i} v\'{i}cevl\'{a}knov\'{y}ch program\r{u}", school = "Brno University of Technology, Faculty of Information Technology", year = 2015, location = "Brno, CZ", language = "czech", url = "https://www.fit.vut.cz/study/thesis/17896/" }