Design of an Algorithmic Debugging Technique for Java Language


The KIPS Transactions:PartA, Vol. 11, No. 1, pp. 97-108, Feb. 2004
10.3745/KIPSTA.2004.11.1.97,   PDF Download:

Abstract

This paper proposes to use an algorithmic debugging technique for locating logical errors in Java programs. The algorithmic debugging is a semi-automated debugging technique that builds an execution tree from a source program and locates logical errors, if any, included in the program from the execution tree with top-down method. So, it is very important to build a suitable execution tree from the various programming languages. In this paper we propose the method for building an execution tree from Java programs and walk through an example. This approach could reduce the number of interactions between a user and a debugging system than the traditional step-wise debugging technique.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
G. H. Jun and Y. W. Hui, "Design of an Algorithmic Debugging Technique for Java Language," The KIPS Transactions:PartA, vol. 11, no. 1, pp. 97-108, 2004. DOI: 10.3745/KIPSTA.2004.11.1.97.

[ACM Style]
Go Hun Jun and Yu Won Hui. 2004. Design of an Algorithmic Debugging Technique for Java Language. The KIPS Transactions:PartA, 11, 1, (2004), 97-108. DOI: 10.3745/KIPSTA.2004.11.1.97.