54 search results - page 2 / 11 » Flexible pointer analysis using assign-fetch graphs |
APSEC
2004
IEEE
13 years 9 months ago
2004
IEEE
Software engineers need to understand programs in order to effectively maintain them. The call graph, which presents the calling relationships between functions, is a useful repre...
TAPSOFT
1997
Springer
13 years 9 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
SEFM
2005
IEEE
13 years 11 months ago
2005
IEEE
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
PLDI
2004
ACM
13 years 11 months ago
2004
ACM
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...
SIGSOFT
2002
ACM
14 years 6 months ago
2002
ACM
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...