Dynamic Data Flow Analysis

Tue, 2 Jun 1992 17:07:43 GMT

          From comp.compilers

Related articles
Dynamic Data Flow Analysis pkolte@cs.clemson.edu (1992-06-02)
Re: Dynamic Data Flow Analysis wip@z1wnsv.gmd.de (Willi Porten) (1992-06-03)
| List of all articles for this month |

Newsgroups: comp.compilers
From: pkolte@cs.clemson.edu
Keywords: optimize, question, analysis
Organization: Compilers Central
Date: Tue, 2 Jun 1992 17:07:43 GMT

Are there any papers (or other literature) describing or using Dynamic
Data Flow Analysis ?

The technique of dynamic data flow analysis is similar to the iterative
data flow analysis algorithm [ASU Dragon Book] except that instead of
iteratively applying the data flow equations to all the basic blocks (and
edges) in the control flow graph, the data flow equations are applied only
to the sequence of basic blocks (and edges) that appear in the program
execution trace for a particular execution.

There are some references to dynamic dataflow analysis, but they use
`dynamic' to mean `with array and pointer references resolved according to
a particular program execution' -- which seems similar but not identical.

We are using this technique in a software testing tool. Is anyone else
using it (for anything) ? Thanks.

-P. Kolte (pkolte@cs.clemson.edu)

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.