Nancy Mazur, Peter Ross, Gerda Janssens, and Maurice Bruynooghe. Practical aspects for a working compile time garbage collection system for Mercury. In Proceedings of the Seventeenth International Conference on Logic Programming, volume 2237 of Lecture Notes in Computer Science, pages 105--119. Springer, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On Enabling the WAM with Region Support - Makholm, Sagonas (Correct)
....very sophisticated schemes for collecting garbage efficiently now exist, the process is still potentially time consuming and hard to predict. It would be desirable to move some of the workload to the compiler. Several proposals for doing compile time garbage collection have been made; see e.g. [8, 7] and the references therein. Region based memory management [10] takes this principle to the limit. Here all deallocation points in the program are determined by a compile time analysis, and the runtime system needs only to carry out the preselected actions. Though not all programs are ....
N. Mazur, P. Ross, G. Janssens, and M. Bruynooghe. Practical aspects for a working compile time garbage collection system for Mercury. In Codognet, ed., Proceedings of the 17th ICLP, number 2237 in LNCS, pages 105--119. Springer, 2001.
Collecting Potential Optimisations - Mazur, Janssens, Vanhoof Self-citation (Mazur Janssens) (Correct)
....is introduced using a simple optimisation example, then schematically generalised to abstract domains endowed with a generalised pseudo complement operator. This abstract represents work in progress. 1 Introduction We have previously developed a compile time garbage collection (CTGC) system [8] for the modern logic programming language Mercury [9] The purpose of such a system is to optimise the memory usage of a given program, by detecting at compile time when heap cells representing data become garbage and then deciding to reuse these heap cells for representing new data. This ....
....new data. This analysis is based on liveness analysis, which itself is based on possible alias information [1] Overall, the analyses are bottom up goal independent, which makes separate analysis of program modules possible [7] The system was implemented and its evaluation was described in [8]. One of the recurring open issues in this work is the problem of controlling the number of optimised versions that are generated for each predicate in a program. As our attention was mainly focused on analysis precision and speed, we handled the versioning issue by simply deciding to generate at ....
N. Mazur, P. Ross, G. Janssens, and M. Bruynooghe. Practical aspects for a working compile time garbage collection system for Mercury. In P. Codognet, editor, Proceedings of ICLP 2001 - Seventeenth International Conference on Logic Programming, volume 2237 of LNCS. Springer-Verlag, 2001.
Precise and Expressive Mode Systems for Typed Logic Programming.. - Overton (2003) (Correct)
No context found.
Nancy Mazur, Peter Ross, Gerda Janssens, and Maurice Bruynooghe. Practical aspects for a working compile time garbage collection system for Mercury. In Proceedings of the Seventeenth International Conference on Logic Programming, volume 2237 of Lecture Notes in Computer Science, pages 105--119. Springer, 2001.
the Garbage Collection Bibliography - Richard Jones (2003) (Correct)
No context found.
Nancy Mazur, Peter Ross, Gerda Janssens, and Maurice Bruynooghe. Practical aspects for a working compile time garbage collection system for Mercury. In International Conference on Logic Programming, pages 105--119, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC