| ViMer: a visual debugger for mercury |
| Full text |
Pdf
(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
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 7, Downloads (12 Months): 24, Citation Count: 0
|
|
|
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.
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE conference on Design automation
Gwo-Dong Chen
, Daniel D. Gajski
|