Partitioning by types [Ruf, POPL’97]

Approach: Given a data flow problem

• Conservatively estimate the dependencies between program quantities (dependencies are analysis specific computation)
• Schedule analysis of each quantity after the analysis of all other quantities upon which it depends
• Can estimate dependencies using type information (analysis specific)
  • declared by programmer
  • computed by type inference

Can handle non-separable problems

Previous slide

Next slide

Back to first slide

View graphic version