Efficient Computation of Parameterized Pointer Information for Interprocedural Analyses

Abstract

This paper presents a modular algorithm that efficiently computes parameterized pointer information, in which symbolic names are introduced to identify memory locations whose addresses may be passed into a procedure. Parameterized pointer information can be used by a client program analysis to compute parameterized summary information for a procedure. The… (More)
DOI: 10.1007/3-540-47764-0_16

Topics

6 Figures and Tables

Statistics

051015'02'04'06'08'10'12'14'16'18
Citations per Year

70 Citations

Semantic Scholar estimates that this publication has 70 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Liang2001EfficientCO, title={Efficient Computation of Parameterized Pointer Information for Interprocedural Analyses}, author={Donglin Liang and Mary Jean Harrold}, booktitle={SAS}, year={2001} }