Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., and Zadeck, K., "An efficient method of computing static single assignment form," pp. 25-35 in Conference Record of the Sixteenth ACM Symposium on Principles of Programming Languages, (Austin, TX, Jan. 11-13, 1989), ACM, New York, NY (1989).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Objects Two objects are said to be related when one object potentially contains a pointer to another. This case is similar to the one optimized by traditional object inlining (except that our optimization is far more aggressive) To find these cases, the first step is to transform the code to SSA [12] form and create a heap approximation using techniques from [20] SSA simplifies program analysis while the heap approximation provides the compiler with the sharing patterns between objects, allowing for more informed object combining decisions. The next step is to locate all occurrences of ....

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An Efficient Method Of Computing Static Single Assignment Form. In Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 25--35, Austin, Texas, USA, 1989. ACM Press.

....large, particularly if the annotations on each control flow graph node are nearly as large or larger than the original source code. Moreover, it may be an inefficient representation for data flow analysis as compared to sparse representations such as the program summary graph [9] the SSA graph [21] or Sparse Data Flow Evaluation Graphs [15] These graphs provide direct 12 connections in a graph between nodes that create and use data flow information. The program summary graph and SSA specifically connect definitions of variables with their uses; the der use relationship is useful for a ....

R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K. Zadeck. An efficient method of computing static single assignment form. In Conference Record of the Sixteenth Annual Symposium on Principles of Programming Languages, June 1989.

....on edges from region entry in Sec tion 3.3.4. In the remainder of the chapter we consider the analysis to be within a single, intraprocedural program region. One apparent alternative we should mention is that of representing predicates in terms of SSA (static single assignment) variables [32, 33]. However, the SSA vari ables are not invariant within a region in the presence of loops; rephrasing predicates to allow arbitrary movement would require substitution similar to that used in the demand driven symbolic analysis of [115] which could be quite expensive. 3.3.3 Predicates A ....

R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K. Zadeck. An efficient method of computing static single assignment form. In Proceedings of the Six- teenth Annual A CM Symposium on the Principles of Programming Languages, Austin, TX, January 1989.

....parallelism. Also, we should determine the types of hardware specialization that will increase the efficiency of the application. Finally, we must take into account the hardware properties of the circuit, e.g. power dissipation, critical path and interconnect area. Static single assignment [1,2] transforms the IR such that each variable is deftned exactly once. It is an ideal transformation for hardware because side effects of the transformation, alP nodes, are easily implemented in hardware as multiplexors. Furthermore, it creates a one to one mapping between each variable and its ....

....communication optimization. Thus, regardless of the data communication method used, we should try to generically model and minimize inter node communication. 3. 1 Static Single Assignment We can determine the relationship between the use and definition points through static single assignment [1,2]. Static Single Assignment (SSA) renames variables with multiple definitions into distinct variables one for each definition point. We define a name to represent the contents of a storage location (e.g. register, memory) A name is unspecific to SSA. In non SSA code, a name represents a storage ....

[Article contains additional citation context not shown here]

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman and F. K. Zadek, "An Efficient Method of Computing Static Single Assignment", Proceedings of ACM Symposium on Principles of Programming Languages, January 1989.

....the worst case is rarely achieved because AN(N) and AE(M,N) rapidly converge to fixed points (likewise other optimistic propagation algorithms behave) In practice, their actual running time is close to the best case running time. The best case running time of BC is O(g t) The use of SSA graphs [Cy] would also scale the running time down to O(g t) Thus, preliminary conversion of control flow graphs into the SSA form does not make much difference for the analysis under consideration. The asymptotic time complexity of preliminary actions construction of tables and links is not higher ....

R. Cytron et al. An Efficient Method of Computing Static Single Assignment Form. Proceedings of the ACM Symposium on Principles of Programming Languages, 1989, pp. 25-35.

....Also, we should determine the types of hardware specialization that will increase the efficiency of the application. Finally, we must take into account the hardware properties of the circuit, such as power dissipation, critical path and interconnect area. Static single assignment (SSA) [1,2] transforms the IR such that each variable is defined exactly once. It is an ideal transformation for hardware because the side effects of the transformation, nodes, are easily implemented in hardware as multiplexers. Furthermore, SSA creates a one to one mapping between each variable and its ....

....realized through communication optimization. Thus, regardless of the scheme that we use, we should try to genetically model and minimize inter node communication. 3. 1 Static Single Assignment We can determine the relationship between the use and definition points through static single assignment [1,2]. Static Single Assignment (SSA) renames variables with multiple definitions into distinct variables one for each definition point. We define a name to represent the contents of a storage location (e.g. register, memory) A name is unspecific to SSA. In non SSA code, a name represents a storage ....

[Article contains additional citation context not shown here]

R. Cytron et al., "An Efficient Method of Computing Static Single Assignment", Proceedings of Symposium on Principles of Programming Languages, January 1989.

....[4] It is composed of seven major phases: Renumber The symbolic registers in the routine are renamed to create live ranges. A live range is a collection of definitions that reach a common use. Briggs accomplishes this renumbering by converting the routine to pruned static single assignment form [12] and then combining all names mentioned in each OE node. Build The interference graph contains a node for each live range and an edge between each pair of live ranges that are simultaneously live. The graph is represented by both a triangular bit matrix and a collection of adjacency lists. We ....

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An efficient method of computing static single assignment form. In Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, pages 25--35, Austin, Texas, January 1989.

....constant propagation, global flow insensitive dead assignment elimination, synchronization optimizations, and scalar replacement of aggregates and short arrays. Level 2 augments level 1 with SSA based flowsensitive optimizations. In addition to traditional SSA optimizations on scalar variables [6], the system also uses Heap Array SSA form [8] to perform redundant The compiler performs both unguarded inlining of final and static methods and guarded inlining of non final virtual methods. In addition, the compiler exploits preexistence to safely perform unguarded inlining of some ....

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An efficient method for computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451--490, 1991.

....and thereby avoid a large number of cases that would have otherwise required modifying upwardlyexposed uses. This is identical to the pessimistic generalization of the state described in section 3.4.13. This algorithm for OE node placement does not come up with the optimal OE node placement [54, 55, 130, 56], but comes reasonably close in practice. 52 3.4.12 Method inlining One of the most beneficial optimizations in Java is method inlining. Most Java programs are written in a heavily object oriented fashion, with a large number of calls to methods with small bodies. Method inlining can yield very ....

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An efficient method of computing static single assignment form. Technical Report CS-88-16, Department of Computer Science, Brown University, October 1988.

....In this case, the shuffle code between two live segments can be move to the less frequent point, the edge E(B3, B4) than E(B2, B3) Briggs [3] also introduced live range splitting into Chaitin style register alloca tion. The splitting points are determined using static single assignment (SSA) [15] representations of programs and the loop boundaries [14] 13] 4] Since live range splitting is performed prior to the coloring phase, the decisions regarding split ting points and live range selections for splitting are made prematurely. Live ranges may be split unnecessarily, resulting in ....

....4.3.2 Finding Rematerializable Code One decision that every rematerializing allocator must consider is to determine what live ranges in a program are rematerializable. Briggs [3] suggests that each live range should be decomposed into its component values, according to the structure of the SSA [15] graph. To discover rematerializable values, a simple forward propagation algorithm similar to constant propagation [51] can be used. In Briggs scheme, the following values are considered to be rematerializable: All constants, All address arithmetic expressions that depend only on constants ....

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An efficient method for computing static single assignment form. In A CM SIGPLAN POPL, pages 25 35, 1989.

....in dynamic program order that is control independent of the branch in block 2, is referred to as the immediate post dominator of block 2. More formally, the immediate post dominator of a branch is the basic block nearest the branch which lies on every path between the branch and the CFG exit block [8,9]. The first instruction in block 5 is called the reconvergent point with respect to the branch in block 2. For the specific misprediction in the example above, block 3b is the incorrect control dependent block and block 4b is the correct control dependent block. 1.2 Why study control ....

R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and F. Zadeck. An efficient method of computing static single assignment form. Proc. ACM Symposium on Principles of Programming Languages, Jan 1989.

.... introduced by Alpern, Rosen, Wegman and Zadeck as a tool for efficient optimization in a pair of POPL papers [2, 35] and three years after that Cytron and Ferrante joined Rosen, Wegman, and Zadeck in explaining how to compute SSA form efficiently in what has since become the canonical SSA paper [10]. Johnson and Pingali [20] trace the development of SSA form back to Shapiro and Saint in [37] while Havlak [17] views OE functions as descendants of the birthpoints introduced in [34] Despite industry adoption of SSA form in production compilers [8, 9] academic research into alternative ....

....be used for the dataflow meet operator. The operator v is the partial ordering relation for a lattice, and x y iff x v y and x 6= y. 4 Static Single Assignment form Static Single Information (SSI) form derives many features from Static Single Assignment (SSA) form, as described by Cytron in [10]. To provide context for our definition of SSI form in section 5, we review SSA form. 4.1 Definition of SSA form Static Single Assignment form is a sparse program representation in which each variable has exactly one definition point. As a consequence, only one assignment can reach each use, ....

[Article contains additional citation context not shown here]

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. In Proceedings of the 16th ACM Symposium on Principles of Programming Languages (POPL), pages 25--35, Austin, Texas, Jan. 1989.

....use def chain. Instead of merging information about b just before every use of b, the compiler can merge the information at points where different definitions of b meet. This leads to Static Single Assignment (SSA) form, so called because each variable is assigned only once in the program text [15]. Because each variable is assigned only once, we only need one use def chain per use of a variable. However, building SSA form is not trivial; programmers assign to the same variable many times. The compiler must rename the target variable in each assignment to a new name; it must also rename the ....

....and is 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 was converted into Static Single Assignment (SSA) form [15]. The original program assigns values to names 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 a ....

[Article contains additional citation context not shown here]

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. In Conference Record of the Sixteenth ACM Symposium on the Principles of Programming Languages, Jan. 1989.

....particular programming idioms, such as sequences of il instructions passing method parameters, so that these may be translated more easily into efficient code. Secondly, they can be used to describe how the local variables manipulated by the il map back to a static single assignment (ssa) form [Cytron89] the aim being that run time code generators would not need to derive such a representation. 22 Miscellaneous virtual machines 2.1.8 Cint is a run time system for the C programming language driven by the principles used to design risc processors [Davidson87] As with the jvm, the Cint vm ....

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An efficient method of computing static single assignment form. In Proceedings of the sixteenth ACM Symposium on Principles of Programming Languages (POPL '89), pages 25--35, January 1989. (p 22)

.... Sparse Data flow Evaluation Graphs: Skipping Regions Sparse DFA problems those in which many of the flow functions are identity functions can be solved efficiently with sparse data flow evaluation graphs (SDFEG) 19] a generalization of the static single assignment representation (SSA) [25]. Sparse DFA problems occur, for example, when we wish to consider only a subset of a procedure s variables: for example, when trying to find the reaching definitions for a single variable as in Section 2.1.1. Partitionable DFA problems [19] can be partitioned into a set of sparse DFA problems: ....

....of sparse DFA problems: for example, SSA can be separated into a set of sparse DFA problems, one for each variable. Sparse techniques such as SSA, its extensions, and their applications have been studied extensively recently by many authors: Alpern et al. [8] Ballance et al. [12] Cytron et al. [25, 26], Ferrante et al. [29] and Wegman and Zadeck [89] Solving a DFA problem using a SDFEG is efficient because a SDFEG contains a subset of nodes in the original flow graph, those whose flow functions are not identity, and those at which flow values generated at distinct nodes meet. The edges of ....

R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K. Zadeck. "An efficient method of computing static single assignment form". ACM Trans. on Programming Lang. and Systems 13, 4 (October 1991), 451-490.

....Code motion transformations can then freely move the code within these zones, without concern for exceptions. Static Single Assignment (SSA) form, the standard intermediate representation for programs in a compiler, enables efficient implementation of many classical code optimization techniques [34, 12]. The SSA versions of many traditional optimization algorithms are both more efficient and easier to implement than their non SSA equivalents. An efficient SSA representation is needed to improve the implementation of classical optimizations. Chapter 4 presents a novel algorithm for converting SSA ....

....potential of supplying the information needed for object inlining and class specialization transformations at a much lower cost than type analysis, a feature which makes it an attractive alternative for providing the information for program transformation described in this thesis. Cytron et al. [34] have proposed the SSA form as an advanced intermediate compiler representation. Their algorithm is still widely used for conversion from CFG into SSA and back. Many improvements to their approach have been suggested since, including semi pruned and pruned SSA forms [16, 12] the gated SSA form ....

[Article contains additional citation context not shown here]

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An efficient method of computing static single assignment form. In Conference Record of the Sixteenth ACM Symposium on the Principles of Programming Languages, pages 25--35, Austin, Texas, January 1989.

....of program consisting of the then portion can be specialized with respect to y.foo( at S20. 5.1 Using the Sparse Evaluation Graph We use the sparse evaluation graph (SEG) 10] for determining the extant tests and their placements. The SEG is a generalization of static single assignment (SSA) [13] and can be applied to both forward and backward monotone data flow problems, while offering the same benefits as those of SSA applied to forward def use based data flow problems. Unlike SSA, where a definition triggers formation of OE nodes, in the SEG only a statement with a non identity ....

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An efficient method for computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451--490, 1991.

....between program variables such as x y n or alloc W buf [D buflen that holds in all program executions. These figures suggest that, in retrospect, it might have been better to use a more precise but slower analysis. We expect that standard analysis techniques (such as SSA form [13], Pratt s method [49] or Shostak s loop residues [56] and a points to analysis) could be used to improve on our current prototype by an order of magnitude or more. However, significant engineering effort is probably required to get there. Despite the unwieldy number of false alarms produced by ....

R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, F.K. Zadeck, "An Efficient Method of Computing Static Single Assignment Form," POPL'89.

....level close to high level language. Other authors were inspired by Ellis, e.g. Lowney et al. 13] Bockle [4] and Ebcioglu et al. 15] The approach presented by Ebcioglu is implemented in the Chameleon compiler [16] and works on assembly code. First, a procedure is transformed into SSA form [5], and loops are normalized. For gathering possible register values the same Procedure Name LOC Level 1 Level 2 Level 3 Level 4 Improvement Reg. Mem. Reg. Mem. Reg. Mem. Reg. Mem. Reg. Mem. keymatch 59 643 81 149 81 149 58 149 47 77 19 test3function 15 24 29 15 29 15 16 15 13 38 19 is ....

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadek. An efficient method of computing static single assignment form. In Proceedings of the Sixteenth Annual ACM Symposium on the Principles of Programming Languages, pages 25--35, Austin, Texas, Jan. 1989.

....propagation equations. In our framework, use def chains could be obtained by computing the frontier of the source functions and removing all informations about iteration vectors. In a similar context, a technique for conversion to static single assignment form has been advocated by Cytron et al. [11]. Here again, the source 28 program is not required to be structured, and only scalars or arrays taken as a whole are considered. The paper is concerned with the most economical insertion of so called OE functions (i.e. multiplexors) at join points in the control graph. When this is done, it is ....

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An efficient method of computing static single assignment form. In Proc. 16th ACM POPL Conf., pages 25--35, January 1989.

....of definitions and uses in a program. Choi, Cytron, and Ferrante s technique builds both definition use chains and definition definition chains for the program variables. However, the technique builds only the transitive reduction of these chains. Together with static single assignment froms [4], this technique guarantees that the number of chains built for a program is linear in the number of definitions and uses in a program. Choi, Cytron, and Ferrante also discuss how this compact representation can be used for data flow analyses. Our technique differs from Choi, Cytron, and ....

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. In Conference Record of the 16th ACM Symposium on Principles of Programming Languages, pages 25--35, 1989.

.... flow cannot be predicted at compile time, some runtime computation is needed to preserve the original data flow: In the static single assignment framework, OE functions may be needed to merge multiple reaching definitions, i.e. possible data definitions due to several incoming control paths [5, 6]. Such OE functions may be an overhead at run time, especially for non scalar data structures or when replicated data are distributed accros processors. We are thus looking for a static expansion, i.e. an expansion of data structures that does not need a OE function. Notice that according to our ....

R. Cytron, J. Ferrante, B. K. Rosen, M. K. Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. In 16th Annual ACM Symposium on Principles of Programming Languages, pages 25--35, 1989.

....chores like paging and context switching, and T i idle is the time process i spends waiting for messages. Some of these quantities are difficult to obtain because the time measurement tools on the iPSC 2 are primitive. 6 We started with an implementation of written in Id[17] by K. Ekanadham[8]. This program makes heavy use of higher order functions. Since our compiler does not yet handle such functions, we replaced all higherorder functions by equivalent first order code. Also, our compiler can handle only flat arrays. Since the coefficient matrices were implemented as matrices of ....

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F.K. Zadeck. An efficient method of computing static single assignment form. In Proceedings of the ACM Symposium on the Principles of Programming Languages, 1989.

....called dependencedriven execution, is a generalization of the tagged token dataflow model that permits imperative updates to memory. The dependence flow graph subsumes other representations such as continuation passing style [12] data dependence graphs [13] and static single assignment form [8]. In this paper, we show how dependence distance and direction information can be represented in this model using dependence operators. From a functional perspective, these operators can be viewed as functions on streams [4] 1 Introduction The growing complexity of optimizing and parallelizing ....

....power of giving semantics to dependence information. In a previous paper [14] we showed that all these problems can be avoided by using an executable representation of dependences called the dependence flow graph. The 2 A similar problem is encountered in using the static single assignment form [8]. dependence flow graph can be viewed either as a data structure incorporating dependence information or as a program that can be executed. Our execution model is called dependence driven execution and is a generalization of the tagged token dataflow model of computation; the generalization ....

[Article contains additional citation context not shown here]

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. In Proc. of the 16th ACM Symposium on Principles of Programming Languages, pages 25--35, Jan. 1989.

No context found.

R. Cytron, J. Ferrante, B. K. Rosen, M. K. Wegman, and F. K. Zadeck. An efficient method of computing static single assignmentform.In 16th Annual ACM Symposium on Principles of Programming Languages, pages 25--35, 1989.

No context found.

R. Cytron, J. Ferrante, B. K. Rosen, M. K. Wegman, and F. K. Zadeck. An efficient method of computing static single assignmentform.In 16th Annual ACM Symposium on Principles of Programming Languages, pages 25--35, 1989.

No context found.

Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., and Zadeck, K., "An efficient method of computing static single assignment form," pp. 25-35 in Conference Record of the Sixteenth ACM Symposium on Principles of Programming Languages, (Austin, TX, Jan. 11-13, 1989), ACM, New York, NY (1989).

No context found.

Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., and Zadeck, K., "An efficient method of computing static single assignment form," pp. 25-35 in Conference Record of the Sixteenth ACM Symposium on Principles of Programming Languages, (Austin, TX, Jan. 11-13, 1989), (1989).

No context found.

R. Cytron, J. Ferrante, B. K. Rosen, M. K. Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. In 16th Annual ACM Symposium on Principles of Programming Languages, pages 25--35, 1989.

No context found.

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. In Proc. of the 16th ACM Symposium on Principles of Programming Languages, pages 25--35, Jan. 19:.

No context found.

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An efficient method of computing static single assignment form. In Proceedings of the 16th ACM Symposium on Principles of Programming Languages, pages 25--35, January 1989.

No context found.

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An efficient method of computing static single assignment form. In Proceedings of the 16th ACM Symposium on Principles of Programming Languages, pages 25--35, January 1989.

No context found.

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman and F. K. Zadek, "An Efficient Method of Computing Static Single Assignment", Proceedings of ACM Symposium on Principles of Programming Languages, January 1989.

No context found.

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An efficient method of computing static single assignment form. In Conference Record of the 16th Annual ACM Symposium on Principles of Programming Languages, pages 25--35. ACM, January 1989.

No context found.

R. Cytron, J. Ferrante, B. K. Rosen, , M. N. Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. In Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 25--35. ACM Press, 1989.

No context found.

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An Efficient Method of Computing Static Single AssignmentForm. Proceedings of ACM Symposium on the Priniciples of Programming Languages, 1989.

No context found.

R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and K. Zadeck, "An efficient method of computing static single assignment form," pp. 25-35 in Conference Record of the Sixteenth ACM Symposium on Principles of Programming Languages, (Austin, TX, Jan. 11-13, 1989), ACM, New York, NY (1989).

No context found.

R. Cytron, J. Ferrante, B. K. Rosen, M. K. Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. In 16th Annual ACM Symposium on Principles of Programming Languages, pages 25--35, 1989.

No context found.

Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., and Zadeck, K., "An efficient method of computing static single assignment form," pp. 25-35 in Conference Record of the Sixteenth ACM Symposium on Principles of Programming Languages, (Austin, TX, Jan. 11-13, 1989), (1989).

No context found.

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An efficient method for computing static single assignment form. In ACM SIGPLAN POPL, pages 25--35, 1989.

No context found.

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark K. Wegman, and F. Kenneth Zadeck. An efficient method of computing static single assignment form. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 25-- 35, 1989.

No context found.

Ron Cytron, Jeanne Ferante, Barry K. Rosen, Mark N. Wegman and F. Kenneth Zadeck. An Efficient Method of Computing Static Single Assignment Form. In Sixteenth Annual (ACM) Symposium on Principles of Programming Languages, pages 25--35, Austin, Texas, 1989. ACM Press.

No context found.

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman and F. K. Zadeck, `An efficient method of computing static single assignment form', in Proc. 16th Annual ACM ACT-SIGPLAN Symposium on Principles of Programming Languages, Austin, Texas, 11--13 January 1989, pp. 25--35.

No context found.

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and Kenneth Zadeck. An efficient method of computing static single assignment form. In ACM-SIGPLAN ACM-SIGACT, editor, Conference Record of the 16th Annual ACM Symposium on Principles of Programming Languages (POPL '89), pages 25--35, Austin, TX, USA, January 1989.

No context found.

R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K. Zadeck. An efficient method of computing static single assignment form. In Conference Record of the Sixteenth Annual Symposium on Principles of Programming Languages, June 1989.

No context found.

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An Efficient Method of Computing Static Single Assignment Form. In Proc. of the 16th Annual ACM Symp. on Principles of Progr. Lang., pages 25--35, Los Angeles, January 1989.

No context found.

Cytron, R., Ferrante, J., Rosen, B. K., Wegman, M. N., and Zadeck, F. K. An efficient method of computing static single assignment form. In Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages (Austin, Texas, Jan. 1989), pp. 25--35.

No context found.

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An efficient method of computing static single assignment form. In Proceedings of the 16th ACM Symposium on Principles of Programming Languages, pages 25--35, January 1989.

No context found.

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. In Symposium on Principles of Programming Languages, pages 25--35. ACM, January 1989.

No context found.

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An efficient method of computing static single assignment form. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, pages 25--35. ACM Press, January 1989.

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