School of Computing

Algorithmic debugging and trusted functions

Yong Luo and Olaf Chitil

Technical report 10-07, University of Kent, Computing Laboratory, UK, August 2007.

Abstract

As the name states, trusted functions do not have bugs. It is up to user to specify which function is trusted. Commonly used functions in standard library are normally trusted. In the process of algorithmic debugging, we search for faulty nodes to locate bugs. Since a trusted function cannot be a faulty node, there is no point to keep trusted func- tions in Evaluation Dependency Trees (EDT) for algorithmic debugging. In this report, we create smaller tree structures by removing trusted func- tions. There are two different ways to achieve this: generating a smaller tree structure directly from the original trace; or creating a smaller trace first and then from which generating a smaller tree structure.

Download publication 225 kbytes (PDF)

Bibtex Record

@techreport{2642,
author = {Yong Luo and Olaf Chitil},
title = {Algorithmic debugging and trusted functions},
month = {August},
year = {2007},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2007/2642},
    publication_type = {techreport},
    submission_id = {18654_1201808991},
    type = {Technical report},
    number = {10-07},
    address = {UK},
    institution = {University of Kent, Computing Laboratory},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014