Algorithmic Debugging of Java Programs

In this paper we propose applying the ideas of declarative debugging to the object-oriented language Java as an alternative to traditional trace debuggers used in imperative languages. The declarative debugger builds a suitable computation tree containing information about method invocations occurred during a wrong computation. The tree is then navigated, asking the user questions in order to compare the intended semantics of each method with its actual behavior until a wrong method is found out. The technique has been implemented in an available prototype. We comment the several new issues that arise when using this debugging technique, traditionally applied to declarative languages, to a completely different paradigm and propose several possible improvements and lines of future work.

• Type: Journal
• Year: 2007
• Where: ENTCS
• Authors: Rafael Caballero, Christian Hermanns, Herbert Kuchen
• Keywords: ENTCS 2007, Object-oriented Language Java, Suitable Computation Tree, Traditional Trace Debuggers