Susan Horwitz  Home/Search
Context Related
| wisc.edu/wpis/papers/toplas97a.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: 128.105.7.11/wpis/html/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we show that precise flow-insensitive may-alias analysis is NP-hard given arbitrary levels of pointers and arbitrary pointer dereferencing. (Update)
Context of citations to this paper: More
...or insensitive to the program control flow. Flow insensitive analysis is generally more efficient at the price of being less precise [11, 14]. A flow sensitive analysis first constructs the ControlFlow Graph (CFG) of the program. Such a graph consists of nodes which are basic...
...cannot handle well. In particular, precise static analysis of pointer based structures and parallel regions is known to be intractable [29] [41], 70] In [25] we discuss two general methods for generating resilient and cheap opaque predicates that are based on the...
Cited by: More
Efficient Field-Sensitive Pointer Analysis for C - David Pearce Imperial (Correct)
Precise and Practical Flow Analysis of Object-Oriented Software - Milanova (2003) (Correct)
Watermarking, Tamper-Proofing, and Obfuscation - Tools for.. - Collberg, al. (2002) (Correct)
Active bibliography (related documents): More All
0.5: Constrainedness and the Phase Transition in Job Shop Scheduling - Beck, Jackson (1997) (Correct)
0.1: On the Sequential Nature of Interprocedural Program-Analysis.. - Reps (1995) (Correct)
0.1: Modular Static Program Analysis - Cousot, Cousot (2002) (Correct)
Similar documents based on text: More All
0.2: Flow-Insensitive Interprocedural Alias Analysis in the Presence of .. - Burke (Correct)
0.2: Building a Bridge between Pointer Aliases and Program Dependences - Ross, Sagiv (1998) (Correct)
0.1: Efficient Flow-Insensitive Alias Analysis in the.. - Burke, Carini, Choi.. (Correct)
Related documents from co-citation: More All
10: Fast and accurate flow-insensitive point-to analysis - Shapiro, Horwitz - 1997
9: Points-to analysis in almost linear time - Steensgaard - 1996
8: Solving shape-analysis problems in languages with destructive updating - Sagiv, Reps et al. - 1996
BibTeX entry: (Update)
Susan Horwitz. Precise flow-insensitive may-alias analysis is NP-Hard. ACM Transactions on Programming Languages and Systems, 19(1):1--6, January 1997. http://citeseer.ist.psu.edu/horwitz97precise.html More
@article{ horwitz97precise,
author = "Susan Horwitz",
title = "Precise Flow-Insensitive May-Alias Analysis Is {NP}-Hard",
journal = "ACM Transactions on Programming Languages and Systems",
volume = "19",
number = "1",
month = "January",
publisher = "ACM Press",
pages = "1--6",
year = "1997",
url = "citeseer.ist.psu.edu/horwitz97precise.html" }
Citations (may not include all citations):232 Program analysis and specialization for the C programming la.. (context) - Andersen - 1994
228 Points-to analysis in almost linear time - Steensgaard - 1996
97 Pointer induced aliasing: A problem classification (context) - Landi, Ryder - 1991
20 The undecidability of aliasing (context) - Ramalingam - 1994
15 Undecidability of static analysis - Landi - 1992
2 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - thesis, University et al. - 1979
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://128.105.7.11/wpis/html/): More
Parametric Shape Analysis via 3-Valued Logic - Sagiv, Reps, Wilhelm (1999) (Correct)
Precise Interprocedural Dataflow Analysis with.. - Sagiv, Reps, Horwitz (1995) (Correct)
Interprocedural Path Profiling - Melski, Reps (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC