Affiliation:
1. Univ. of Wisconsin–Madison, Madison
Abstract
Determining aliases is one of the foundamental static analysis problems, in part because the precision with which this problem is solved can affect the precision of other analyses such as live variables, available expressions, and constant propagation. Previous work has investigated the complexity of flow-sensitive alias analysis. In this article we show that precise flow-
insensitive
may-alias analysis is NP-hard given arbitrary levels of pointers and arbitrary pointer dereferencing.
Publisher
Association for Computing Machinery (ACM)
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Evaluating the Effectiveness of Deep Learning Models for Foundational Program Analysis Tasks;Proceedings of the ACM on Programming Languages;2024-04-29
2. A Novel Approach to Pointer Analysis;2022 OPJU International Technology Conference on Emerging Technologies for Sustainable Development (OTCON);2023-02-08
3. An Effective Buffer Overflow Detection With Super Data-Flow Graphs;2022 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom);2022-12
4. Using Barrier Elision to Improve Transactional Code Generation;ACM Transactions on Architecture and Code Optimization;2022-07-06
5. PUS;Proceedings of the 44th International Conference on Software Engineering;2022-05-21