Deriving a Symbolic Executor for Definitional Interpreters Suitable for the Study of Heuristics

Bachelor thesis (2021)

Authors

L.A. Pîrcălăboiu Electrical Engineering, Mathematics and Computer Science

Contributors

C.B. Poulsen Programming Languages - EEMCS (supervisor 1)
C.R. van der Rest Programming Languages - EEMCS (supervisor 1)
K.G. Langendoen Embedded Systems - EEMCS (supervisor 2)
Faculty
Electrical Engineering, Mathematics and Computer Science
Copyright: © 2021 Laura Pîrcălăboiu
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

Recent years have seen a surge of interest for dynamic testing techniques, one of which is symbolic execution. It is the main point of interest of this research paper, in which we give an overview of a framework for symbolically executing definitional interpreters. We will also discuss techniques that we made use of in developing the symbolic execution framework. The context of this project is the automated grading and validation of student submissions, and the results and performance of our approach will also be reviewed and criticized.