Insa, David; Silva, Josep; Tomás, César Enhancing declarative debugging with loop expansion and tree compression. (English) Zbl 1394.68075 Albert, Elvira (ed.), Logic-based program synthesis and transformation. 22nd international symposium, LOPSTR 2012, Leuven, Belgium, September 18–20, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-38196-6/pbk). Lecture Notes in Computer Science 7844, 71-88 (2013). Summary: 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.For the entire collection see [Zbl 1271.68016]. Cited in 2 Documents MSC: 68N30 Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) Keywords:declarative debugging; tree compression; loop expansion Software:DDebugger PDFBibTeX XMLCite \textit{D. Insa} et al., Lect. Notes Comput. Sci. 7844, 71--88 (2013; Zbl 1394.68075) Full Text: DOI Link