How to Analyze Large Programs Efficiently and Informatively
- Dhananjay M. Dhamdhere
- Barry K. Rosen
- et al.
- 1992
- ACM SIGPLAN Notices
Paper
Publications
13 results for F. Kenneth. Zadeck
CONSTANT PROPAGATION WITH CONDITIONAL BRANCHES.
- Mark N. Wegman
- F. Kenneth Zadeck
- 1985
- POPL 1985
Conference paperEfficiently Computing Static Single Assignment form and the Control Dependence Graph
- Ron Cytron
- Jeanne Ferrante
- et al.
- 1991
- ACM TOPLAS
PaperConstant Propagation with Conditional Branches
- Mark N. Wegman
- F. Kenneth. Zadeck
- 1991
- ACM TOPLAS
PaperAnalysis of pointers and structures
- David R. Chase
- Mark Wegman
- et al.
- 1990
- PLDI 1990
Conference paperIncremental evaluation of computational circuits
- Bowen Alpern
- Roger Hoover
- et al.
- 1990
- SODA 1990
Conference paperAnalysis of Pointers and Structures
- David R. Chase
- Mark Wegman
- et al.
- 1990
- ACM SIGPLAN Notices
PaperEfficient method of computing static single assignment form
- Ron Cytron
- Jeanne Ferrante
- et al.
- 1989
- POPL 1989
Conference paperGlobal value numbers and redundant computations
- Barry K. Rosen
- Mark N. Wegman
- et al.
- 1988
- POPL 1988
Conference paperDetecting equality of variables in programs
- Bowen Alpern
- Mark N. Wegman
- et al.
- 1988
- POPL 1988
Conference paper