Control flow analysis

Known as: Uniform k-CFA, K-CFA, CFA 
In computer science, control flow analysis (CFA) is a static code analysis technique for determining the control flow of a program. The control flow… (More)
Wikipedia

Related topics

Related topics

14 relations
Abstract interpretationComputer scienceControl flowControl flow diagram
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Static Control-Flow Analysis of User-Driven Callbacks in Android Applications
Android software presents many challenges for static program analysis. In this work we focus on the fundamental problem of static… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Faster and More Focused Control-Flow Analysis for Business Process Models Through SESE Decomposition
We present a technique to enhance control-flow analysis of business process models. The technique considerably speeds up the… (More)
Is this relevant?
2007
2007
Control Flow Analysis for BioAmbients
This paper presents a static analysis for investigating properties of biological systems specified in BioAmbients. We exploit the… (More)
  • table 1
  • table 2
  • table 5
  • figure 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
On the Limit of Control Flow Analysis for Regression Test Selection
Automated analyses for regression test selection (RTS) attempt to determine if a modified program, when run on a test t, will… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis
Defining the collecting semantics is usually the first crucial step in adapting the general methodology of abstract… (More)
  • table 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Linear-time Subtransitive Control Flow Analysis
We present a linear-time algorithm for bounded-type programs that builds a directed graph whose transitive closure gives exactly… (More)
  • table 1
Is this relevant?
1995
1995
Control-Flow Analysis and Type Systems
We establish a series of equivalences between type systems and control-flow analyses. Specifically, we take four type systems… (More)
  • figure 1
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Control-flow analysis of higher-order languages
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
Control-Flow Analysis in Scheme
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
1970
Highly Cited
1970
Control flow analysis
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?