Concolic Execution for Testing Definitional Interpreters

Bachelor thesis (2021)

Authors

P. Boon Alexaki Electrical Engineering, Mathematics and Computer Science

Contributors

C.B. Poulsen Programming Languages - EEMCS (mentor)
Cas Van Der Rest Programming Languages - EEMCS (mentor)
K.G. Langendoen Embedded Systems - EEMCS (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2021 Philippos Boon Alexaki
More Info
expand_more

Published Date

02-07-2021

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

Definitional interpreters are difficult to test with a pre-defined test suite. This paper tries to determine the effectiveness of automatic testing of definitional interpreters, using concolic execution. First we develop a model for concolic execution of a functional language. Then we identify different categories of common mistakes when writing interpreters and test which are caught by concolic execution. We find that while concolic execution is promising, as it can find counterexamples for most errors in a small language, the model developed in this paper is not sufficient to generate counterexamples for more complicated languages.

Files

Paper.pdf
(pdf | 0.103 Mb)
Unknown license