Interactive authoring of multimedia documents
Junehwa Song, Michelle Y. Kim, et al.
IEEE Symposium on Visual Languages 1996
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.
Junehwa Song, Michelle Y. Kim, et al.
IEEE Symposium on Visual Languages 1996
Eran Yahav, G. Ramalingam
PLDI 2004
J. Field, G. Ramalingam
POPL 1995
Roman Manevich, E. Yahav, et al.
VMCAI 2005