1687 search results - page 3 / 338 » Which pointer analysis should I use |
SIGSOFT
2002
ACM
14 years 7 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...
TAPSOFT
1997
Springer
13 years 10 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...
FM
2003
Springer
13 years 11 months ago
2003
Springer
In this article, I present an “event approach” used to formally develop sequential programs. It is based on the formalism of Action Systems [6] (and Guarded Commands[7]), which...
APSEC
2004
IEEE
13 years 10 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...
POPL
1993
ACM
13 years 10 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...