R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman and F. K. Zadeck, Efficiently computing static single assignment form and the control dependence graph, ACM Trans. Program. Lang. Syst., Vol 13, Number 4, 1991, ACM Press, pp. 451--490.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Program Verification By Calculating Relations - Jacques Carette Ryszard (Correct)
No context found.
R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman and F. K. Zadeck, Efficiently computing static single assignment form and the control dependence graph, ACM Trans. Program. Lang. Syst., Vol 13, Number 4, 1991, ACM Press, pp. 451--490.
Optimal Register Sharing for High-Level - Synthesis Of Ssa (Correct)
No context found.
R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck, "Efficiently computing static single assignment form and the control dependence graph," ACM Tr ans. Pr ogr am. Lang. Syst., vol. 13, no. 4, pp. 451--490, Oct. 1991.
Spatial Computation - Mihai Budiu Girish (2004) (Correct)
No context found.
R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems (TOPLAS), 13(4):451--490, 1991.
Inter-Iteration Scalar Replacement in the Presence of.. - Control-Flow Mihai Budiu (2004) (Correct)
No context found.
R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems (TOPLAS), 13(4):451--490, 1991.
Report No. UCB/CSD-3-1296 - November Computer Science (Correct)
No context found.
R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451--490, Oct. 1990.
Dependence Testing without Induction Variable Substitution - Cohen, Wu (Correct)
No context found.
R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. on Programming Languages and Systems, 13(4):451--490, October 1991.
Storage Mapping Optimization for Parallel - Programs Albert Cohen (Correct)
No context found.
R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451--490, October 1991.
Maximal Static Expansion - Barthou, Cohen, Collard (2000) (9 citations) (Correct)
No context found.
R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. on Prog. Lang. Sys., 13(4):451-- 490, October 1991.
An Evaluation of the New Framework for Loop Nest.. - Pop, Cohen, Silber (Correct)
No context found.
R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. on Programming Languages and Systems, 13(4):451--490, Oct. 1991.
Static Single Information from a Functional Perspective - Singer (Correct)
No context found.
R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451--490, Oct 1991.
Maximal Static Expansion - Denis Barthou Albert (1998) (9 citations) (Correct)
No context found.
R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451--490, October 1991.
Monotonic Evolution: an Alternative to Induction.. - Wu, Cohen.. (2001) (3 citations) (Correct)
No context found.
R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. on Programming Languages and Systems, 13(4):451--490, October 1991.
Algorithms for Computing the Static Single Assignment Form - Gianfranco Bilardi Keshav (2003) (1 citation) (Correct)
No context found.
R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13( October 1991.
L. Taylor Simpson - Lts Cs Rice (Correct)
No context found.
Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451--490, October 1991.
Dependence Analysis for Java - Craig Chambers Igor (1999) (10 citations) (Correct)
No context found.
Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. Efficiently Computing Static Single Assignment Form and the Control Dependence Graph. ACM Transactions on Programming Languages and Systems, 13(4):451--490, October 1991.
Dead Code Elimination - Briggs, Shillingsburg, Simpson (1993) (1 citation) (Correct)
No context found.
Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451--490, October 1991.
Spatial Computation - Budiu, Venkataramani, Chelcea.. (2004) (Correct)
No context found.
R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems (TOPLAS), 13(4):451--490, 1991.
Global Value Numbering using Random Interpretation - Gulwani, Necula (2004) (2 citations) (Correct)
No context found.
R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451--490, Oct. 1990.
A Formal Correctness Proof for Code Generation from SSA Form.. - Blech, Glesner (2004) (Correct)
No context found.
Cytron, R., Ferrante, J., Rosen, B. K., Wegman, M. N., and Zadeck, F. K.: Efficiently Computing Static Single Assignment Form and the Control Dependence Graph. ACM Transactions on Programming Languages and Systems. 13(4):451--490. October 1991.
Proofing: An Efficient and Safe Alternative to Mobile-Code.. - Gal, Probst, Franz (Correct)
No context found.
R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently Computing Static Single Assignment Form and the Control Dependence Graph. ACM 13(4):451--490, October 1991.
C to Asynchronous Dataflow Circuits: An End-to-End.. - Venkataramani, Budiu.. (2004) (Correct)
No context found.
R. Cytron, J. Ferrante, et al. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451--490, 1991.
Optimizing the translation out-of-SSA with renaming.. - Rastello, de Ferriere.. (2003) (Correct)
No context found.
R.Cytron, J.Ferrante, B.Rosen, M.Wegman, and K.Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451 -- 490, 1991.
A Uniform Approach to Semi-Dynamic Problems on Digraphs - Cicerone, Frigioni.. (1998) (1 citation) (Correct)
No context found.
R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451--490, 1991.
WaveScalar - Steven Swanson Ken (Correct)
No context found.
R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck, "Efficiently computing static single assignment form and the control dependence graph," ACM Transactions on Programming Languages and Systems, vol. 13, no. 4, 1991.
Fairplay - A Secure Two-Party Computation System - Malkhi, Nisan, Pinkas, Sella (2004) (4 citations) (Correct)
No context found.
R. Cytron, J. Ferrante, B. K. Rosen, M.N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451--490, 1991.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC