Precise flow-insensitive may-alias analysis is NP-hard

被引：58
|
作者：
Horwitz, S
机构：
[1] University of Wisconsin, Madison, WI
[2] Computer Sciences Department, University of Wisconsin, Madison, WI 53706
来源：
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS | 1997年 / 19卷 / 01期
关键词：
alias analysis; dataflow analysis; pointer analysis; static analysis;
D O I：
10.1145/239912.239913
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Determining aliases is one of the fundamental 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.
引用
收藏
页码：1 / 6
页数：6
相关论文
共 24 条
  • [1] A New May-alias Analysis Method
    Zhang, ZhiXiang
    Ding, Bin
    [J]. 2012 WORLD AUTOMATION CONGRESS (WAC), 2012,
  • [2] INTERPROCEDURAL MAY-ALIAS ANALYSIS FOR POINTERS - BEYOND KAPPA-LIMITING
    DEUTSCH, A
    [J]. SIGPLAN NOTICES, 1994, 29 (06): : 230 - 241
  • [3] Rigorous Analysis of Heuristics for NP-Hard Problems
    Feige, Uriel
    [J]. PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 927 - 927
  • [4] The Flow-Insensitive Precision of Andersen's Analysis in Practice
    Blackshear, Sam
    Chang, Bor-Yuh Evan
    Sankaranarayanan, Sriram
    Sridharan, Manu
    [J]. STATIC ANALYSIS, 2011, 6887 : 60 - +
  • [5] Speeding up dataflow analysis using flow-insensitive pointer analysis
    Adams, S
    Ball, T
    Das, M
    Lerner, S
    Rajamani, SK
    Seigle, M
    Weimer, W
    [J]. STATIC ANALYSIS, PROCEEDINGS, 2002, 2477 : 230 - 246
  • [6] Flow-insensitive static analysis for detecting integer anomalies in programs
    Sarkar, Dipanwita
    Jagannathan, Muthu
    Thiagarajan, Jay
    Venkatapathy, Ramanathan
    [J]. PROCEEDINGS OF THE IASTED INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, 2007, : 334 - +
  • [7] SEVERAL NP-HARD PROBLEMS ARISING IN ROBUST STABILITY ANALYSIS
    NEMIROVSKII, A
    [J]. MATHEMATICS OF CONTROL SIGNALS AND SYSTEMS, 1993, 6 (02) : 99 - 105
  • [8] Landscape Analysis of a Class of NP-Hard Binary Packing Problems
    Alyahya, Khulood
    Rowe, Jonathan E.
    [J]. EVOLUTIONARY COMPUTATION, 2019, 27 (01) : 47 - 73
  • [9] Polymorphic versus monomorphic flow-insensitive points-to analysis for C
    Foster, JS
    Fähndrich, M
    Aiken, A
    [J]. STATIC ANALYSIS, 2000, 1824 : 175 - 198
  • [10] Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
    Hoogeveen, JA
    Lenstra, JK
    Veltman, B
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 89 (01) : 172 - 175
123