Alias analysis of executable code

Saumya K Debray, Robert Muth, Matthew Weippert

Research output: Chapter in Book/Report/Conference proceedingConference contribution

73 Citations (Scopus)

Abstract

Recent years have seen increasing interest in systems that reason about and manipulate executable code. Such systems can generally benefit from information about aliasing. Unfortunately, most existing alias analyses are formulated in terms of high-level language features, and are unable to cope with features, such as pointer arithmetic, that pervade executable programs. This paper describes a simple algorithm that can be used to obtain aliasing information for executable code. In order to be practical, the algorithm is careful to keep its memory requirements low, sacrificing precision where necessary to achieve this goal. Experimental results indicate that it is nevertheless able to provide a reasonable amount of information about memory references across a variety of benchmark programs.

Original languageEnglish (US)
Title of host publicationConference Record of the Annual ACM Symposium on Principles of Programming Languages
Editors Anon
PublisherACM
Pages12-24
Number of pages13
StatePublished - 1998
EventProceedings of the 1998 25th ACM SIGPLAN SIGACT Symposium on Principles of Programming Languages - San Diego, CA, USA
Duration: Jan 19 1998Jan 21 1998

Other

OtherProceedings of the 1998 25th ACM SIGPLAN SIGACT Symposium on Principles of Programming Languages
CitySan Diego, CA, USA
Period1/19/981/21/98

Fingerprint

Data storage equipment
High level languages

ASJC Scopus subject areas

  • Software

Cite this

Debray, S. K., Muth, R., & Weippert, M. (1998). Alias analysis of executable code. In Anon (Ed.), Conference Record of the Annual ACM Symposium on Principles of Programming Languages (pp. 12-24). ACM.

Alias analysis of executable code. / Debray, Saumya K; Muth, Robert; Weippert, Matthew.

Conference Record of the Annual ACM Symposium on Principles of Programming Languages. ed. / Anon. ACM, 1998. p. 12-24.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Debray, SK, Muth, R & Weippert, M 1998, Alias analysis of executable code. in Anon (ed.), Conference Record of the Annual ACM Symposium on Principles of Programming Languages. ACM, pp. 12-24, Proceedings of the 1998 25th ACM SIGPLAN SIGACT Symposium on Principles of Programming Languages, San Diego, CA, USA, 1/19/98.
Debray SK, Muth R, Weippert M. Alias analysis of executable code. In Anon, editor, Conference Record of the Annual ACM Symposium on Principles of Programming Languages. ACM. 1998. p. 12-24
Debray, Saumya K ; Muth, Robert ; Weippert, Matthew. / Alias analysis of executable code. Conference Record of the Annual ACM Symposium on Principles of Programming Languages. editor / Anon. ACM, 1998. pp. 12-24
@inproceedings{e574eb0ab4644807babc215637ef2ea9,
title = "Alias analysis of executable code",
abstract = "Recent years have seen increasing interest in systems that reason about and manipulate executable code. Such systems can generally benefit from information about aliasing. Unfortunately, most existing alias analyses are formulated in terms of high-level language features, and are unable to cope with features, such as pointer arithmetic, that pervade executable programs. This paper describes a simple algorithm that can be used to obtain aliasing information for executable code. In order to be practical, the algorithm is careful to keep its memory requirements low, sacrificing precision where necessary to achieve this goal. Experimental results indicate that it is nevertheless able to provide a reasonable amount of information about memory references across a variety of benchmark programs.",
author = "Debray, {Saumya K} and Robert Muth and Matthew Weippert",
year = "1998",
language = "English (US)",
pages = "12--24",
editor = "Anon",
booktitle = "Conference Record of the Annual ACM Symposium on Principles of Programming Languages",
publisher = "ACM",

}

TY - GEN

T1 - Alias analysis of executable code

AU - Debray, Saumya K

AU - Muth, Robert

AU - Weippert, Matthew

PY - 1998

Y1 - 1998

N2 - Recent years have seen increasing interest in systems that reason about and manipulate executable code. Such systems can generally benefit from information about aliasing. Unfortunately, most existing alias analyses are formulated in terms of high-level language features, and are unable to cope with features, such as pointer arithmetic, that pervade executable programs. This paper describes a simple algorithm that can be used to obtain aliasing information for executable code. In order to be practical, the algorithm is careful to keep its memory requirements low, sacrificing precision where necessary to achieve this goal. Experimental results indicate that it is nevertheless able to provide a reasonable amount of information about memory references across a variety of benchmark programs.

AB - Recent years have seen increasing interest in systems that reason about and manipulate executable code. Such systems can generally benefit from information about aliasing. Unfortunately, most existing alias analyses are formulated in terms of high-level language features, and are unable to cope with features, such as pointer arithmetic, that pervade executable programs. This paper describes a simple algorithm that can be used to obtain aliasing information for executable code. In order to be practical, the algorithm is careful to keep its memory requirements low, sacrificing precision where necessary to achieve this goal. Experimental results indicate that it is nevertheless able to provide a reasonable amount of information about memory references across a variety of benchmark programs.

UR - http://www.scopus.com/inward/record.url?scp=0031648445&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031648445&partnerID=8YFLogxK

M3 - Conference contribution

SP - 12

EP - 24

BT - Conference Record of the Annual ACM Symposium on Principles of Programming Languages

A2 - Anon, null

PB - ACM

ER -