Combining Algorithmic Debugging and Program Slicing

Silva, Josep and Chitil, Olaf (2006) Combining Algorithmic Debugging and Program Slicing. In: 8th ACM SIGPLAN international conference on Principles and practice of declarative programming, 10-12 July 2006, Venice, Italy. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)

Abstract

Currently, program slicing and algorithmic debugging are two of the most relevant debugging techniques for declarative languages. They help programmers to find bugs in a semiautomatic manner. On the one hand, program slicing is a technique to extract those program fragments that (potentially) affect the values computed at some point of interest. On the other hand, algorithmic debugging is able to locate a bug by automatically generating a series of questions and processing the programmer's answers. In this work, we show for functional languages how the combination of both techniques produces a more powerful debugging schema that reduces the number of questions that programmers must answer to locate a bug.

Item Type: Conference or workshop item (Paper)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:04
Last Modified: 17 Jul 2009 15:49
Resource URI: http://kar.kent.ac.uk/id/eprint/14448 (The current URI for this page, for reference purposes)
  • Depositors only (login required):