Results 11  20
of
328,360
Dataflow analysis for MPI programs
 in Proceedings of the International Conference on Parallel Processing
"... Message passing via MPI is widely used in singleprogram, multipledata (SPMD) parallel programs. Dataflow analysis frameworks that respect the semantics of messagepassing SPMD programs are needed to obtain more accurate and in some cases correct analysis results for such programs. We qualitativel ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
Message passing via MPI is widely used in singleprogram, multipledata (SPMD) parallel programs. Dataflow analysis frameworks that respect the semantics of messagepassing SPMD programs are needed to obtain more accurate and in some cases correct analysis results for such programs. We
Deferred DataFlow Analysis
, 1998
"... Loss of precision due to the conservative nature of compiletime dataflow analysis is a general problem and impacts a wide variety of optimizations. We propose a limited form of runtime dataflow analysis, called deferred dataflow analysis (DDFA), which attempts to improve precision by performing mos ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Loss of precision due to the conservative nature of compiletime dataflow analysis is a general problem and impacts a wide variety of optimizations. We propose a limited form of runtime dataflow analysis, called deferred dataflow analysis (DDFA), which attempts to improve precision by performing
Complexity Of Bidirectional Data Flow Analysis
 In Conf. Record of the 20 th ACM Symposium on the Principles of Programming Languages
, 1993
"... The concept of an information flow path arising from the generalized theory of data flow analysis [21] is used to analyze the complexity of data flow analysis. The width (w) of a program flow graph with respect to a class of data flow problems is introduced as a measure of the complexity of roundro ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
The concept of an information flow path arising from the generalized theory of data flow analysis [21] is used to analyze the complexity of data flow analysis. The width (w) of a program flow graph with respect to a class of data flow problems is introduced as a measure of the complexity of round
Data Flow Analysis of Parallel Programs
, 1995
"... Data flow analysis is the prerequisite of performing optimizations such as code motion of partial redundant expressions on imperative sequential programs. To apply these transformations to parallel imperative programs, the notion of data flow must be extended to concurrent programs. The additional ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Data flow analysis is the prerequisite of performing optimizations such as code motion of partial redundant expressions on imperative sequential programs. To apply these transformations to parallel imperative programs, the notion of data flow must be extended to concurrent programs. The additional
Acceleration in Convex DataFlow Analysis
 FSTTCS, NEW DELHI: INDE
, 2007
"... In abstract interpretationbased dataflow analysis, widening operators are usually used in order to speed up the iterative computation of the minimum fixpoint solution (MFP). However, the use of widenings may lead to loss of precision in the analysis. Acceleration is an alternative to widening th ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In abstract interpretationbased dataflow analysis, widening operators are usually used in order to speed up the iterative computation of the minimum fixpoint solution (MFP). However, the use of widenings may lead to loss of precision in the analysis. Acceleration is an alternative to widening
Improving Dataflow Analysis with Path Profiles
, 1998
"... Dataflow analysis computes its solutions over the paths in a controlflow graph. These pathswhether feasible or infeasible, heavily or rarely executedcontribute equally to a solution. However, programs execute only a small fraction of their potential paths and, moreover, programs' execut ..."
Abstract

Cited by 87 (2 self)
 Add to MetaCart
Dataflow analysis computes its solutions over the paths in a controlflow graph. These pathswhether feasible or infeasible, heavily or rarely executedcontribute equally to a solution. However, programs execute only a small fraction of their potential paths and, moreover, programs
Data Flow Analysis of Recursive Structures
, 1996
"... . Most imperative languages only offer arrays as "firstclass" data structures. Other data structures, especially recursive data structures such as trees, have to be manipulated using explicit control of memory, i.e., through pointers to explicitly allocated portions of memory. We believe ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
that this severe limitation is mainly due to historical reasons, and this paper will try and demonstrate that modern analysis techniques, such as data flow analysis, allow to cope with the compilation problems associated with recursive data structures. As a matter of fact, recursion in the flow of control also
Iterative dataflow analysis, revisited
, 2004
"... ABSTRACT The iterative algorithm is widely used to solve instances of dataflow analysis problems. The algorithm is attractive because it is easy to implement and robust in its behavior. The theory behind the algorithm shows that, for a broad class of problems, it terminates and produces correct res ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
ABSTRACT The iterative algorithm is widely used to solve instances of dataflow analysis problems. The algorithm is attractive because it is easy to implement and robust in its behavior. The theory behind the algorithm shows that, for a broad class of problems, it terminates and produces correct
Elimination algorithms for data flow analysis
 ACM Computing Surveys
, 1986
"... A unified model of a family of data flow algorithms, called elimination methods, is presented. The algorithms, which gather information about the definition and use of data in a program or a set of programs, are characterized by the manner in which they solve the systems of equations that describe d ..."
Abstract

Cited by 59 (8 self)
 Add to MetaCart
A unified model of a family of data flow algorithms, called elimination methods, is presented. The algorithms, which gather information about the definition and use of data in a program or a set of programs, are characterized by the manner in which they solve the systems of equations that describe
On Probabilistic Techniques for Data Flow Analysis
"... We present a semanticsbased technique for analysing probabilistic properties of imperative programs. This consists in a probabilistic version of classical data flow analysis. We apply this technique to pWhile programs, i.e programs written in a probabilistic version of a simple While language. As a ..."
Abstract
 Add to MetaCart
We present a semanticsbased technique for analysing probabilistic properties of imperative programs. This consists in a probabilistic version of classical data flow analysis. We apply this technique to pWhile programs, i.e programs written in a probabilistic version of a simple While language
Results 11  20
of
328,360