A. Pioli and M. Hind. Combining interprocedural pointer analysis and conditional constant propagation. Tech. Rep. RC 21532(96749), IBM T.J. Watson Research Center, March 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Combining Optimizations, Combining Theories - Veldhuizen, Siek (Correct)
....lattice equations, and encodes interactions between them using special terms. The equations are then solved simultaneously using a global optimistic assumption. Click also demonstrated an ecient combined analysis for unreachable code, constant propagation and global value numbering. See [CDG96,PH99,LGC02] for recent developments in combining imperative program analyses. 2 Pessimism and Optimism In this section we compare two avours of program analysis known as pessimism and optimism in the imperative compilers literature. We prefer these terms to least and greatest xpoints since ....
A. Pioli and M. Hind. Combining interprocedural pointer analysis and conditional constant propagation. Technical Report 21532, IBM T. J. Watson Research Center, March 1999.
On Combining Program Improvers - Veldhuizen, Siek (2003) (Correct)
....lattice equations, and encodes interactions between them using special terms. The equations are then solved simultaneously using a global optimistic assumption. Click also demonstrated an e#cient combined analysis for unreachable code, constant propagation and global value numbering. See [CDG96,PH99,LGC02] for recent developments in combining imperative program analyses. 2 Pessimism and Optimism In this section we compare two flavours of program analysis known as pessimism and optimism in the imperative compilers literature. We prefer these terms to least and greatest fixpoints since ....
A. Pioli and M. Hind. Combining interprocedural pointer analysis and conditional constant propagation. Technical Report 21532, IBM T. J. Watson Research Center, March 1999.
Composing Dataflow Analyses and Transformations - Lerner, Grove, Chambers (2001) (3 citations) (Correct)
....specialpurpose monolithic super analysis that simultaneously performs constant propagation and unreachable code elimination. Click and Cooper [9] provide a lattice theoretic explanation of conditional constant propagation with special flow functions defined over the composed domain. Pioli and Hind [24] developed a monolithic analysis that combines constant propagation and pointer analysis using special combined flow functions. Chambers and Ungar manually combined class analysis, splitting, and inlining [7] In all these cases, the analyses had to be combined manually in order for them to ....
Anthony Pioli and Michael Hind. Combining interprocedural pointer analysis and conditional constant propagation. Technical Report 21532, IBM T.J. Watson Center, March 1999.
Traveling Through Dakota: Experiences with an Object-Oriented.. - Hind, al. (1999) Self-citation (Hind) (Correct)
....system is a program analysis system written in C that was created to experiment with various interprocedural analyses. The system has been used to implement six pointer alias analyses, mod ref analysis, conditional constant propagation, live variable analysis, and reaching definitions analysis [10, 11, 18, 17]. This paper describes some of the experiences in the design and implementation of the system. Figure 1 presents an overview of the NPIC system. Montana, a prototype version of IBM s Visual Age for C incremental compiler (version 4.0 [16] is used to parse source C and C code and create an ....
....PCG CFGs Graphs Figure 1: NPIC system overview. Circles represent a process and squares represent data, either in memory or in a file. The Dakota PCG and CFG structures are emphasized since they play a central role in the overall system. includes several combinations with the alias analyses [17, 18]. Not included are the Montana component and various shell scripts that automate regression testing, run various combinations of analyses, and automatically produce L A T E X [14] tables or jgraph [19] charts. This rest of this paper is organized as follows. The next section highlights the ....
[Article contains additional citation context not shown here]
Anthony Pioli and Michael Hind. Combining interprocedural pointer analysis and conditional constant propagation. Research Report 21532, IBM T. J. Watson Research Center, March 1999. Also available as SUNY at New Paltz Technical Report #99-103.
Which Pointer Analysis Should I Use? - Hind, Pioli (2000) Self-citation (Pioli Hind) (Correct)
....if a conditional branch will always evaluate to one value. In addition to potentially removing unexecutable code, this analysis can simplify computations and provide useful information for cloning algorithms. Because this analysis was designed to be combined with Choi et al. s pointer analysis [26, 27], it uses pointer information directly, rather than using the Mod Ref sets as was done in reaching definitions and live variable analysis. In this work, the constant propagation analysis is simply run after the pointer analysis is completed. Like Choi et al. s analysis, the constant propagation ....
A. Pioli and M. Hind. Combining interprocedural pointer analysis and conditional constant propagation. Research Report 21532, IBM T. J. Watson Research Center, Mar. 1999. Also available as SUNY at New Paltz Technical Report #99-103.
Evaluating The Effectiveness of Pointer Alias Analyses - Hind, Pioli (1999) (6 citations) Self-citation (Pioli Hind) (Correct)
....different pointer aliasing algorithms to different parts of a program. Chatterjee et al. 8] describe a technique for incorporating relevant context information into a data flow analysis and illustrate their approach for points to analysis. Empirical results on C programs are provided. Pioli [32, 33] expands on the work of this paper by providing precision efficiency results for clients of pointer analysis information such as mod ref, live variables, dead assignments, conditional constant propagation, and unreachable code. Empirical results are also presented for several combinations of ....
Anthony Pioli and Michael Hind. Combining interprocedural pointer analysis and conditional constant propagation. Research Report 21532, IBM T. J. Watson Research Center, March 1999. Also available as SUNY at New Paltz Technical Report #99-103.
Analyzing Memory Accesses in x86 Executables - Gogul Balakrishnan And (2004) (4 citations) (Correct)
No context found.
A. Pioli and M. Hind. Combining interprocedural pointer analysis and conditional constant propagation. Tech. Rep. RC 21532(96749), IBM T.J. Watson Research Center, March 1999.
Active Libraries and Universal Languages - Veldhuizen (2004) (1 citation) (Correct)
No context found.
A. Pioli and M. Hind. Combining interprocedural pointer analysis and conditional constant propagation. Technical Report 21532, IBM T. J. Watson Research Center, March 1999. URL citeseer.nj.nec.com/pioli99combining.html.
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