On the complexity of partially-flow-sensitive alias analysis

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

doi:10.1145/1353445.1353447

On the complexity of partially-flow-sensitive alias analysis

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

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

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 language	English
Article number	13
Journal	ACM Transactions on Programming Languages and Systems
Volume	30
Issue number	3
DOIs	https://doi.org/10.1145/1353445.1353447
State	Published - 1 May 2008

Keywords

Alias analysis
Flow-insensitive
Flow-sensitive

Access to Document

10.1145/1353445.1353447

Cite this

@article{1044ae0287904018990c584d2fe7112e,

title = "On the complexity of partially-flow-sensitive alias analysis",

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.",

keywords = "Alias analysis, Flow-insensitive, Flow-sensitive",

author = "N. Rinetzky and G. Ramalingam and M. Sagiv and E. Yahav",

year = "2008",

month = may,

day = "1",

doi = "10.1145/1353445.1353447",

language = "אנגלית",

volume = "30",

journal = "ACM Transactions on Programming Languages and Systems",

issn = "0164-0925",

publisher = "Association for Computing Machinery (ACM)",

number = "3",

}

TY - JOUR

T1 - On the complexity of partially-flow-sensitive alias analysis

AU - Rinetzky, N.

AU - Ramalingam, G.

AU - Sagiv, M.

AU - Yahav, E.

PY - 2008/5/1

Y1 - 2008/5/1

N2 - 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.

AB - 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.

KW - Alias analysis

KW - Flow-insensitive

KW - Flow-sensitive

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

U2 - 10.1145/1353445.1353447

DO - 10.1145/1353445.1353447

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:44249095594

SN - 0164-0925

VL - 30

JO - ACM Transactions on Programming Languages and Systems

JF - ACM Transactions on Programming Languages and Systems

IS - 3

M1 - 13

ER -

On the complexity of partially-flow-sensitive alias analysis

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this