Introduction to algorithms
Generalized algorithmic debugging and testing
ACM Letters on Programming Languages and Systems (LOPLAS)
Instant replay debugging of concurrent logic programs
New Generation Computing - Special issue on the workshop on parallel logic programming
Warren's Abstract Machine: A Tutorial Reconstruction
Warren's Abstract Machine: A Tutorial Reconstruction
Algorithmic Program DeBugging
Software Engineering: A Practitioner's Approach
Software Engineering: A Practitioner's Approach
How to look busy while being as lazy as ever: the Implementation of a lazy functional debugger
Journal of Functional Programming
Compilers: Principles, Techniques, and Tools (2nd Edition)
Compilers: Principles, Techniques, and Tools (2nd Edition)
A New Proposal for Debugging Datalog Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
State of the Practice in Algorithmic Debugging
Electronic Notes in Theoretical Computer Science (ENTCS)
A survey on algorithmic debugging strategies
Advances in Engineering Software
| Hi-index | 0.00 |
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.