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
    298 Citations

    Figures and Topics from this paper

    Precise flow-insensitive may-alias analysis is NP-hard
    • 139
    Alias Analysis by Means of a Model Checker
    • 9
    • PDF
    Proving properties about programs which share.
    • PDF
    Interprocedural Symbolic Evaluation of Ada Programs with Aliases
    • 14
    • PDF
    Do we still need new Alias Analyses
    • PDF
    Efficient subcubic alias analysis for C
    • 18
    • PDF
    Taxonomy and applications of alias analysis
    • 7
    • PDF
    Program decomposition for pointer aliasing: a step toward practical analyses
    • 104
    An Empirical Comparison of Interprocedural Pointer Alias Analyses
    • 11
    Precise Null Pointer Analysis Through Global Value Numbering
    • 3
    • PDF

    References

    Undecidability of static analysis
    • 422
    • Highly Influential