A program data flow analysis procedure

Allen, Frances E.; Cocke, John

doi:10.1145/360018.360025

Cited by 320 publications

(116 citation statements)

References 14 publications

Supporting

Mentioning

116

Contrasting

Order By: Relevance

“…The corresponding numeric ratios are presented in Table 5. 6. Overall, the average for each kind is similar in single analysis scope, being around 25% in functions and 15% in concept bindings.…”

Section: Key Statement Sizementioning

confidence: 83%

See 1 more Smart Citation

Identifying high-level dependence structures using slice-based dependence analysis

2009

2009 IEEE International Conference on Software Maintenance

View full text Add to dashboard Cite

This thesis addresses dependence based concept assignment using slicing based dependence analysis on concept assignment.Concepts are domain level entities concerned with the real world. Although concepts are defined at the domain level, the source code of a program must, nonetheless, express these concepts in program code denotations. Traditional concept assignment maps the low level of source code to the high level of the domain through the medium of associations. These associations typically take the form of comments and identifiers.Previous work on the combination of dependence analysis with concept assignment gave the definition of either extending concepts to concept slices or abbreviating concepts to key statements. However, there are no empirical studies to show the feasibility of these two approaches.In this thesis, we propose an improved key statement analysis algorithm and empirically study executable concept slicing and key statement analysis using ten subject programs with more than 600 concept bindings identified. We define dependence based metrics to evaluate both approaches and to provide evidence of both advantages and disadvantages. Based on these foundations, we propose a new combination technique -concept refinement, which adopts the advantages and overcome the disadvantages of previous two approaches.The results for the same programs with the same concept bindings showed that concept refinement can produce dependence based concept bindings. The refined concept binding is smaller, but with similar impact and higher cohesion than the original HB-CA concept binding. Therefore, it becomes more precise after refinement; the refined concept binding is much smaller than the executable concept slice with respect to the original HB-CA concept binding. These findings suggest that the refined concept binding is more reasonable in size for program comprehension.Furthermore, the refined concept binding can be extracted from most of the original HB-CA concept bindings, thus concept refinement is more appropriate than the key statement analysis. DeclarationThe work presented in this thesis is original work undertaken between September

show abstract

Section: Key Statement Sizementioning

confidence: 83%

“…It is also used to perform data flow analysis, e.g. reaching definitions or use-def chaining, in the program [6,7]. …”

Section: Plan Driven Algorithmic Program Understanders or Recognisersmentioning

confidence: 99%

Identifying high-level dependence structures using slice-based dependence analysis

2009

2009 IEEE International Conference on Software Maintenance

View full text Add to dashboard Cite

show abstract

“…used as an optimization technique for data flow analysis [2,3,5]. However, the use of intervals does provide a representation that satisfies the abovementioned conditions for loops: one loop per interval, and a nesting order provided by the derived sequence of graphs.…”

mentioning

confidence: 99%

Structuring decompiled graphs

Cifuentes

1996

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.A structuring algorithm for arbitrary control flow graphs is presented. Graphs are structured into functional, semantical and structural equivalent graphs, without code replication or introduction of new variables. The algorithm makes use of a set of generic high-level language structures that includes different types of loops and conditionals. Gotos are used only when the graph cannot be structured with the structures in the generic set. This algorithm is adequate for the control flow analysis required when decompiling programs, given that a pure binary program does not contain information on the high-level structures used by the initial high-level language program (i.e. before compilation). The algorithm has been implemented as part of the dcc decompiler, an i80286 decompiler of DOS binary programs, and has proved successful in its aim of structuring decompiled graphs.

show abstract

“…Algebraic elimination methods [1,9,6,21] consist of three steps: (1) reducing the flowgraph to a single node, (2) eliminating variables in the data flow equations by substitution, and (3) back-propagating the solution to other nodes. Algebraic elimination methods require two algebraic operations for a set of equations: substitution and loopbreaking.…”

Section: Introductionmentioning

confidence: 99%

A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees

Scholz

Blieberger

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n 2 ) andÕ(m). The algorithms use a new compact data structure for representing reducible flow graphs called Annotated Decomposition Trees. This data structure extends a binary tree to represent flowgraph information, dominance relation of flowgraphs, and the topological order of nodes. The construction of the annotated decomposition trees runs in O(n + m). Experiments were conducted with reducible flowgraphs of the SPEC2000 benchmark suite.

show abstract

A program data flow analysis procedure

Cited by 320 publications

References 14 publications

Identifying high-level dependence structures using slice-based dependence analysis

Identifying high-level dependence structures using slice-based dependence analysis

Structuring decompiled graphs

A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees

Contact Info

Product

Resources

About