Proving the Correctness of Algorithmic Debugging for Functional Programs

Chitil, Olaf and Luo, Yong (2007) Proving the Correctness of Algorithmic Debugging for Functional Programs. In: Trends in Functional Programming. Intellect. ISBN 9781841501888. (Full text available)

PDF
Download (80kB)
[img]
Preview

Abstract

This paper formally presents a model of tracing for functional programs based on a small-step operational semantics. The model records the computation of a functional program in a graph which can be utilised for various purposes such as algorithmic debugging. The main contribution of this paper is to prove the correctness of algorithmic debugging for functional programs based on the model. Although algorithmic debugging for functional programs is implemented in several tracers such as Hat, the correctness has not been formally proved before. The difficulty of the proof is to find a suitable induction principle and a more general induction hypothesis.

Item Type: Book section
Uncontrolled keywords: augmented redex trail
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/14485 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year