Luo, Yong and Chitil, Olaf (2007) Algorithmic debugging and trusted functions. Technical report. Computing Laboratory, University of Kent, Canterbury, Kent (KAR id:14559)
PDF
Language: English |
|
Download this file (PDF/247kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader |
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.
Item Type: | Reports and Papers (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: | 05 Nov 2024 09:49 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/14559 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):