I have been working on my PhD since 2012. The main research area of my thesis has been Algorithmic Debugging, but I h... moreI have been working on my PhD since 2012. The main research area of my thesis has been Algorithmic Debugging, but I have also worked in other research areas such as: Program Slicing, Program Transformation, Content Extraction, or Teaching. Along this time I have produced 35 publications (an average of 7 publications per year). This consists of 10 journals (1 in JCR 1st Quartile, 1 in JCR 2nd Quartile), 22 conference papers (15 International [1 CORE A+, 3 CORE A, 8 CORE B], 7 National), and 3 technical reports. Moreover, I have twice been awarded the Spanish fellowship that allows for performing a research stay in a foreign country. This fellowship has the goal of promoting a collaboration with other research groups as well as improving the collaborative abilities of the beneficiary of the fellowship, and their working experience inside a different research group.edit
ABSTRACT Declarative debugging is a semi-automatic debugging technique that allows the programer to debug a program without the need to see the source code. The debugger generates questions about the results obtained in different... more
ABSTRACT Declarative debugging is a semi-automatic debugging technique that allows the programer to debug a program without the need to see the source code. The debugger generates questions about the results obtained in different computations and the programmer only has to answer them to find the bug. Declarative debugging uses an internal representation of programs called execution tree, whose structure highly influences its performance. In this work we introduce two techniques that optimize the execution trees structure. In particular, we expand and collapse the representation of loops allowing the debugger to find bugs with a reduced number of questions.
Publication Date: 2013
Publication Name: Lecture Notes in Computer Science