Modular interprocedural pointer analysis using access paths: Design, implementation, and evaluation

B. C. Cheng, W. W. Hwu

Research output: Contribution to conferencePaper

Abstract

In this paper we present a modular interprocedural pointer analysis algorithm based on access-paths for C programs. We argue that access paths can reduce the overhead of representing context-sensitive transfer functions and effectively distinguish non-recursive heap objects. And when the modular analysis paradigm is used together with other techniques to handle type casts and function pointers, we are able to handle significant programs like those in the SPECcint92 and SPECcint95 suites. We have implemented the algorithm and tested it on a Pentium II 450 PC running Linux. The observed resource consumption and performance improvement are very encouraging.

Original languageEnglish (US)
Pages57-69
Number of pages13
StatePublished - Dec 1 2000
Externally publishedYes
EventACM SIGPLAN 2000 Conference on Programming Language Design and Implementation (PLDI) - Vancouver, BC, Canada
Duration: Jun 18 2000Jun 21 2000

Other

OtherACM SIGPLAN 2000 Conference on Programming Language Design and Implementation (PLDI)
CountryCanada
CityVancouver, BC
Period6/18/006/21/00

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Modular interprocedural pointer analysis using access paths: Design, implementation, and evaluation'. Together they form a unique fingerprint.

  • Cite this

    Cheng, B. C., & Hwu, W. W. (2000). Modular interprocedural pointer analysis using access paths: Design, implementation, and evaluation. 57-69. Paper presented at ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation (PLDI), Vancouver, BC, Canada.