7 search results - page 1 / 2 » On the complexity of partially-flow-sensitive alias analysis |
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...
TOPLAS
2008
13 years 4 months ago
2008
TSP
2008
13 years 4 months ago
2008
To overcome the limitations of a conventional fullband adaptive filtering, various subband adaptive filtering (SAF) structures have been proposed. Properly designed, an SAF will co...
CC
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Alias analysis, traditionally performed statically, is unsuited for a dynamic binary translator (DBT) due to incomplete control-flow information and the high complexity o...
ISSTA
2000
ACM
13 years 9 months ago
2000
ACM
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...