Incremental and Demand-Driven Points-To Analysis using Logic Programming

Diptikalyan Saha, C. R. Ramakrishnan

Abstract:
Incremental program analysis algorithms compute the changes to the analysis information due to small changes in the input program rather than re-analyzing the program. Demand-driven analysis algorithms compute only the information requested by the client analysis/optimization. In this paper we describe a deductive framework for implementing program analyses that incorporates incremental and demand driven techniques. We show the effectiveness of this approach by building a practical incremental and demand-driven context insensitive points-to analysis and evaluating this implementation by analyzing C programs with 10-70K lines of code.

Bibtex Entry:

@inproceedings{SR:PPDP05,
author = {Diptikalyan Saha and  C. R. Ramakrishnan},
title = {Incremental and Demand-Driven Points-To Analysis using Logic Programming},
booktitle = {Seventh International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming ({PPDP})},
address = {Lisboa, Portugal},
month = {July},
pages = {117--128},
publisher = {ACM Press},
note = {http://www.lmc.cs.sunysb.edu/~dsaha/incr_pta/},
year = {2005}
}

Full Paper: [pdf]

Home | Papers

C. R. Ramakrishnan
(cram@cs.sunysb.edu)