Sean Zhang, Barbara G. Ryder  Home/Search
Context Related
| rutgers.edu/pub/tech...lcsrtr233.ps.Z 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: rutgers.edu/pub/technicalrepo... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a definition of the function pointer aliasing problem for single level function pointers, according to a new approximation of possible program execution for interprocedural analyses in the presence of calls through function pointers. We have classified the complexity of the problem as either polynomial or NP-hard, with respect to various program constructs affecting function pointer aliasing. We present our problem classification and give brief proofs for a polynomial case and a... (Update)
Similar documents based on text: More All
0.7: Precise Call Graph Construction in the Presence of.. - Milanova, Rountev, Ryder (2001) (Correct)
0.5: Improving Program Slicing with Dynamic Points-To Data - Mock, Atkinson (2002) (Correct)
0.2: Precise Call Graphs for C Programs with Function Pointers - Milanova, Rountev, Ryder (2004) (Correct)
BibTeX entry: (Update)
Sean Zhang and Barbara G. Ryder. Complexity of single level function pointer aliasing analysis. Technical Report LCSR-TR-233, Laboratory of Computer Science Research, Rutgers University, October 1994. http://citeseer.ist.psu.edu/zhang94complexity.html More
@misc{ zhang94complexity,
author = "S. Zhang and B. Ryder",
title = "Complexity of single level function pointer aliasing analysis",
text = "Sean Zhang and Barbara G. Ryder. Complexity of single level function pointer
aliasing analysis. Technical Report LCSR-TR-233, Laboratory of Computer
Science Research, Rutgers University, October 1994.",
year = "1994",
url = "citeseer.ist.psu.edu/zhang94complexity.html" }
Citations (may not include all citations):246 Context-sensitive interprocedural points-to analysis in the .. - Emami, Ghiya et al. - 1994
175 A safe approximate algorithm for interprocedural pointer ali.. - Landi, Ryder - 1992
146 Parallelizing Programs with Recursive Data Structures (context) - Hendren - 1990
127 Control flow analysis in scheme (context) - Shivers - 1988
97 Pointer-induced aliasing: a problem classification (context) - Landi, Ryder - 1991
79 Efficient flow-sensitive interprocedural computation of poin.. - Choi, Burke et al. - 1993
68 Interprocedural data flow analysis in the presence of pointe.. - Weihl - 1980
67 Iterative type analysis and extended message splitting: opti.. - Chambers, Ungar - 1990
41 Pointer-induced aliasing: a clarification (context) - Marlowe, Landi et al. - 1993
36 IEEE Transaction on Software Engineering (context) - Ryder, call et al. - 1979
31 Static type determination for C - Pande, Ryder - 1994
30 ACM Letters on Programming Languages and Systems (context) - Hall, Kennedy et al. - 1993
29 Constructing call multigraphs using dependence graphs - Lakhotia - 1993
24 Constructing the procedure call multigraph (context) - Callahan, Carle et al. - 1990
10 Complexity of interprocedural side-effect analysis (context) - Cooper, Kennedy - 1987
[Article contains additional citations not shown here]
Documents on the same site (http://www.cs.rutgers.edu/pub/technical-reports/): More
Constrained REDO: An Alternative to REPLAY - Liew, Steinberg (1993) (Correct)
Jambalaya: Using Multicast for Blind Distributed Web Searching .. - Navas, Hirsh (1998) (Correct)
Law-Governed Regularities in Software Systems - Minsky (1994) (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