ISSN:
1573-7640
Keywords:
Block-structured languages
;
retention vs. deletion
;
contour model
;
lifetime checks
;
garbage collection
;
time estimates
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract This paper describes the deletion-retention contour machine (DRCM), an efficient implementation of a retention block-structured language. It allows programs to be handled by the deletion strategy until some forward reference is generated during execution. Then the retention strategy is adopted, when a time- and space-efficient garbage compaction algorithm recovers the inaccessible cells. Moreover, the garbage collector can, on discovering the absence of accessible forward references, restore the deletion strategy. An estimate of the computation time of a lifetime well-stacking (LWS) program on the DRCM is obtained, which shows that an LWS program runs on the DRCM in almost the same time as on a stack machine with lifetime checks to prevent dangling references. Such a property also holds for LWS programs with full-label and nonlocal gotos.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00978377
Permalink