Data Flow Analysis (DFA for short) is a basic technique to collect statical information on run-time behaviors of programs: it is essential in optimizing compilers and is also used in type inference problems [1]. When performing a DFA, the program to be analysed is modeled by its Control Flow Graph (CFG) and by a set of transformation functions, one for each node in the graph. The set of program...

Data Flow Analysis (DFA for short) is a basic technique to collect statical information on run-time behaviors of programs: it is essential in optimizing compilers and is also used in type inference problems [1]. When performing a DFA, the program to be analyzed is modeled by its Control Flow Graph (CFG) and by a set of transformation functions, one for each node in the graph. The set of program...

We categorize and compare diierent representations of program dependence graphs, including the Control Flow Graph (CFG) which is a sequential representation lacking data dependences, the Program Dependence Graph (PDG) which is a parallel representation of a sequential program and is comprised of control and data dependences, and more generally, the Parallel Program Graph (PPG) which is a parall...

This paper addresses the issue of recovering a both safe and precise approximation of the Control Flow Graph (CFG) of an unstructured program, typically an executable file. The problem is tackled in an original way, with a refinement-based static analysis working over finite sets of constant values. Requirement propagation allows the analysis to automatically adjust the domain precision only wh...

Security analysis often requires understanding both the control and data-flow structure of a binary. We introduce a new program representation, a hybrid informationand control-flow graph (HI-CFG), and give algorithms to infer it from an instruction-level trace. As an application, we consider the task of generalizing an attack against a program whose inputs undergo complex transformations before...

Static analysis requires the full knowledge of the overall program structure. The structure of a program can be represented by a Control Flow Graph (cfg) where vertices are basic blocks (bb) and edges represent the control flow between the bb. To construct a full cfg, all the bb as well as all of their possible targets addresses must be found. In this paper, we present a method to resolve dynam...

In order to avoid being static analyzed, hacker rely on various obfuscation techniques to hide its malicious characters. These techniques are very effective against common disassembles, preventing binary file from being disassembled correctly. The study presents novel disassemble algorithm which based on analyzed Control Flow Graph (CFG) and Data Flow Graph (DFG) information improve the ability...

Validation of VHDL descriptions at the early phases of the microelectronic design is one of the most time consuming task design. This paper presents a test vector generation method for behavioral VHDL design. This method analyzes control and dependence flow of VHDL program. We use the cyclomatic complexity, that is a software metric based on a graph associated with the control part of software:...

The Factored Control Flow Graph, FCFG, is a novel representation of a program's intraprocedural control ow, which is designed to eeciently support the analysis of programs written in languages, such as Java, that have frequently occurring operations whose execution may result in exceptional control ow. The FCFG is more compact than traditional CFG representations for exceptional control ow, yet...

In this paper a unique methodology based on the execution scenario analysis of the COTS component based software application has been formulated to help the developers and integrators to regain some control over their COTS component based software application systems by predicting the upper and lower bound on the reliability of their application systems. At the component level the CFG (control ...