|Dynamic Data Flow Analysis firstname.lastname@example.org (1992-06-02)|
|Re: Dynamic Data Flow Analysis email@example.com (Willi Porten) (1992-06-03)|
|Keywords:||optimize, question, analysis|
|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 (firstname.lastname@example.org)
Return to the
Search the comp.compilers archives again.