Skip to main content

Combining Algorithmic Debugging and Program Slicing

Silva, Josep and Chitil, Olaf (2006) Combining Algorithmic Debugging and Program Slicing. In: Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative. ACM, New York, USA, pp. 157-166. ISBN 1-59593-388-3. (doi:10.1145/1140335.1140355) (KAR id:14448)

PDF Author's Accepted Manuscript
Language: English
Download (261kB) Preview
[thumbnail of ppdp06.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL:


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: Book section
DOI/Identification number: 10.1145/1140335.1140355
Uncontrolled keywords: program slicing, algorithmic debugging
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Olaf Chitil
Date Deposited: 24 Nov 2008 18:04 UTC
Last Modified: 16 Nov 2021 09:52 UTC
Resource URI: (The current URI for this page, for reference purposes)
Chitil, Olaf:
  • Depositors only (login required):


Downloads per month over past year