A data-flow analysis method

Presented in this thesis is a method by which one can determine for a given program graph (1) what data definitions reach each node in the graph, (2) what data items have an upward exposed use at each node, and (3) what data definitions are "live" on each edge in the graph. The method is developed based on the topological sorting of edges and the acyclic image of a program graph. It is conceptually simple and easy to implement.