2014
DOI: 10.1007/978-3-642-54807-9_5
View full text
|
|
Share

Abstract: Abstract. Current garbage collectors leave much heap-allocated data uncollected because they preserve data reachable from a root set. However, only live data-a subset of reachable data-need be preserved.Using a first-order functional language we formulate a context-sensitive liveness analysis for structured data and prove it correct. We then use a 0-CFA-like conservative approximation to annotate each allocation and function-call program point with a finite-state automaton-which the garbage collector inspects…

Expand abstract

Search citation statements

Order By: Relevance

Citation Types

0
12
0

Paper Sections

0
0
0
0
0

Publication Types

0
0
0
0

Relationship

0
0

Authors

Journals