activity
20062017
most citedHeap Reference Analysis Using Access Graphs

35 citations · 50 across the 8 of their papers we have counts for

collaborators

8 papers

cs.PL2017

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…

cs.PL2016

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…

cs.SE2014

Sliced Slices: Separating Data and Control Influences

Shrawan Kumar, Amitabha Sanyal, Uday Khedker

Backward slicing has been used extensively in program understanding, debugging and scaling up of program analysis. For large programs, the size of the conventional backward slice i…

cs.LO2012

A Logic for Correlating Temporal Properties across Program Transformations

Aditya Kanade, Amitabha Sanyal, Uday P. Khedker

Program transformations are widely used in synthesis, optimization, and maintenance of software. Correctness of program transformations depends on preservation of some important pr…

cs.PL2007★ 1 cited

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…

cs.PL2007★ 7 cited

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…