Sciweavers

Share
JUCS
2006
87views more  JUCS 2006»
9 years 9 months ago
Eliminating Redundant Join-Set Computations in Static Single Assignment
: 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...
Angela French, José Nelson Amaral
CORR
2006
Springer
91views Education» more  CORR 2006»
9 years 9 months ago
Complexity of Data Flow Analysis for Non-Separable Frameworks
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 ...
Bageshri Karkare, Uday P. Khedker
WSC
2004
9 years 10 months ago
Some Recent Advances in the Process World View
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...
Robert G. Sargent
ESOP
2006
Springer
10 years 1 months ago
Path Optimization in Programs and Its Application to Debugging
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...
Akash Lal, Junghee Lim, Marina Polishchuk, Ben Lib...
ACSC
2002
IEEE
10 years 2 months ago
Alias Analysis for Exceptions in Java
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,...
Jehak Woo, Jongwook Woo, Isabelle Attali, Denis Ca...
books