Thesis Details

Automatizované metody hledání chyb v překladačích

Bachelor's Thesis Student: Müller Petr Academic Year: 2007/2008 Supervisor: Vojnar Tomáš, prof. Ing., Ph.D.
English title
Automated Methods of Finding Bugs in Compilers
Language
Czech
Abstract

This thesis discusses an application of the fuzz testing method for testing compilers and interpreters. In the first part, it deals with compilers, optimizations, and bugs typical for an optimizing compiler. It analyzes applicability of static and dynamic analysis methods for searching such bugs and proposes dynamic fuzz testing as suitable for this task. A compiler testing tool suite using this method was implemented within this thesis and applied on several real compilers, including GCC, in which the tool revealed a series of bugs.

Keywords

compilers, testing, random sentence generator, grammars, Python, C language

Department
Department of Intelligent Systems FIT BUT
Degree Programme
Information Technology
Files
Status
defended, grade A
Date
12 June 2008
Reviewer
Smrčka Aleš, Ing., Ph.D.
Committee
Zbořil František V., doc. Ing., CSc. (DITS FIT BUT), předseda
Kolář Dušan, doc. Dr. Ing. (DIFS FIT BUT), člen
Martinek David, Ing. (DIFS FIT BUT), člen
Masopust Tomáš, RNDr., Ph.D. (DIFS FIT BUT), člen
Orság Filip, Ing., Ph.D. (DITS FIT BUT), člen
Sojka Petr, doc. RNDr., Ph.D. (FI MUNI), člen
Citation
MÜLLER, Petr. Automatizované metody hledání chyb v překladačích. Brno, 2008. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2008-06-12. Supervised by Vojnar Tomáš. Available from: https://www.fit.vut.cz/study/thesis/7102/
BibTeX 
@bachelorsthesis{FITBT7102,
    author = "Petr M{\"{u}}ller",
    type = "Bachelor's thesis",
    title = "Automatizovan\'{e} metody hled\'{a}n\'{i} chyb v p\v{r}eklada\v{c}\'{i}ch",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2008,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/7102/"
}

Theses

Back to top