Craig Chambers, Jeffrey Dean, and David Grove. Frameworks for Intra- and Interprocedural Dataflow Analysis. Technical Report UW-CSE-96-11-02, University of Washington, November 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... an intraprocedural analysis framework in Ada to support not just construction of a single analysis, but combinations of analyses (such as Cartesian products) and parameterized analyses (e.g. find variable values in terms of a value lattice which can be plugged in later) 36] The Vortex compiler [22] includes a framework which combines transformation and iterative program analysis. Like the system of Dwyer and Clarke, the Vortex frame work supports composition of analyses; it can also derive an interprocedural analysis automatically from a given intraprocedural analysis. Context sensitivity ....

....lo) Such PTFs can be combined to record multiple values, as occurs in typical memoized function use, by building a set of such pairs. However, this is a rather limited use of the concept of PTF. Nevertheless, several prior PTF systems described in the literature are just memoization [22, 103]. 4.6.2 Partial Evaluation Ruf, in [100, 101,102] uses a concept similar to a guarded PTF in a general purpose on line partial evaluator. When specializing a procedure for one given specification, he computed the domain of specialization (DOS) over which the specialized procedure was the best ....

C. Chambers, J. Dean, and D. Grove. Frameworks for intra- and interprocedu- ral dataflow analysis. Technical Report Technical Report UW-CSE-96-11-02, University of Washington Department of Computer Science and Engineering, 1996.

....8.1. 4 Combining analyses and negative time optimization Various sources remark on the fact that combining analyses can not only be more efficient, but lead to better results than running the analyses separately [41, 111] A system for intra and interprocedural data flow analysis presented in [25] allows one to run multiple analyses in parallel to achieve the precision of a single monolithic analysis while preserving modularity and reusability. In [41] Click mentioned that finding constants and common subexpressions while parsing reduced the peak intermediate representation size, which ....

C. Chambers, J. Dean, and D. Grove. Frameworks for intra- and interprocedural dataflow analysis. Technical Report TR-96-11-02, University of Washington, Department of Computer Science and Engineering, November 1996.

....of 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 ....

C. Chambers, J. Dean, and D. Grove. Frameworks for intra- and interprocedural dataflow analysis. Technical Report TR-96-11-02, University of Washington, Department of Computer Science and Engineering, November 1996.

....the immediate precision and efficiency of these analyses, but no clients of the analyses are reported. Readers are referred to this paper for detailed information regarding the pointer alias analyses precision and comparisons to others results. Other The SUIF [WFW 94] Vortex [DDG 96, CDG96] and PAG [AM95] systems provide frameworks for building data flow analyzers. They do not use the multiple inheritance scheme we employ (Section 5.7.1) but instead allow the analysis implementor to have a list of analysis specific methods to apply at their equivalent of a CFG node which are fed ....

Craig Chambers, Jeffrey Dean, and David Grove. Frameworks for intra- and interprocedural dataflow analysis. Technical Report UW-CSE-96-11-02, Department of Computer Science and Engineering, University of Washington, November 1996.

....partition, but this isn t inherent in their model, which could be modified easily enough to take profile information into account. Chambers et al. have observed that the degree of context sensitivity of an inter procedural analysis can be controlled by selective merging of calling contexts [4, 12]. However, they don t consider using profile information to control the processing of different call sites to a function. Moreover, while this doesn t appear to be inherent in their framework, their examples seem to suggest that, once certain parameters controlling the degree of ....

C. Chambers, J. Dean, and D. Grove, "Frameworks for Intra- and Interprocedural Dataflow Analysis", Technical Report 96-11-02, Dept. of Computer Science and Engineering, University of Washington, Seattle, 1996.

....1 ffl 2 The flow information now precisely models the fact that only true is passed as the second argument to z:w:w. 4 Analysis Frameworks We conclude by comparing BANE with other program analysis frameworks. There have been many such frameworks in the past; see for example [ATGL96,AM95,Ass96,CDG96,DC96,HMCCR93,TH92,Ven89,YH93] Most frameworks are based on standard dataflow analysis, as first proposed by Cocke [Coc70] and developed by Kildall [Kil73] and Kam and Ullman [KU76] while others are based on more general forms of abstract interpretation [Ven89,YH93] In previous frameworks the ....

.... others are based on more general forms of abstract interpretation [Ven89,YH93] In previous frameworks the user specifies a lattice and a set of transfer functions, either in a specialized language [AM95] in a Yacc like system [TH92] or as a module conforming to a certain interface [ATGL96,CDG96,DC96,HMCCR93] The framework traverses a program representation (usually a control flow graph) either forwards or backwards, calling user defined transfer functions until the analysis reaches a fixed point. A fundamental distinction between BANE and these frameworks is the interface with a client ....

C. Chambers, J. Dean, and D. Grove. Frameworks for Intra- and Interprocedural Dataflow Analysis. Technical Report 96-11-02, Department of Computer Science and Engineering, University of Washington, November 1996.

....algorithm implemented in this paper, and provides a high level description of the two flow insensitive algorithms. A more detailed description of the flow insensitive algorithms can be found in [4] These algorithms and other pointer aliasing techniques are further described in [5] The Vortex [10, 6] and SUIF [40] compilers provide infrastructures for interprocedural analyses. For efficiency reasons, they do not use the multiple inheritance based scheme outlined in Section 5, but provide the possibility of augmenting the equivalent of a CFG node with a list of analysis specific methods to ....

Craig Chambers, Jeffrey Dean, and David Grove. Frameworks for intra- and interprocedural dataflow analysis. Technical Report UW-CSE-96-11-02, Department of Computer Science and Engineering, University of Washington, November 1996.

....algorithm implemented in this paper, and provides a high level description of the two flow insensitive algorithms. A more detailed description of the flow insensitive algorithms can be found in [5] These algorithms and other pointer aliasing techniques are further described in [6] The Vortex [13, 8] and SUIF [52] compilers provide infrastructures for interprocedural analyses. For efficiency reasons, they do not use the multiple inheritance based scheme outlined in Section 5, but provide the possibility of augmenting the equivalent of a CFG node with a list of analysis specific methods to ....

Craig Chambers, Jeffrey Dean, and David Grove. Frameworks for intra- and interprocedural dataflow analysis. Technical Report UW-CSE-96-11-02, Department of Computer Science and Engineering, University of Washington, November 1996.

No context found.

Craig Chambers, Jeffrey Dean, and David Grove. Frameworks for Intra- and Interprocedural Dataflow Analysis. Technical Report UW-CSE-96-11-02, University of Washington, November 1996.

....capture (with low compile time overhead) the cases needed in practice to exploit mutually beneficial interactions. 8. EXTENSIONSTOTHEBASEFRAMEWORK This section describes two extensions to the base framework: snooping and tunneling values. Other extensions are described in another technical report [6], including the interprocedural aspect of our framework. 8.1 Snooping In addition to supporting communication via graph transformations, our framework also supports communication via what we call snooping. Snooping allows the flow function of one analysis to look at the dataflow values being ....

Craig Chambers, Je#rey Dean, and David Grove. Frameworks for intra- and interprocedural dataflow analysis. Technical Report UW-CSE-96-11-02, University of Washington, November 1996.

.... the program call graph representation (with mutually recursive classes for procedure nodes, call sites, and call edges) and intraprocedural and interprocedural analysis frameworks (with mutually recursive classes for analysis domains, transformation selections, and traversal state) Chambers et al. 96] Type parameters were used to parameterize over the types of mutable fields of classes, where the type of the field could become more specific in a subclass. 26 parameterized types used constrained subtype declarations to state that different instances of the parameterized type were subtypes if ....

Craig Chambers, Jeffrey Dean, and David Grove. Frameworks for Intra- and Interprocedural Dataflow Analysis. Technical Report UW-CSE-96-11-02, University of Washington, November 1996.

No context found.

C. Chambers, J. Dean, and D. Grove. Frameworks for intra- and interprocedural dataflow analysis. Technical report, Department of Computer Science and Engineering, University of Washington, 1996.

No context found.

C. Chambers, J. Dean, and D. Grove. Frameworks for intra- and interprocedural dataflow analysis. Technical Report TR-96-11-02, University of Washington, Department of Computer Science and Engineering, November 1996.

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