Skip to main content

Proving the correctness of algorithmic debugging for functional programs

Luo, Yong and Chitil, Olaf (2007) Proving the correctness of algorithmic debugging for functional programs. In: Nilsson, Henrik, ed. Trends in Functional Programming. Trends in Functional Programming . Intellect Books, Bristol, UK, pp. 19-34. ISBN 978-1-84150-188-8. (KAR id:3558)

PDF Author's Accepted Manuscript
Language: English
Download (151kB) Preview
[thumbnail of 855f80b1ec79273954c0d32d1f7186678447.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: Book section
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: 17 Jun 2008 16:14 UTC
Last Modified: 16 Feb 2021 12:15 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/3558 (The current URI for this page, for reference purposes)
Chitil, Olaf: https://orcid.org/0000-0001-7986-9929
  • Depositors only (login required):