Change search
ReferencesLink to record
Permanent link

Direct link
Possible Extensions to the Byrd Box Tracer Aimed at Experts Discussion paper for poster presentation at PPIG 1992
Number of Authors: 3
1992 (English)Report (Refereed)
Abstract [en]

We argue for the need of a study on how experienced users make use of the Prolog tracing facilities. We know that a lot of time is spent tracing programs during the programming development phase and that often the first attempt to find a bug fails. We divide Prolog bugs into conceptual bugs , related to the problem being solved rather than to the Prolog programming language, and mistakes, related mainly to the syntax of Prolog. We argue that the most Prolog bugs arise from failed unifications, and that a lot of time writing their own debuggers in order to find their conceptual bugs, since they find the tracing facilities inadequate for this purpose. Three changes to Byrd Box trace are suggested in order to enhance the understanding of unification and help experts to find unification bugs quicker. The first change, is to use some techniques from abstract interpretation to make recursive calls condensed into a few lines in the trace. The second idea, is to allow for conditional skipping, where the expert can ask to see a goal before or after a certain goal has unified or failed ( can also be seen in the TPM [Eisenstadt and Brayshaw 88]). The third idea, is to allow the expert to only see calls that affects a certain data structure that is being built or decomposed. The last change to the tracer might possibly allow the expert to find some of her conceptual bugs as well.

Place, publisher, year, edition, pages
Swedish Institute of Computer Science , 1992, 1. , 15 p.
Series
SICS Technical Report, ISSN 1100-3154 ; T92:03
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-22135OAI: oai:DiVA.org:ri-22135DiVA: diva2:1041678
Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(2179 kB)3 downloads
File information
File name FULLTEXT01.pdfFile size 2179 kBChecksum SHA-512
ca8fced4f03adf514e1465fd179806dddc86b21f8e7bde0346388f189a95b2fa8435d689f5a6e9a4c1778718dfc13411b2385f2d612b1674ad1b7f08573b10ce
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 3 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 4 hits
ReferencesLink to record
Permanent link

Direct link