The PSG system: from formal language definitions to interactive programming environments
ACM Transactions on Programming Languages and Systems (TOPLAS)
Prolog computation model BPM and its debugger PROEDIT2
The 5th Conference on Logic programming '86
A generator for language-specific debugging systems
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Denotational and operational semantics for Prolog
Journal of Logic Programming
A denotational semantics for Prolog
ACM Transactions on Programming Languages and Systems (TOPLAS)
The implementation of pro test: a Prolog debugger for a refined box model
Software—Practice & Experience
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Semantics preserving transformation rules for Prolog
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A new approach to debugging optimized code
PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
A generic approach to monitor program executions
Proceedings of the 1999 international conference on Logic programming
STACS '87 Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science
Continuation Semantics for PROLOG with Cut
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
What's in a Trace: The Box Model Revisited
AADEBUG '93 Proceedings of the First International Workshop on Automated and Algorithmic Debugging
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Tiddle: a trace description language for generating concurrent benchmarks to test dynamic analyses
WODA '09 Proceedings of the Seventh International Workshop on Dynamic Analysis
| Hi-index | 0.00 |
Byrd's box model is a fine-grained Prolog execution model that can be the basis of high-level debugging tools. In this article, we provide a formal specification of Byrd's box model, based on an already existing operational and denotational continuation semantics for Prolog with cut. We show how this specification can be extended to specify richer Prolog trace models. To be able to experiment with trace models, we translate these specifications into λProlog. This translation leads to a Prolog interpreter that performs execution traces. We have hence a formal framework to specify, prototype, and validate Prolog trace models.