ACM Home Page
Please provide us with feedback. Feedback
ViMer: a visual debugger for mercury
Full text PdfPdf (236 KB)
Source International Conference on Principles and Practice of Declarative Programming archive
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming table of contents
Uppsala, Sweden
Pages: 56 - 66  
Year of Publication: 2003
ISBN:1-58113-705-2
Authors
M. Cameron  Monash University, Australia
M. García de la Banda  Monash University, Australia
K. Marriott  Monash University, Australia
P. Moulder  Monash University, Australia
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 24,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/888251.888258
What is a DOI?

ABSTRACT

ViMer is a visual debugging environment for Mercury programs which has three main contributions. First, it employs a new execution tree representation, the layered AND-OR tree, which we believe provides a better way of visualizing backtracking in AND-OR-like trees. Second, it uses incremental constraint-solving to efficiently draw and incrementally update the visualization of the execution tree. And finally, it borrows techniques from standard tracers (such as the use of spy points to reduce the amount of tree nodes, and the placement of restrictions on the amount of information stored at each node) that help keep the tool efficient while still providing enough information for debugging.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
 
5
Ducassé, M. Opium: An extendable trace analyser for Prolog Journal of Logic Programming 39(4), pp. 177--223, December, 1999.
 
6
 
7
Eisenstadt, M. and Brayshaw, M. The Transparent Prolog Machine (TPM): an execution model and graphical debugger for logic programming. Journal of Logic Programming 5(4), pp. 277--342, December, 1988.
 
8
Jahier, E. Collecting Graphical views of a Mercury program. In 2000 International Workshop on Automated Debugging. http://xxx.lanl.gov/abs/cs.SE/0010038
 
9
Jahier, E. and Ducassé Morphine 0.2 User and Reference Manuals. IRISA, Rennes, 1999
 
10
 
11
 
12
 
13
 
14
 
15
Vaupel, R., Pontelli E. and Gupta G. Visualization of And/Or-Parallel Execution of Logic Programs. In L. Naish (Ed.), Proceedings of the 14th International Conference on Logic Programming, Cambridge, pp. 271--285. MIT Press, July 8-11, 1997.
 
16
Schulte, C. Oz Explorer: A visual constraint programming tool. In L. Naish (Ed.), Proceedings of the 14th International Conference on Logic Programming, Cambridge, pp. 286--300. MIT Press, July 8-11, 1997.
 
17
 
18
Somogyi, Z., Henderson, F. and T. Conway. The execution algorithm of mercury, an efficient purely declarative logic programming language. In Journal of Logic Programming 29(1-3), pp. 17--64, 1996.

Collaborative Colleagues:
M. Cameron: colleagues
M. García de la Banda: colleagues
K. Marriott: colleagues
P. Moulder: colleagues

Peer to Peer - Readers of this Article have also read: