An algorithmic debugger for Java

Authors:
David Insa;Josep Silva
Affiliations:
Universidad Politécnica de Valencia, Departamento de Sistemas Informáticos y Computación, Spain;Universidad Politécnica de Valencia, Departamento de Sistemas Informáticos y Computación, Spain
Venue:
ICSM '10 Proceedings of the 2010 IEEE International Conference on Software Maintenance
Year:
2010

Citing 0
Cited 4

A survey on algorithmic debugging strategies

Advances in Engineering Software
Optimal divide and query

EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
An optimal strategy for algorithmic debugging

ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
Implementation of an Optimal Strategy for Algorithmic Debugging

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work presents DDJ, an algorithmic debugger for Java. The main advantage of DDJ with respect to previous algorithmic debuggers is its scalability. DDJ has a new architecture based on the use of cache memories that allows it to scale both in time and memory. In addition, it includes new techniques that allow the debugger to start the debugging session even before the execution tree has been produced. We present the new architecture, and describe the main features of this debugger together with a usage scenario.