(Enter summary)
Abstract: Interpretation of Reference Counting
The semantics presented thus far is exact, and thus evaluating a particular reference count may
not terminate, any more than a program in the standard semantics would. For use by a compiler
we must choose a suitable abstraction (i.e., approximation) that will guarantee termination yet
still provide useful information about the true reference counts. For us a suitable abstraction is
one in which the inferred reference count is at least as great as the true... (Update)
Context of citations to this paper: More
...analyses, there are other analyses that can be used to guide stack allocation or object resolution. Alias analysis[6] reference counting[11,12] and storage use analysis[17] can also be utilized in support object resolution. In general, using these analyses for object...
.... update A number of analyses for in place update of data structures have been proposed, including those by Schmidt [Sch85] Hudak [Hud86], Baker [Bak90] Guzm an and Hudak [GH90] 33 Wadler [Wad90b, Wad91] and Barendsen and Smetsers [BS93] In such analyses it is...
Cited by: More
Is There a Use for Linear Logic? - Wadler (1991)
(Correct)
Analysis and Efficient Implementation of Functional Programs - Sestoft (1991)
(Correct)
Static Analysis for Safe Destructive Updates in a Functional.. - Shankar (2001)
(Correct)
Active bibliography (related documents): More All
0.3: Syntactic Detection of Single-Threading using Continuations - Fradet (1991)
(Correct)
0.3: Proving the Correctness of Storage Representations - Wand, Oliva
(Correct)
0.3: Garbage Recycling: Transforming Programs to Reuse Garbage - Hamilton (1995)
(Correct)
Similar documents based on text: More All
0.0: Bibliography of Yale's Functional Programming Research Group (aka.. - Hudak (1994)
(Correct)
0.0: Paths in the lambda-calculus - Three years of.. - Asperti, Laneve.. (1994)
(Correct)
0.0: PVS Prover Guide - Version 2.2 - Shankar, Owre, Rushby..
(Correct)
Related documents from co-citation: More All
17: Detecting global variables in denotational specifications (context) - Schmidt - 1985
16: Linear types can change the world
- Wadler - 1990
15: On determining lifetime and aliasing of dynamically allocated data in higherorde.. (context) - Deutsch - 1990
BibTeX entry: (Update)
Paul Hudak. A semantic model of reference counting and its abstraction (detailed summary). In Proceedings ACM Conference on LISP and Functional Programming, pages 351--363, August 1986. http://citeseer.ist.psu.edu/hudak86semantic.html More
@inproceedings{ hudak86semantic,
author = "Paul Hudak",
title = "A Semantic Model of Reference Counting and its Abstraction (Detailed Summary)",
booktitle = "{LISP} and Functional Programming",
pages = "351-363",
year = "1986",
url = "citeseer.ist.psu.edu/hudak86semantic.html" }
Citations (may not include all citations):
815
Abstract interpretation: a unified lattice model for static .. (context) - Cousot, Cousot - 1977 DBLP
346
Denotational Semantics: The Scott-Strachey Approach to Progr.. (context) - Stoy - 1977
92
A flexible approach to interprocedural data flow analysis an.. (context) - Jones, Muchnick - 1982 ACM DBLP
61
Detecting global variables in denotational specifications (context) - Schmidt - 1985 ACM DBLP
22
The aggregate update problem in functional programming syste.. (context) - Hudak, Bloss - 1985 ACM DBLP
22
An empirical study of list structure in lisp (context) - Clark - 1977 ACM DBLP
17
Abstract Interpretation and Optimizing Transformations for A.. (context) - Mycroft - 1981
15
Shifting garbage collection overhead to compile time (context) - Barth - 1977 ACM DBLP
8
Collecting interpretations of expressions (context) - Hudak - 1986 ACM DBLP
4
Verifying the safe use of destructive operations in applicat.. (context) - Schwarz - 1978
3
The global storage needs of a subcomputation (context) - Raoult, Sethi - 1984 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.uchicago.edu/~sagiv/courses/program-analysis.html): More
Data Flow Frequency Analysis - Ramalingam (1996)
(Correct)
Interprocedural May-Alias Analysis for Pointers: Beyond k-limiting - Deutsch (1994)
(Correct)
A Type-Directed Optimizing Compiler for ML - Guanshan Tong
(Correct)
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