35 citations · 50 across the 8 of their papers we have counts for
6 papers · 1 filter
An Incremental Slicing Method for Functional Programs
Prasanna Kumar K., Amitabha Sanyal, Amey Karkare
Several applications of slicing require a program to be sliced with respect to more than one slicing criterion. Program specialization, parallelization and cohesion measurement are…
Liveness-Based Garbage Collection for Lazy Languages
Prasanna Kumar. K, Amitabha Sanyal, Amey Karkare
We consider the problem of reducing the memory required to run lazy first-order functional programs. Our approach is to analyze programs for liveness of heap-allocated data. The re…
Heap Reference Analysis for Functional Programs
Amey Karkare, Amitabha Sanyal, Uday Khedker
Current garbage collectors leave a lot of garbage uncollected because they conservatively approximate liveness by reachability from program variables. In this paper, we describe a…
Liveness of Heap Data for Functional Programs
Amey Karkare, Uday Khedker, Amitabha Sanyal
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 coll…
Effectiveness of Garbage Collection in MIT/GNU Scheme
Amey Karkare, Amitabha Sanyal, Uday Khedker
Scheme uses garbage collection for heap memory management. Ideally, garbage collectors should be able to reclaim all dead objects, i.e. objects that will not be used in future. How…
Heap Reference Analysis Using Access Graphs
Uday Khedker, Amitabha Sanyal, Amey Karkare
Despite significant progress in the theory and practice of program analysis, analysing properties of heap data has not reached the same level of maturity as the analysis of static…