One Right Does Make a Wrong

Davie, Thomas and Chitil, Olaf (2006) One Right Does Make a Wrong. In: Pre-Proceedings of the Seventh Symposium on Trends in Functional Programming, TFP 2006. (Submitted) (Full text available)

PDF
Download (448kB)
[img]
Preview

Abstract

Algorithmic debugging is a semi-automatic method for locating bugs in programs. An algorithmic debugger asks a user a series of questions about the intended behaviour of the program. Here we present two new methods that reduces the number of questions a user must answer to locate a bug. First, we describe a heuristic based on comparing computations of the same program with different inputs. Besides a computation that exhibits some erroneous behaviour, we use information from computations that produce correct results. The heuristic uses program slices to identify areas of code that are likely to be correct. Secondly, we describe a method of compressing the search tree that guides the questions of an algorithmic debugger. This compression is particularly successful when used in combination with our heuristic. Both heuristic and tree-compression are applicable to algorithmic debugging in general. We have implemented it for locating bugs in Haskell programs.

Item Type: Conference or workshop item (Paper)
Uncontrolled keywords: algorithmic debugging, functional programs
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: 06 Sep 2011 01:34
Resource URI: http://kar.kent.ac.uk/id/eprint/14486 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year