Issue No. 01 - January (1981 vol. 7)

ISSN: 0098-5589

pp: 60-78

L.H. Holley , IBM Cambridge Scientific Center

ABSTRACT

It is known that not aU paths are possible in the run time control flow of many programs. It is also known that data flow analysis cannot restrict attention to exactly those paths that are possible. It is, therefore, usual for analytic methods to consider aU paths. Sharper information can be obtained by considering a recursive set of paths that is large enough to include aUl possible paths, but smaU enough to exclude many of the impossible ones. This paper presents a simple uniform methodology for sharpening data flow information by considering certain recursive path sets of practical importance. Associated with each control flow arc there is a relation on a finite set Q. The paths that qualify to be considered are (essentially) those for which the composition of the relations encountered is nonempty. For example, Q might be the set of all assignments of values to each of several bit variables used by a program to remember some facts about the past and branch accordingly in the future. Given any data-flow problem together with qualifying relations on Q associated with the control flow arcs, we construct a new problem. Considering all paths in the new problem is equivalent to considering only qualifying paths in the old one. Preliminary experiments (with a smaUl set of real programs) indicate that qualified analysis is feasible and substantialy more informative than ordinary analysis.

INDEX TERMS

symbolic execution, Data flow analysis, global variable, interprocedural analysis, label variable

CITATION

L.H. Holley, B.K. Rosen, "Qualified Data Flow Problems",

*IEEE Transactions on Software Engineering*, vol. 7, no. , pp. 60-78, January 1981, doi:10.1109/TSE.1981.234509