Skip to main content

Algorithmic debugging and trusted functions

Luo, Yong and Chitil, Olaf (2007) Algorithmic debugging and trusted functions. Technical report. Computing Laboratory, University of Kent, Canterbury, Kent (KAR id:14559)

Language: English
Download (253kB) Preview
[thumbnail of Algorithmic_Debugging.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format


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.

Item Type: Monograph (Technical report)
Additional information: Technical Report 10-07
Uncontrolled keywords: tracing
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 Nov 2021 09:52 UTC
Resource URI: (The current URI for this page, for reference purposes)
Chitil, Olaf:
  • Depositors only (login required):