Helmut Seidl and Bernhard Steffen. Constraint-Based Inter-Procedural Analysis of Parallel Programs. Nord. J. Comput., 7(4):375-, 2000.
We provide a uniform framework for the analysis of programs with procedures and explicit, unbounded, fork/join parallelism covering not only bitvector problems like reaching definitions or live variables but also non-bitvector problems like simple constant propagation. Due to their structural similarity to the sequential case, the resulting algorithms are as efficient as their widely accepted sequential counterparts, and they can easily be integrated in existing program analysis environments like e.g. MetaFrame or PAG. We are therefore convinced that our method will soon find its way into industrial-scale computer systems.
Download: PDF Reference: Bibtex