The undecidability of aliasing-Reference-Cited by-同舟云学术

The undecidability of aliasing

Published:1994-09 Issue:5 Volume:16 Page:1467-1471
ISSN:0164-0925
Container-title:ACM Transactions on Programming Languages and Systems
language:en
Short-container-title:ACM Trans. Program. Lang. Syst.

Author:

Ramalingam G.¹

Affiliation:

1. IBM T. J. Watson Research Center, Yorktown Heights, NY

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Software

Link

https://dl.acm.org/doi/pdf/10.1145/186025.186041

Reference10 articles.

1. HOPCROFT J. E. AND ULLMAN J.D. 1979. Introduction to Automata Theory Languages and Computation. Addison-Wesley Reading Mass. HOPCROFT J. E. AND ULLMAN J.D. 1979. Introduction to Automata Theory Languages and Computation. Addison-Wesley Reading Mass.

2. Monotone data flow analysis frameworks;KAM J. B.;Acta Informatica,1977

3. Undecidability of static analysis

4. LANDI W. 1991. Interprocedural aliasing in the presence of pointers. Ph.D. thesis Dept. of Computer Science Rutgers Univ. New Brunswick N.J. LANDI W. 1991. Interprocedural aliasing in the presence of pointers. Ph.D. thesis Dept. of Computer Science Rutgers Univ. New Brunswick N.J.

Cited by 155 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Causal Program Dependence Analysis;Science of Computer Programming;2024-09

2. Representing Data Collections in an SSA Form;2024 IEEE/ACM International Symposium on Code Generation and Optimization (CGO);2024-03-02

3. AttnCall: Refining Indirect Call Targets in Binaries with Attention;Lecture Notes in Computer Science;2024

4. Frankenstein: fast and lightweight call graph generation for software builds;Empirical Software Engineering;2023-11-16

5. SysPart: Automated Temporal System Call Filtering for Binaries;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15