Control dependence forms the basis for many program analyses, such as program slicing. Recent work on control dependence analysis has led to new definitions of dependence that can cater for reactive programs with their necessarily non–terminating computations. One important such definition is the definition of Weak Order Dependence, which was introduced to generalize classical control dependenc...

Dictating program control-flow transfers to be within a reference control-flow graph (CFG) can make a sound software protection. Control flow confinement (CFC) is to ensure the program execution to follow the reference of a control flow graph (CFG) obtained via profiled execution traces with various input data sets. CFC allows only the tested and expected control flows in program execution. Thi...

Unresolved indirect branch instructions are a major obstacle for statically reconstructing a control flow graph (CFG) from machine code. If static analysis cannot compute a precise set of possible targets for a branch, the necessary conservative over-approximation introduces a large amount of spurious edges, leading to even more imprecision and a degenerate CFG. In this paper, we propose to lev...

After surveying existing tools, we have decided to work on existing compiler backend ‘opt’, which obtained from Dr. Mueller. Originally it works for Sparc ISA. It has the functionalities of constructing control flow graph (CFG) and detecting loops from CFG. Also the program is scalable to add or remove existing analysis and optimization paths. We modified ‘opt’ so that it only enables CFG const...

We contrast abstract ow of control in a sequential program environment which uses a control ow graph (CFG) to the abstraction of execution order within DAG parallelism using a simple precedence graph (PG). We note that often the analogous concepts are duals of each other with regard to universal and existential quantiiers. We are studying sparse data-ow analysis techniques, which include method...

Control Flow Graph (CFG) is a compact representation of all executable paths of a program and it is central to most program analyses. Unfortunately, the direct use of a CFG has two major sources of imprecision: (a) the existence of infeasible paths, and (b) the merging of states along incoming edges of a control-flow merge. Addressing these two problems is the path-sensitivity issue, and it is ...

As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences of instructions. The usual way to do this is a top-down approach: the executable’s information about routines is used to split the sequence into routines, and then, each instruction is analysed for branch targets in ord...

Several approaches to reverse and re-engineering are based upon program slicing. Unfortunately, for large systems, such as those which typically form the subject of reverse engineering activities, the space and time requirements of slicing can be a barrier to successful application. Faced with this problem, several authors have found it helpful to merge Control Flow Graph (CFG) nodes, thereby i...

The number of Android apps have grown explosively in recent years and the number of apps leaking private data have also grown. It is necessary to make sure all the apps are not leaking private data before putting them to the app markets and thereby a privacy leaks detection tool is needed. We propose a static taint analysis approach which leverages the control-flow graph (CFG) of apps to detect...

Program analysis tools typically work on a representation of code as a control-flow graph (CFG), which is a graph-based representation of the flow of control through the program. It connects simple instructions in a way that statically captures all possible execution paths through the program and defines the execution order of instructions in the program. When control could flow in more than on...