State of the Practice in Algorithmic Debugging

Authors:
Diego Cheda;Josep Silva
Affiliations:
DSIC, Technical University of Valencia, Camino de Vera s/n, E-46022 Valencia, Spain;DSIC, Technical University of Valencia, Camino de Vera s/n, E-46022 Valencia, Spain
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 11
Cited 1

Declarative error diagnosis

New Generation Computing
Generalized algorithmic debugging and testing

ACM Letters on Programming Languages and Systems (LOPLAS)
GIDTS: a graphical programming environment for Prolog

Proceedings of the 1999 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Algorithmic Program DeBugging

Algorithmic Program DeBugging
A Generalised Query Minimisation for Program Debugging

AADEBUG '93 Proceedings of the First International Workshop on Automated and Algorithmic Debugging
Declarative Programming in Escher

Declarative Programming in Escher
JIVE: java interactive visualization environment

OOPSLA '04 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
A declarative debugger of incorrect answers for constraint functional-logic programs

Proceedings of the 2005 ACM SIGPLAN workshop on Curry and functional logic programming
Combining algorithmic debugging and program slicing

Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Algorithmic Debugging of Java Programs

Electronic Notes in Theoretical Computer Science (ENTCS)
A comparative study of algorithmic debugging strategies

LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation

Implementation of an Optimal Strategy for Algorithmic Debugging

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Algorithmic debugging is a semi-automatic debugging technique which is based on the answers of an oracle (usually the programmer) to a series of questions generated automatically by the algorithmic debugger. The technique typically traverses a record of the execution-the so-called execution tree-which only captures the declarative aspects of the execution and hides operational details. In this work we review and compare the most important algorithmic debuggers of different programming paradigms. In the study we analyze the features incorporated by current algorithmic debuggers, and we identify some features not supported yet by any debugger. We then compare all the debuggers giving rise to a map of the state of the practice in algorithmic debugging.