Liveness of Heap Data for Functional Programs
| dc.creator | Karkare, Amey | |
| dc.creator | Khedker, Uday | |
| dc.creator | Sanyal, Amitabha | |
| dc.date | 2007-03-30 | |
| dc.date.accessioned | 2026-07-07T07:54:49Z | |
| dc.date.available | 2026-07-07T07:54:49Z | |
| dc.description | Functional programming languages use garbage collection for heap memory management. Ideally, garbage collectors should reclaim all objects that are dead at the time of garbage collection. An object is dead at an execution instant if it is not used in future. Garbage collectors collect only those dead objects that are not reachable from any program variable. This is because they are not able to distinguish between reachable objects that are dead and reachable objects that are live. In this paper, we describe a static analysis to discover reachable dead objects in programs written in first-order, eager functional programming languages. The results of this technique can be used to make reachable dead objects unreachable, thereby allowing garbage collectors to reclaim more dead objects. | |
| dc.description | Accepted at Heap Analysis and Verification workshop (HAV 2007), a satellite workshop of ETAPS 2007 (No formal proceedings for workshop); 15 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0703155 | |
| dc.identifier | http://arxiv.org/abs/cs/0703155 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/126755 | |
| dc.subject | Programming Languages | |
| dc.subject | D.3.2; D.3.4 | |
| dc.title | Liveness of Heap Data for Functional Programs | |
| dc.type | text |