Matthew B. Dwyer and Lori A. Clarke. A flexible architecture for building data flow analyzers. In Proc. of the 18th Intl. Conf. on Software Engineering (ICSE), pages 554--564, Berlin, Germany, March 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... Dwyer and Clarke presented 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 ....

.... data flow problems, akin to the predicate to value analysis presented here, but with a fixed, finite, disjoint set of qualifications in place of our more general predicate lattice [61] their technique is also present in even more limited form in the general analysis framework of Dwyer and Clarke [36]. Their restrictions on qualifications limits its usefulness except in cases where the interesting predicates are known before analysis begins, and incorporating an unbounded predicate lattice into their analysis brings with it a host of new issues they did not address: scoping of predicates, cor ....

Matthew B. Dwyer and Lori A. Clarke. A flexible architecture for building data flow analyzers. In Proceedings of the 18th International Conference on Software Engineering (ICSE-18), Berlin, 1999.

.... WORK A number of analysis frameworks have been developed for making intra and interprocedural analyses easier to write and reason about, including Sharlit [26] SPARE [27] FIAT [17] McCAT [19] System Z [33] PAG [2] the k tuple dataflow analysis framework [22] and Dwyer and Clarke s system [15]. However, none of these systems address integrating transformations with analyses, nor automatically combining analyses profitably. Nelson and Oppen [23] describe how under certain conditions satisfiability programs for several theories can be combined into a satisfiability program for the ....

Matthew B. Dwyer and Lori A. Clarke. A flexible architecture for building data flow analyzers. In 17th International Conference on Software Engineering, pages 554--564, Berlin, Germany, March 1998.

....beyond the realm of the artifact itself. While certainly accurate if the information hiding principle is strictly followed, the measure certainly does not apply to all software artifacts. Relative size of dependency analysis graph. This measure adapts established dependence analysis techniques [7] to basically calculate the reach of a change (e.g. how much of the code in the workspace might be affected) The larger the reach, the higher the impact. A drawback of this method is that computationally it can be very expensive. It should be noted that none of the severity or change impact ....

Dwyer, M. and L.A. Clarke, A Flexible Architecture for Building Data Flow Analyzers, in Proceedings of the Eighteenth International Conference on Software Engineering. 1996, ACM. p. 554-564.

....objects to apply to a node. The result is code that iterates over these objects to perform the appropriate analysis. Other tools that automate the process of implementing a data flow analysis, such as Sharlit [22] SPARE [6] FIAT [8] System Z [27] PAG [1] and Dwyer and Clarke system [5], can expedite the construction of new data flow analyses. They provide a higher level of abstraction than used in our system. The McCAT [2] and PROLANGS [15, 20] pointer analysis systems are implemented in C and thus, do not use the object oriented approach employed in Dakota. Wilson s pointer ....

Matthew B. Dwyer and Lori A. Clarke. A flexible architecture for building data flow analyzers. In Eighteenth International Conference on Software Engineering, 1996.

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

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

M. Dwyer and L. Clarke. A Flexible Architecture for Building Data Flow Analyzers. In Proceedings of the 18th International Conference on Software Engineering (ICSE-18), Berlin, Germany, March 1996.

....in developing a family of optimizing compiler and debugger products established our appreciation for modular, component based systems. We have continued to apply those principles in our research. We have analyzed and exploited information about three distinct software domains: flow analysis [DC96b] discrete time grid simulations 2 [DW97b, DW97a] and graphical user interfaces [DCH97] In the first two of these we have defined and constructed parameterized frameworks that support construction of software systems in those domains. In our simulation framework, called PAGS, we have found the ....

M.B. Dwyer and L.A. Clarke. A flexible architecture for building data flow analyzers. In Proceedings of the 18th International Conference on Software Engineering, March 1996.

....average of those times. The run times include all overhead costs related to the object management infrastructure on which the tools are built. The reported run times are extremely large and reflect the fact that this evaluation was done on a prototype system designed for flexible experimentation [DC96] and not for efficiency. A more efficient version of the FLAVERS Ada tool set that includes several optimizations is currently under development and preliminary data suggests that it achieves 2 orders of magnitude better performance than the prototype described here. The timing results reported ....

M.B. Dwyer and L.A. Clarke. A flexible architecture for building data flow analyzers. In Proceedings of the 18th International Conference on Software Engineering, March 1996.

.... that uses parameterized components to provide generic support for data structures and algorithms that manipulate them [12, 13] Approaches that support reuse in specific software domains have also been developed that rely on using existing components in concert with parameterized components, e.g. [3, 8]. Like this work, our concurrency skeletons provide a framework for concisely expressing a computation that can be configured through the use of user supplied parameters to satisfy a wide variety of application requirements. 3 Background As with all software, the construction of concurrent ....

.... also avoids large amounts of redundant and unnecessary computations as do other worklist flow analysis algorithms [10] We are implementing it using this skeleton and will incorporate it as a component of a template based framework for constructing data flow analyzers that has been written in Ada [8]. 5.3 Numerical Integration The final application we consider is an adaptive quadrature solution to the numerical integration problem [2] The approach involves approximating a definite integral by breaking the interval of integration down into a series of rectangles that approximate the area ....

M.B. Dwyer and L.A. Clarke. A flexible architecture for building data flow analyzers. In Proceedings of the 18th International Conference on Software Engineering, March 1996.

.... that uses parameterized components to provide generic support for data structures and algorithms that manipulate them [9] Approaches that support reuse in specific software domains have also been developed that rely on using existing components in concert with parameterized components, e.g. [2, 5]. Like this work, our coordination abstractions provide a framework for concisely expressing a computation that can be configured through the use of user supplied parameters to satisfy a wide variety of application requirements. Much of this work focuses, however, on genericity of data and ....

M. Dwyer and L. Clarke. A flexible architecture for building data flow analyzers. In Proceedings of the 18th International Conference on Software Engineering, Mar. 1996.

No context found.

Matthew B. Dwyer and Lori A. Clarke. A flexible architecture for building data flow analyzers. In Proc. of the 18th Intl. Conf. on Software Engineering (ICSE), pages 554--564, Berlin, Germany, March 1996.

No context found.

Matthew B. Dwyer and Lori A. Clarke. A Flexible Architecture for Building Data Flow Analyzers. In 17th International Conference on Software Engineering, pages 554--564, Berlin, Germany, March 1998.

No context found.

Matthew Dwyer and Lori Clarke, "A Flexible Architecture for Building Data Flow Analyzers," Proceedings of the 18th International conference on Software Engineering, Berlin, Germany, pp. 554-564, March, 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