• DOI:10.1145/186025.186041
Corpus ID: 1132909

The undecidability of aliasing

@article{Ramalingam1994TheUO,
  title={The undecidability of aliasing},
  author={G. Ramalingam},
  journal={ACM Trans. Program. Lang. Syst.},
  year={1994},
  volume={16},
  pages={1467-1471}
}

G. Ramalingam

Published 1994

Computer Science

ACM Trans. Program. Lang. Syst.

Alias analysis is a prerequisite for performing most of the common program analyses such as reaching-definitions analysis or live-variables analysis. Landi [1992] recently established that it is impossible to compute statically precise alias information—either may-alias or must-alias—in languages with if statements, loops, dynamic storage, and recursive data structures: more precisely, he showed that the may-alias relation is not recursive, while the must-alias relation is not even recursively… CONTINUE READING

View on ACM

web.cs.ucla.edu

Save to Library

Create Alert

Cite

Launch Research Feed