| Paul Hudak. A sematic model of reference counting and its abstraction. In ACM Symposiumon LISP and Functional Languages, pages 351--363, January 1986. |
....However, if the explicit deallocation is paired with a subsequent allocation (of a compatible number of bytes) the two operations can be merged into a reuse, avoiding the overhead of both the deallocation and the allocation. One example of this analysis is the reference count analysis of Hudak [Hud86] implemented in the Russel compiler by Hederman [Hed88] In Hederman s implementation, the reference count analysis associates an abstract reference count with each program point and variable. When such a reference count passes from one to zero, the value bound to the variable may be ....
Paul Hudak. A sematic model of reference counting and its abstraction. In ACM Symposiumon LISP and Functional Languages, pages 351--363, January 1986.
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