CHATTERJEE, R. K. AND RYDER, B. G. 1997a. Modular concrete type-inference for statically typed objectoriented programming languages. Tech. Rep. DCS-TR-349, Rutgers University. Nov. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Using Types to Analyze and Optimize Object-Oriented Programs - McKINLEY, MOSS (2001) (6 citations) (Correct)
....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. 1997a. Modular concrete type-inference for statically typed objectoriented programming languages. Tech. Rep. DCS-TR-349, Rutgers University. Nov.
Using Types to Analyze and Optimize Object-Oriented Programs - Diwan, McKinley, Moss (2001) (6 citations) (Correct)
....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. 1997a. Modular concrete type-inference for statically typed objectoriented programming languages. Tech. Rep. DCS-TR-349, Rutgers University. Nov.
Using Types to Analyze and Optimize Object-Oriented Programs - Diwan, McKinley, Moss (2001) (6 citations) (Correct)
....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. 1997a. Modular concrete type-inference for statically typed object-oriented programming languages. Tech. Rep. DCS-TR-349, Rutgers University. Nov.
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