Accueil UNamur > Agenda > Concolic testing for (constraint) logic programs

Concolic testing for (constraint) logic programs

Défense de mémoire de Sophie Fortz

Catégorie : mémoire
Date : 17/06/2019 09:30 - 17/06/2019 10:30
Lieu : Salle académique
Orateur(s) : Sophie Fortz
Organisateur(s) : Isabelle Daelman

Concolic testing has been studied for years in the field of imperative programming. However, we can only find a very few cases where this technique is

applied to other paradigms, like logic programming. This master thesis aims at presenting a full method to apply both concrete and symbolic execution

in parallel on Prolog programs. Our approach is based on a new definition of path coverage, specific to logic programming and called ”choice coverage”.

This criteria was defined for the first time by Mesnard et al. (2015). We also introduce a prototype implementation of our algorithm.

Keywords: Concolic execution, symbolic execution, software testing, choice coverage, Prolog, logic programming.

Contact : Isabelle Daelman - 4966 -
Télecharger : vCal