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. (doi:10.1145/1140335.1140355) (Full text available)

PDF - Author's Accepted Manuscript
Download (204kB) Preview
[img]
Preview
Official URL
http://doi.acm.org/10.1145/1140335.1140355

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)
Uncontrolled keywords: program slicing, algorithmic debugging
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Theoretical Computing Group
Depositing User: Olaf Chitil
Date Deposited: 24 Nov 2008 18:04 UTC
Last Modified: 28 Oct 2016 17:14 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/14448 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year