activity
20062025
most citedHeap Reference Analysis Using Access Graphs

35 citations · 90 across the 16 of their papers we have counts for

collaborators
Showing cs.PLShow all

9 papers · 1 filter

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.PL2017

ParseIT: A Question-Answer based Tool to Learn Parsing Techniques

Amey Karkare, Nimisha Agarwal

Parsing (also called syntax analysis) techniques cover a substantial portion of any undergraduate Compiler Design course. We present ParseIT, a tool to help students understand the…

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.PL2015★ 2 cited

Program Synthesis using Natural Language

Aditya Desai, Sumit Gulwani, Vineet Hingorani +5

Interacting with computers is a ubiquitous activity for millions of people. Repetitive or specialized tasks often require creation of small, often one-off, programs. End-users stru…

cs.PL2013

Retargeting GCC: Do We Reinvent the Wheel Every Time?

Saravana Perumal P, Amey Karkare

Porting GCC to new architecture requires writing a Machine Description (MD) file that contains mapping from GCC's intermediate form to the target assembly code. Constructing an MD…

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…