Henning Makholm. Region-Based Memory Management in Prolog. Master's thesis, Department of Computer Science, University of Copenhagen, 2000. hftp://ftp.diku.dk/diku/semantics/papers/ D-421.ps.gzi. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
An Equational Theory for a Region Calculus - Revised - Helsen (2002) (Correct)
....inference for a realistic language. The ML kit does not rely on runtime garbage collection obtain automatic memory management. 1. 1 Contribution and Related Work Since its introduction, region based memory management has been improved [3, 7] and transferred to other languages [26,30,54]. In addition, many di erent avors of the region calculus have been developed [4, 9, 12, 13, 20, 23, 55, 56] usually to cater for more exible and powerful memory management. Our syntactic theory focuses on the region calculus by Tofte and Talpin, which, henceforth, is being referred to as the ....
Henning Makholm. Region-based memory management in Prolog. Master's thesis, Department of Computer Science, University of Copenhagen, Denmark, March 2000.
An Equational Theory for a Region Calculus - Helsen (2002) (Correct)
....inference for a realistic language. The ML kit does not rely on runtime garbage collection to obtain automatic memory management. 1. 1 Contribution and Related Work Since its introduction, region based memory management has been improved [3, 7] and transferred to other languages [26, 28, 52]. In addition, many di#erent flavors of the region calculus have been developed [4,9,12,13,20,23,53,54] usually to cater for more flexible and powerful memory management. Our syntactic theory focuses on the region calculus by Tofte and Talpin, which, henceforth, is being referred to as # . ....
Henning Makholm. Region-based memory management in prolog. Master's thesis, Department of Computer Science, University of Copenhagen, Denmark, March 2000.
An Equational Theory for a Region Calculus - Helsen (2002) (Correct)
....inference for a realistic language. The ML kit does not rely on runtime garbage collection to obtain automatic memory management. 1. 1 Contribution and Related Work Since its introduction, region based memory management has been improved [3, 7] and transferred to other languages [26, 28, 52]. In addition, many di erent avors of the region calculus have been developed [4,9,12,13,20,23,53,54] usually to cater for more exible and powerful memory management. Our syntactic theory focuses on the region calculus by Tofte and Talpin, which, henceforth, is being referred to as . ....
Henning Makholm. Region-based memory management in prolog. Master's thesis, Department of Computer Science, University of Copenhagen, Denmark, March 2000.
An Operational Theory for a Region Calculus - Helsen (2001) (Correct)
....[30] was the rst practical implementation of region inference for a realistic language. The ML kit does not rely on runtime garbage collection 1 to obtain automatic memory management. Since its introduction, region inference has been improved [3, 7] and transferred to other languages as well [9, 24, 47]. Recently, researchers have related region calculi to an extension of the pi calculus with name groups [51] and a calculus of capabilities [10] The most widely used avor of a region calculus is the one by Tofte and Talpin [46] which we will refer to as the region calculus henceforth. However, ....
Henning Makholm. Region-based memory management in prolog. Master's thesis, Department of Computer Science, University of Copenhagen, Denmark, March 2000.
A region-based memory manager for Prolog - Henning Makholm Diku (2000) (1 citation) Self-citation (Makholm) (Correct)
No context found.
Henning Makholm. Region-Based Memory Management in Prolog. Master's thesis, Department of Computer Science, University of Copenhagen, 2000. hftp://ftp.diku.dk/diku/semantics/papers/ D-421.ps.gzi.
On Enabling the WAM with Region Support - Makholm, Sagonas Self-citation (Makholm) (Correct)
....can be deallocated only after the recursion. Several schemes for relaxing this principle have been proposed; the latest one by Henglein, Makholm, and Niss [4] henceforth referred to as the HMN model, is the basis of the region system we employ. Regions for Prolog. In [6] and in more detail in [5]) the first attempt to extend regionbased memory management to support backtracking and cuts was made. The challenge is that Prolog s control flow makes it difficult to find meaningful places to insert explicit deallocation operations. In a program such as main : hcompute T somehowi, foo(V) ....
....releases a region, it must be kept alive and reinstated at backtracking. Techniques for how to do this were developed in [6] they transfer essentially without change to the WAM based environment. Unfortunately, space limitations prevent us from presenting the details, and we refer the reader to [6, 5]. We only note that the implementation of all choice instructions in the WAM must be extended to support backtracking of the region area. It is not sufficient to use specially enhanced choice instructions when compiling a region annotated program. Conditional bindings in regions. The handling of ....
H. Makholm. Region-based memory management in Prolog. Master's thesis, University of Copenhagen, 2000.
A region-based memory manager for Prolog - Makholm (2000) (1 citation) Self-citation (Makholm) (Correct)
....if we can find both ends of the page list quickly. Therefore, we implement the abstract type REGION as a pointer to a management record which contains pointers to either end of the page list as well as information about how many of the 1 For details on this adaptation, see the technical report [Makholm 2000]. newest page s payload words have been allocated yet. The management record itself is allocated by makeregion in the first of the region s pages. While this scheme implements each of the three operations in constant time, it rests on the assumption that each individual allocation is small ....
....unnecessary to set aside a separate area of memory for trail data; but on the other hand it is necessary to unwind the trail everytime the region is shrunk, lest the region ends up with some of its trail list in freed pages. 3. 4 Time complexity considerations As described in the technical report [Makholm 2000] it is possible to maintain enough redundant summary information in the snapshots and management records that every memory management operation can locate any snapshot it needs to inspect in constant time. Therefore, most memorymanagement operations take constant time. The exceptions are: ffl ....
Makholm, H. [2000]. Region-based memory management in Prolog. Master 's thesis, Department of Computer Science, University of Copenhagen.
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