Data-flow analysis

Known as: DFA, Flow analysis, Data-flow graph 
Data-flow analysis is a technique for gathering information about the possible set of values calculated at various points in a computer program. A… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Interestingly, data flow analysis theory and practice that you really wait for now is coming. It's significant to wait for the… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Programs written in powerful, higher-order languages like Scheme, ML, and Common Lisp should run as fast as their FORTRAN and C… (More)
  • figure 1.2
  • figure 2.1
  • figure 2.2
  • figure 3.1
  • figure 3.2
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Traditional flow analysis techniques, such as the ones typically employed by optimizing Fortran compilers, do not work for Scheme… (More)
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
1985
Highly Cited
1985
This paper defines a family of program test data selection criteria derived from data flow analysis techniques similar to those… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Until recently, information-flow analysis has been used primarily to verify that information transmission between program… (More)
  • figure 2
  • figure 5
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
1978
Highly Cited
1978
A new interprocedural data flow analysis algorithm is presented and analyzed. The algorithm associates with each procedure in a… (More)
Is this relevant?
Highly Cited
1977
Highly Cited
1977
We consider a generalization of Kildall's lattice theoretic approach to data flow analysis, which we call monotone data flow… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1976
Highly Cited
1976
The global data relationships in a program can be exposed and codified by the static analysis methods described in this paper. A… (More)
  • figure 2
  • table I
  • figure 5
  • figure 4
  • figure 7
Is this relevant?
Highly Cited
1976
Highly Cited
1976
Kildall has developed data propagation algorithms for code optimization in a general lattice theoretic framework. In another… (More)
  • figure 6
Is this relevant?
Highly Cited
1970
Highly Cited
1970
Any static, global analysis of the expression and data relationships in a program requires a knowledge of the control flow of the… (More)
  • figure I
  • figure 2
  • figure 4
  • figure 5
  • figure 7
Is this relevant?