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, 7. Intellect UK, United States pp. 19-34. ISBN 978-1841501888. (Full text available)

PDF - Author's Accepted Manuscript
Download (96kB) Preview
[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: Conference or workshop item (Paper)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing
Depositing User: Olaf Chitil
Date Deposited: 17 Jun 2008 16:14 UTC
Last Modified: 30 Oct 2016 09:33 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/3558 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year