Skip to main content

Proving the Correctness of Algorithmic Debugging for Functional Programs

Chitil, Olaf, Luo, Yong (2006) Proving the Correctness of Algorithmic Debugging for Functional Programs. In: Pre-Proceedings of the Seventh Symposium on Trends in Functional Programming, TFP 2006. . (KAR id:14485)

PDF Pre-print
Language: English
Download (141kB) Preview
[thumbnail of provingthe_correctchitil.pdf]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format

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: Conference or workshop item (Paper)
Uncontrolled keywords: augmented redex trail
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 Feb 2021 12:25 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/14485 (The current URI for this page, for reference purposes)
Chitil, Olaf: https://orcid.org/0000-0001-7986-9929
  • Depositors only (login required):