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

@inproceedings{MacLarty2005DivideandqueryAS,
  title={Divide-and-query and subterm dependency tracking in the mercury declarative debugger},
  author={Ian MacLarty and Zoltan Somogyi and Mark Brown},
  booktitle={AADEBUG},
  year={2005}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Algorithmic program debugging

  • Ehud Y. Shapiro
  • 1983
Highly Influential
12 Excerpts

Understanding the control flow of Prolog programs

  • Lawrence Byrd
  • In Proceedings of the 1980 Logic Programming…
  • 1980
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…