R. Chatterjee, et al. Scalable, Flow-Sensitive Type Inference for Statically Typed Object-Oriented Languages. Technical Report DCS-TR-326, Rutgers University, August 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....is represented as a tree: the root represents the polymorphic object and the leaves represent objects of possible types. When it receives a message, each possible object has a call site. For a statically typed OO programming language, the possible types of an object can be determined statically [3]. In our representation, since the PDG of the whole program is not a connected graph, we use a different approach in which the polymorphism is represented by the inter parameter dependence sets. Each set is associated with an object type. When an object invokes a method, the inter parameter ....

R. Chatterjee, et al. Scalable, Flow-Sensitive Type Inference for Statically Typed Object-Oriented Languages. Technical Report DCS-TR-326, Rutgers University, August 1994.

....and Practice in Information Technology, Vol. 4. Michael Oudshoom, Ed. Reproduction for academic, not for profit purposes permitted provided this text is included. Andrew L Wendelborn Department of Computer Science University of Adelaide, SA 5005 andrew as .adelaide. edu. au Some research [BCC97, CBC93, CR97, CS95, EGH94, PR94, PR95, WWG00] has analyzed aliases statically for high performance computing such as parallelizing compiler as well as compiler optimization. Those works proposed alias analyses for C C by representing the alias relation with pointers and pointer to pointer objects. However, the representation of alias ....

....node collects an alias set from a predecessor node of a current call node and computes its own alias set out(n) with the collected set. This alias set is propagated to the entry node of the called method and killed in the calling method. It reduces the inefficiency of the previous approaches [PR94, PR95, CR97] which compute redundant alias relations to be modified in a called method. Apostcall node collects the modified kill set of the precall node and exit nodes alias sets of all possible called methods. By selecting references accessible from the calling method, we can compute the result alias set of ....

[Article contains additional citation context not shown here]

R. Chatterjee and B. G. Ryder. Scalable, flow-sensitive type inference for statically typed object-oriented languages. Technical Report DCS-TR-326, Rutgers University, August 1997.

....actual parameter. Def(s) Def(s) V ; v is a global variable if y Dep P(M, x) then Let a and b are the actual parameters corresponding to x and y; Def(s, a) Def(s, a) b ; Algorithm 1 Parameters mapping 3 4 Entry (X, X) X, z) Y, Y) Y, z) Figure 3 PDG of Move statically [14] . In our representation, because the PDG of the whole program is not a connected graph, we use a different approach in which the polymorphism is represented by the inter parameter dependence sets. Each set is associated with an object type. When an object invokes a method, the inter parameter ....

R. Chatterjee, et al. Scalable, flow-sensitive type inference for statically typed object-oriented languages. Technical Report DCS-TR-326, Rutgers University, August 1994.

....the root represents the polymorphic object and the leaves represent the object in its various possible types. When the root object receives a message, each possible object has a call site. Ada 95 is a statically typed OO language. The possible types of an object can be determined statically [19]. In our representation, because the PDG of the whole program is not a connected graph, we use a different approach in which the polymorphic dependencies are represented by the interparameter dependency set. To distinguish the set for different types, the interparameter dependency set has a type ....

Chatterjee, R. and et al., Scalable, Flow-Sensitive Type Inference for Statically Typed Object-Oriented Languages, Technical Report DCS-TR-326, Rutgers University, 1994.

....or indirectly call abstract methods and the callsites. Such methods are called polymorphic methods. Objects whose type might change during execution are called polymorphic objects. Java is a statically typed object oriented language. The possible types of an object can be determined statically [12] . When an object invokes a method, the inter parameter dependence set is computed in two cases, according to whether the object type is determined or not. a. If the object type is determined. If the method is not a polymorphic method, no more analysis is needed, otherwise change the ....

R. Chatterjee and et al. Scalable, flow-sensitive type inference for statically typed object-oriented languages. Technical Report DCS-TR-326, Rutgers University, August 1994.

....We evaluate TBAA with respect to RLE and method resolution using static and dynamic metrics, and a limit analysis. The majority of previous work on alias analysis uses only static properties, such as the size of the may alias and points to sets [Banning 1979; Burke et al. 1994; Hind et al. 1999; Chatterjee et al. 1999; Chase et al. 1990; Choi et al. 1993; Cooper and Kennedy 1989; Deutsch 1994; Emami et al. 1994; Landi and Ryder 1991; 1992; Larus and Hilfinger 1988; Shapiro and Horwitz 1997b; Steensgaard 1996; Weihl 1980] A few researchers recently have used dynamic evaluation such as measuring the execution time improvement due ....

....9.1 Alias Analysis Alias analysis must consider an unbounded number of paths through an unbounded collection of data, and is therefore harder than traditional data flow analyses. The literature contains many algorithms for alias analysis [Banning 1979; Burke et al. 1994; Hind et al. 1999; Chatterjee et al. 1999; Chase et al. 1990; Choi et al. 1993; Cooper and Kennedy 1989; Deutsch 1994; Emami et al. 1994; Landi and Ryder 1991; 1992; Larus and Hilfinger 1988; Shapiro and Horwitz 1997b; Steensgaard 1996; Weihl 1980; Hummel et al. 1994; Cooper and Lu 1997; Larus and Hilfinger 1988; Wilson and Lam 1995] The key differences ....

[Article contains additional citation context not shown here]

CHATTERJEE, R. K. AND RYDER, B. G. 1997b. Scalable, flow-sensitive type-inference for statically typed object-oriented programming languages. Tech. Rep. DCS-TR-326, Rutgers University. July.

....how we order the different analyses in the compiler (Section 5.4) 5.1 Metrics We evaluate TBAA with respect to RLE and method resolution using static and dynamic metrics, and a limit analysis. The majority of previous work on alias analysis [Banning 1979; Burke et al. 1994; Hind et al. 1999; Chatterjee et al. 1999; Chase et al. 1990; Choi et al. 1993; Cooper and Kennedy 1989; Deutsch 1994; Emami et al. 1994; Landi and Ryder 1991; 1992; Larus and Hilfinger 1988; Shapiro and Horwitz 1997b; Steensgaard 1996; Weihl 1980] uses only static properties, such as the size of the may alias and pointsto sets. A few researchers recently ....

....9.1 Alias analysis Alias analysis must consider an unbounded number of paths through an unbounded collection of data, and is therefore harder than traditional data flow analyses. The literature contains many algorithms for alias analysis [Banning 1979; Burke et al. 1994; Hind et al. 1999; Chatterjee et al. 1999; Chase et al. 1990; Choi et al. 1993; Cooper and Kennedy 1989; Deutsch 1994; Emami et al. 1994; Landi and Ryder 1991; 1992; Larus and Hilfinger 1988; Shapiro and Horwitz 1997b; Steensgaard 1996; Weihl 1980; Cooper and Kennedy 1989; Hummel et al. 1994; Cooper and Lu 1997; Larus and Hilfinger 1988; Wilson and Lam ....

[Article contains additional citation context not shown here]

CHATTERJEE, R. K. AND RYDER, B. G. 1997b. Scalable, flow-sensitive type-inference for statically typed object-oriented programming languages. Tech. Rep. DCS-TR-326, Rutgers University. July.

....calls, and to improve the precision of MOD REF information for rle. 4. RESULTS This section evaluates type based alias analysis and method resolution analyses using static and dynamic metrics, and a limit analysis. The majority of previous work on alias analysis [Banning 1979; Burke et al. 1994; Chatterjee et al. 1999; Chase et al. 1990; Choi et al. 1993; Cooper and Kennedy 1989; Deutsch 1994; Emami et al. 1994; Landi and Ryder 1991; 1992; Larus and Hilfinger 1988; Shapiro and Horwitz 1997b; Steensgaard 1996; Weihl 1980] evaluates alias analysis using only static properties, such as the sizes of the may alias and points to sets. ....

....optimization evaluation. 8.1 Alias Analysis Alias analysis must consider an unbounded number of paths through an unbounded collection of data, and is therefore harder than traditional data flow analyses. The literature contains many algorithms for alias analysis [Banning 1979; Burke et al. 1994; Chatterjee et al. 1999; Chase et al. 1990; Choi et al. 1993; Cooper and 7 Only virtual functions may be overridden in subtypes. Using Types to Analyze and Optimize Object Oriented Programs Delta 35 Kennedy 1989; Deutsch 1994; Emami et al. 1994; Landi and Ryder 1991; 1992; Larus and Hilfinger 1988; Shapiro and Horwitz 1997b; ....

[Article contains additional citation context not shown here]

Chatterjee, R. K. and Ryder, B. G. 1997b. Scalable, flow-sensitive type-inference for statically typed object-oriented programming languages. Tech. Rep. DCS-TR-326, Rutgers University. July.

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