15 search results - page 2 / 3 » Precise Call Graph Construction in the Presence of Function ... |
ICFP
2007
ACM
14 years 5 months ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
SIGSOFT
2009
ACM
14 years 6 months ago
2009
ACM
A large number of industrial concurrent programs are being designed based on a model which combines threads with event-based communication. These programs consist of several threa...
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...
SIGSOFT
1998
ACM
13 years 10 months ago
1998
ACM
Understanding large software systems is difficult. Traditionally, automated tools are used to assist program understanding. However, the representations constructed by these tool...
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...