L. Howard Holley and Barry k. Rosen. Qualified data flow problems. IEEE Transactions on Software Engineering, 7(1), January 1981.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....it holds. Analyses related to the predicate to value solution have previously been developed in limited forms for specific data flow problems [47, 116] and related general frameworks have been proposed from a theoretical view [29, 89, 90] and from a more practical but limited standpoint [61]. This chapter discusses the following components of our predicated data flow anal ysis solution: Formulation of analysis. Our formulation derives both predicate to value map pings and the value to predicate mappings. We demonstrate that the introduc tion of the value to predicate solution ....

....optimizations and software engineering tools. Framework. We provide a framework for predicated data flow analysis that can be used to systematically produce a predicated solution for any bounded monotone data flow problem [80] We address a number of practical issues not considered by other work [29, 61]. Of particular practical importance is our selection of scoped predicates. Other practical issues include normalization of predicates and a sparse formulation of the solution. Example and Implementation. We demonstrate how to apply this framework to live variable analysis, which we have ....

[Article contains additional citation context not shown here]

L. H. Holley and B. K. Rosen. Qualified data flow problems. IEEE Transactions on Software Engineering, SE-7(1), January 1981.

....we present later in this paper could potentially be applied to the distilled code in the master thread. Our algorithm for reducing the critical forwarding path builds upon previous dataflow approaches to code motion, namely partial redundancy elimination [18] path sensitive dataflow analysis [16], and hot paths [2] Previous work on speculative code motion to exploit a frequently executed path includes trace scheduling [10] and superblock scheduling [5] There has also been work on aggressive load store reordering where the runtime check and recovery are performed entirely in software ....

HOLLEY, L. H., AND K. ROSEN, B. Qualified data flow problems. IEEE Transactions on Software Engineering 7, 1 (Jan. 1981).

....An alternate approach is to include information in the data flow problem that is used to restrict consideration of certain program paths. This has been done for individual data flow analyses, e.g. 80] A more general method, and one that we employ, is to use qualified data flow analysis [38]. We refer to the data flow problem of interest as the primary problem. We formulate necessary conditions for path executability and encode those conditions as constraint data flow problems. A qualified problem is a combination of a primary and a set of constraint data flow problems. ....

Holley, L.H. and Rosen, B.K. Qualified data flow problems. IEEE Transactions on Software Engineering, SE-7(1):60--78, January 1981.

....Optimization Frameworks A few path sensitive value flow optimizations developed to date are either highly specific or amorphous enough to escape the three stage classification (representation analysis transformation) Consequently, we present them as frameworks. Holley and Rosen [HR81] were first to recognize the benefit of maintaining program assertions that are specific to individual execution paths during the analysis. In their qualified data flow framework, control flow paths on which a variable has different constants are separated through (virtual) code duplication. Path ....

....presents an extension of the Holley Rosen approach. In his property oriented expansion framework, path separation is driven not only based on constants of variables but also on particular assignments being or not being previously computed on a path. This allows elimination of branches (as in [HR81] as well as of entire assignments. Steffen also observes that some code duplication may be unnecessary and re merges back unnecessarily split paths using finite state automaton minimization. Ammons and Larus [AL98] extend Holley s and Rosen s qualified analysis by separating the paths not on ....

L. Howard Holley and Barry K. Rosen. Qualified data flow problems. IEEE Transactions on Software Engineering, 7(1):60--78, January 1981.

....computation is guaranteed by use of general iterative solution algorithms [Hec77] We use a bounded monotone framework in the analysis at the core of FLAVERS and describe this algorithm in Section 6. FLAVERS uses an approach that combines multiple flow analyses into a single analysis [CC95, HR81, WZ91] Combining multiple dependent flow analyses into a single flow analysis offers the potential to improve the precision of analysis results, for example, by eliminating some infeasible paths. In some cases the combined problem is actually less costly to execute than the constituent problems. ....

....of analysis results, for example, by eliminating some infeasible paths. In some cases the combined problem is actually less costly to execute than the constituent problems. Our combined analysis, based on finite state automata, provide a simple approach to constructing qualified flow analyses [HR81] that has been effective in practice. Flow analysis techniques for validation were originally applied to detect potential anomalies in sequential code in the Dave system [FO76] This approach used a fixed set of flow analyses formulated to detect a fixed set of anomalies. The Cecil Cesar system ....

[Article contains additional citation context not shown here]

L.H. Holley and B.K. Rosen. Qualified data flow problems. IEEE Transactions on Software Engineering, SE-7(1):60--78, January 1981.

No context found.

L.H. Holley and B.K. Rosen. Qualified data flow problems. IEEE Transactions on Software Engineering, SE-7(1):60--78, January 1981.

No context found.

L.H. Holley and B.K. Rosen. Qualified data flow problems. IEEE Transactions on Software Engineering, SE-7(1):60--78, January 1981.

....Optimization Frameworks A few path sensitive value flow optimizations developed to date are either highly specific or amorphous enough to escape the three stage classification (representation analysis transformation) Consequently, we present them as frameworks. Holley and Rosen [HR81] were first to recognize the benefit of maintaining program assertions that are specific to individual execution paths during the analysis. In their qualified data flow framework, control flow paths on which a variable has different constants are separated through (virtual) code duplication. Path ....

....presents an extension of the Holley Rosen approach. In his property oriented expansion framework, path separation is driven not only based on constants of variables but also on particular assignments being or not being previously computed on a path. This allows elimination of branches (as in [HR81] as well as of entire assignments. Steffen also observes that some code duplication may be unnecessary and re merges back unnecessarily split paths using finite state automaton minimization. Ammons and Larus [AL98] extend Holley s and Rosen s qualified analysis by separating the paths not on ....

L. Howard Holley and Barry K. Rosen. Qualified data flow problems. IEEE Transactions on Software Engineering, 7(1):60--78, January 1981. 152

....An alternate approach is to include information in the data flow problem that is used to restrict consideration of certain program paths. This has been done for individual data flow analyses, e.g. WZ91] A more general method, and one that we employ, is to use qualified data flow analysis [HR81] We refer to the data flow problem of interest as the primary problem. We then formulate necessary conditions for path executability and encode those conditions as constraint data flow problems. A qualified 8 problem is a combination of a primary and a set of constraint data flow problems. ....

L. Howard Holley and Barry K. Rosen. Qualified data flow problems. IEEE Transactions on Software Engineering, SE-7(1):60--78, January 1981.

....An alternate approach is to include information in the data flow problem that is used to restrict consideration of certain program paths. This has been done for individual data flow analyses, e.g. 22] A more general method, and one that we employ, is to use qualified data flow analysis [16]. We refer to the data flow problem of interest as the primary problem. We then formulate necessary conditions for path executability and encode those conditions as constraint data flow problems. A qualified problem is a combination of a primary and a set of constraint data flow problems. ....

L. Howard Holley and Barry K. Rosen. Qualified data flow problems. IEEE Transactions on Software Engineering, SE-7(1):60--78, January 1981.

....execution time penalty is incurred in the process. In addition, we demonstrate that the tuple based version is better suited for proving multiple properties simultaneously. The technique of improving precision of data flow analyses by identifying spurious executions has been explored before [5, 1]. Holley and Rosen [5] also provide a comparison of several implementations of this technique. The contribution of this paper is in the quantitative evaluation of the two versions of the FLAVERS approach for verifying application specific properties of concurrent programs. In the next section of ....

....is incurred in the process. In addition, we demonstrate that the tuple based version is better suited for proving multiple properties simultaneously. The technique of improving precision of data flow analyses by identifying spurious executions has been explored before [5, 1] Holley and Rosen [5] also provide a comparison of several implementations of this technique. The contribution of this paper is in the quantitative evaluation of the two versions of the FLAVERS approach for verifying application specific properties of concurrent programs. In the next section of this paper we present a ....

[Article contains additional citation context not shown here]

L. H. Holley and B. K. Rosen. Qualified data flow problems. IEEE Transactions on Software Engineering, SE-7(1):60--78, January 1981.

No context found.

L. Howard Holley and Barry k. Rosen. Qualified data flow problems. IEEE Transactions on Software Engineering, 7(1), January 1981.

No context found.

L.H.Holley and B.K.Rosen. Qualied Data-Flow Problems. IEEE Transactions on Software Engineering,SE- 7(1):60-78, January 1981.

No context found.

L.H.Holley and B.K.Rosen. Qualified Data-Flow Problems. IEEE Transactions on Software Engineering,SE- 7(1):60-78, January 1981.

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