On the complexity of partially-flow-sensitive alias analysis

N. Rinetzky, G. Ramalingam, M. Sagiv, E. Yahav

Research output: Contribution to journalArticlepeer-review

Abstract

We introduce the notion of a partially-flow-sensitive analysis based on the number of read and write operations that are guaranteed to be analyzed in a sequential manner. We study the complexity of partially-flow-sensitive alias analysis and show that precise alias analysis with a very limited flow-sensitivity is as hard as precise flow-sensitive alias analysis, both when dynamic memory allocation is allowed, as well as in the absence of dynamic memory allocation.

Original languageEnglish
Article number13
JournalACM Transactions on Programming Languages and Systems
Volume30
Issue number3
DOIs
StatePublished - 1 May 2008

Keywords

  • Alias analysis
  • Flow-insensitive
  • Flow-sensitive

Fingerprint

Dive into the research topics of 'On the complexity of partially-flow-sensitive alias analysis'. Together they form a unique fingerprint.

Cite this