R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman and F.K. Zadeck. An e#cient method of computing static single assignment form. In Sixteenth Annual Symposium on Principles of Programming Languages, pp. 25#35. ACM, January 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Composing Dataflow Analyses and Transformations - Lerner, Grove, Chambers (2001) (3 citations) (Correct)
....and nodes can be arbitrarily replaced. Clients of our framework would simply sequence analyses and transformations if non local graph replacements are needed, as in all other frameworks, including Assmann s. There is also a large body of literature on advanced and e#cient program representations [16, 12, 8, 14, 21, 30, 1, 18, 20, 25]. The definition of our framework is independent of the specific program representation used, and thus our work should be applicable to a wide range of graph based intermediate representations. In fact, our current Whirlwind implementation works over both control flow graphs and dataflow graphs. ....
Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An e#cient method of computing static single assignment form. In Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, pages 25--35, January 1989.
Combining Analyses, Combining Optimizations - Click, Cooper (1995) (1 citation) (Correct)
....limited to being a k ary function. This is a reasonable assumption for our application. We run the algorithm over a low level compiler intermediate representation, with k # 3. We call the set of op functions OP . We assume the program has been converted into Static Single Assignment (SSA) form [3]. In the original program, names are assigned values at multiple definition points. In the SSA form, each name corresponds to a single definition point. By convention, we generate the new names of SSA form by adding subscripts to the original names. This makes the relationship textually obvious to ....
R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An e#cient method of computing static single assignment form. In Conference Record of the Sixteenth ACM Symposium on the Principles of Programming Languages, pages 25--35, 1989.
Linear Scan Register Allocation - Poletto, Sarkar (1999) (20 citations) (Correct)
....uninterruptedly live, rather than one interval for the entire flow graph. This definition takes advantage of holes in variable lifetimes, and is analogous to binpacking without the second chance technique [Traub et al. 1998] Past work on renaming scalar variables, including renaming into SSA form [Cytron et al. 1989], can be useful in subsuming much of the splitting that might be useful for register allocation. Another possible optimization is coalescing of register moves. If the live interval of a variable v 1 ends where the live interval of another variable, v 2 , begins, and the program at that point ....
Cytron, R., Ferrante, J., Rosen, B. K., Wegman, M. N., and Zadeck, F. K. 1989. An e#cient method of computing static single assignment form. In Conference Record of the 16th Annual ACM Symposium on Principles of Programming Languages. Austin, TX, 25--35.
Optimizing Java Bytecode using the Soot Framework.. - Vallee-Rai, Gagnon, .. (2000) (2 citations) (Correct)
....to this typing problem is NP complete, but in practice simple polynomial algorithms su ce. Although splitting the local variables in this step produces many local variables, the resulting Jimple code tends to be easier to analyze because it inherits some of the disambiguation bene ts of SSA form[5]. 3. Clean up the code: Jimple code must now be compacted because step 1 produced extremely verbose code[18, 17] We have found that simple aggregation (collapsing single def use pairs) followed by copy propagation elimination of stack variables to be su cient to eliminate almost all redundant ....
Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark K. Wegman, and F. Kenneth Zadeck. An e cient method of computing static single assignment form. In 16th Annual ACM Symposium on Principles of Programming Languages, pages 2535, 1989.
Register Allocation With Instruction - Scheduling New Approach (Correct)
No context found.
R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman and F.K. Zadeck. An e#cient method of computing static single assignment form. In Sixteenth Annual Symposium on Principles of Programming Languages, pp. 25#35. ACM, January 1989.
Verified Code Generation for Embedded Systems - Glesner, Boesler (2002) (Correct)
No context found.
R. Cytron, J. Ferrante, and B. K. Rosen. An e#cient method of computing static single assignment form. In Conference Record of the 16th Annual ACM Symposium on Principles of Programming Languages (POPL'89), pages 25--35. ACM-SIGACT, ACM Press, 1989.
A New MLRISC Register Allocator - Leung, George (Correct)
No context found.
R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An e#cient method for computing static single assignment form. In ACM SIGPLAN POPL, pages 25--35, 1989.
Marmot: An Optimizing Compiler for Java - Fitzgerald, Knoblock, Ruf.. (1999) (46 citations) (Correct)
No context found.
Ron Cytron, Jeanne Ferrante, Berry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An e#cient method of computing static single assignment form. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, January 1989.
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