Machine-translated by Google. Questions are authored in English.
Top

Discussion

The meet over all paths solution to a data flow problem is

  • A.an approximation that is rather weaker than the iterative solution
  • B.the ideal answer, which the iterative solution may only approximate
  • C.always exactly what the iterative algorithm computes
  • D.computed by enumerating every path through the flow graph

Answer: B

Correct answer: the ideal answer, which the iterative solution may only approximate

The meet-over-all-paths solution takes the meet of the facts along every path reaching a point, which is what one would ideally like to know. The iterative algorithm computes the maximum fixed point instead, and the two coincide when the transfer functions distribute over the meet - which they do for many, but not all, analyses.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.