Parametric program slicing
J. Field, G. Ramalingam
POPL 1995
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 enumerable. This article presents simpler proofs of the same results. © 1994, ACM. All rights reserved.
J. Field, G. Ramalingam
POPL 1995
Leon Moonen, G. Ramalingam, et al.
Dagstuhl Seminar Proceedings 2006
Roman Manevich, E. Yahav, et al.
VMCAI 2005
N. Rinetzky, G. Ramalingam, et al.
ACM TOPLAS