AbstractTo improve the accuracy of invariants found when analyzing a transition system, we introduce an original rewriting heuristic of control flow graphs, based on a control node splitting algorithm. The transformation preserves the program behaviors, whilst allowing a finer analysis.We have carried out experiments with PIPS, a source-to-source compiler, and Aspic, an abstract interpretation tool, using 71 test cases published by Gonnord, Gulwani, Halbwachs, Jeannet & al. The number of invariants found by these tools goes up from 28 to 69 for PIPS and from 44 to 62 for Aspic when our heuristics is used as a preprocessing step. The total execution time of PIPS is only marginally increased, going up from 76 to 103s, thus showing the practic...
In this paper we present an intermediate program representation, called the program dependence graph...
Embedded system applications can have quite complex control flow graphs (CFGs). Often their control ...
Many compilation problems require computing the control dependence equivalence relation which divide...
International audienceTo improve the accuracy of invariants found when analyzing a transition system...
To exploit instruction level parallelism in programs over multiple basic blocks, programs should hav...
Many static analyses aim at assigning to each control point of a program an invariant property that ...
CppInv works in two stages. Firstly, it parses a source code written in a subset of C++ and abstrac...
Abstract. We present a novel technique for reconstructing control flow graphs from linear process al...
. This paper describes a general purpose program analysis that computes global control-flow and data...
The history of programming is filled with works about the properties of program flow graphs. There a...
. A structuring algorithm for arbitrary control flow graphs is presented. Graphs are structured into...
Abstract—Control flow graphs are a well-known representation of the sequential control flow structur...
This paper addresses the question of how to handle irreducible regions during optimization, which ha...
Abstract. Loop identification is an essential step of control flow analysis in decompilation. The Cl...
Compiler optimizations need precise and scalable analyses to discover program properties. We propose...
In this paper we present an intermediate program representation, called the program dependence graph...
Embedded system applications can have quite complex control flow graphs (CFGs). Often their control ...
Many compilation problems require computing the control dependence equivalence relation which divide...
International audienceTo improve the accuracy of invariants found when analyzing a transition system...
To exploit instruction level parallelism in programs over multiple basic blocks, programs should hav...
Many static analyses aim at assigning to each control point of a program an invariant property that ...
CppInv works in two stages. Firstly, it parses a source code written in a subset of C++ and abstrac...
Abstract. We present a novel technique for reconstructing control flow graphs from linear process al...
. This paper describes a general purpose program analysis that computes global control-flow and data...
The history of programming is filled with works about the properties of program flow graphs. There a...
. A structuring algorithm for arbitrary control flow graphs is presented. Graphs are structured into...
Abstract—Control flow graphs are a well-known representation of the sequential control flow structur...
This paper addresses the question of how to handle irreducible regions during optimization, which ha...
Abstract. Loop identification is an essential step of control flow analysis in decompilation. The Cl...
Compiler optimizations need precise and scalable analyses to discover program properties. We propose...
In this paper we present an intermediate program representation, called the program dependence graph...
Embedded system applications can have quite complex control flow graphs (CFGs). Often their control ...
Many compilation problems require computing the control dependence equivalence relation which divide...