School of Computing

Combining algorithmic debugging and program slicing

Josep Silva and Olaf Chitil

In Eighth ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming , PPDP 2006, pages 182-196. ACM Press, July 2006.

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.

Download publication 199 kbytes (PDF)

Bibtex Record

@inproceedings{2475,
author = {Josep Silva and Olaf Chitil},
title = {Combining Algorithmic Debugging and Program Slicing},
month = {July},
year = {2006},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2006/2475},
    publication_type = {inproceedings},
    submission_id = {8713_1170270680},
    booktitle = {Eighth ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming , PPDP 2006},
    publisher = {ACM Press},
    refereed = {yes},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014