Automatic parallelization of recursive programs is still an open
  problem today, lacking suitable and precise static analyses. We
  present a novel reaching definition framework
  based on context-free transductions. The technique achieves a global
  and precise description of the data flow and discovers important
  semantic properties of programs. Taking the example of a real-world
  non-derecursivable program, we show the need for a reaching
  definition analysis able to handle run-time instances of statements
  separately. A running example sketches our parallelization scheme,
  and presents our reaching definition analysis. Future fruitful
  research, at the crossroad of program analysis and formal language
  theory, is also hinted to.

<p><hr>

The author's web site:
<a href="http://www.prism.uvsq.fr/~acohen">www.prism.uvsq.fr/~acohen</a>