326 search results - page 5 / 66 » Interprocedural Control Flow Analysis |
TAPSOFT
1997
Springer
15 years 1 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...
LCPC
2005
Springer
15 years 3 months ago
2005
Springer
Static Single Assignment (SSA) has been widely accepted as the intermediate program representation of choice in most modern compilers. It allows for a much more efficient data flo...
164
Voted
POPL
2006
ACM
15 years 10 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
The low cost of clusters built using commodity components has made it possible for many more users to purchase their own supercomputer. However, even modest-sized clusters make si...
161
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
This paper specifies, via a Hoare-like logic, an interprocedural and flow sensitive (but termination insensitive) information flow analysis for object-oriented programs. Pointer a...