Abstract
In this paper we investigate trace protocols of PROLOG programs. We present a precise mathematical specification of the box model for definite programs as it was informally introduced by Byrd. We also give a sketch of how to generalize this specification to normal logic programs.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Byrd, L.: PROLOG Debugging Facilities. Technical Report D.A.I. Research Paper 19, Department of Artificial Intelligence, University of Edinburgh, July 1980.
Byrd, L.: Understanding the Control flow of Prolog Programs. In: Proceedings of the Logic Programming Workshop, Debrecen, pages 127–138, 1980.
Ducassé, M.: An Extendable Trace Analyser to Support Automated Debugging. Ph.D. thesis, University of Rennes, France, June 1992. Report 758.
Höök, K.; Taylor, J.; du Boulay, B.: Redo “Try Once and Pass”: the influence of complexity and graphical notation on novices' understanding of Prolog. Instructional Science, 19:337–360, 1990.
Lloyd, J.: Foundations of Logic Programming. Springer-Verlag, Berlin, 2nd extended edition, 1967.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tobermann, G., Beckstein, C. (1993). What's in a trace: The box model revisited. In: Fritzson, P.A. (eds) Automated and Algorithmic Debugging. AADEBUG 1993. Lecture Notes in Computer Science, vol 749. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019408
Download citation
DOI: https://doi.org/10.1007/BFb0019408
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57417-0
Online ISBN: 978-3-540-48141-6
eBook Packages: Springer Book Archive