JUCS
2006
13 years 11 months ago
2006
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
WSC
2004
14 years 24 days ago
2004
We discuss a modification of the process world view, a graphical modeling representation language for the modified process world view called Control Flow Graphs (CFGs), an extensi...
ESOP
2006
Springer
14 years 3 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
ACSC
2002
IEEE
14 years 4 months ago
2002
IEEE
We propose a flow-sensitive alias analysis algorithm that computes safe and efficient alias sets in Java. For that, we propose a references-set representation of aliased elements,...