Divide-and-query and subterm dependency tracking in the mercury declarative debugger

Authors:
Ian MacLarty;Zoltan Somogyi;Mark Brown
Affiliations:
University of Melbourne, Australia;University of Melbourne, Australia;University of Melbourne, Australia
Venue:
Proceedings of the sixth international symposium on Automated analysis-driven debugging
Year:
2005

Citing 7
Cited 3

Generalized algorithmic debugging and testing

ACM Letters on Programming Languages and Systems (LOPLAS)
Algorithmic Program DeBugging

Algorithmic Program DeBugging
The Evaluation Dependence Tree as a Basis for Lazy FunctionalDebugging

Automated Software Engineering
Rational Debugging in Logic Programming

Proceedings of the Third International Conference on Logic Programming
A Backward Slicing Algorithm for Prolog

SAS '96 Proceedings of the Third International Symposium on Static Analysis
Complete and Partial Redex Trails of Functional Computations

IFL '97 Selected Papers from the 9th International Workshop on Implementation of Functional Languages
Program slicing

ICSE '81 Proceedings of the 5th international conference on Software engineering

Scalable omniscient debugging

Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications
Design and implementation of a tracer driver: Easy and efficient dynamic analyses of constraint logic programs1

Theory and Practice of Logic Programming
Controlling search space materialization in a practical declarative debugger

PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have implemented a declarative debugger for Mercury that is capable of finding bugs in large, long-running programs. This debugger implements several search strategies. We discuss the implementation of two of these strategies and the conditions under which each strategy is useful.The divide and query strategy tries to minimize the number of questions asked of the user. While divide and query can reduce the number of questions to roughly logarithmic in the size of the computation, implementing it presents practical difficulties for computations whose representations do not fit into memory. We discuss how we get around this problem, making divide and query practical.Our declarative debugger allows users to specify exactly which part of an atom is wrong. The subterm dependency tracking strategy exploits this extra information to jump directly to the part of the program that computed the wrong subterm. In many cases, only a few such jumps are required to arrive at the bug. Subterm dependency tracking can converge on the bug even more quickly than divide and query, and it tends to yield question sequences that are easier for users to answer.