Interprocedural heap analysis for parallelizing imperative programs

The parallelization of imperative programs working on pointer data structures is possible by using extensive heap analysis. Therefore, we consider a new interprocedural version of the heap analysis algorithm with summary nodes from Chase, Wegman and Zadeck (1990). Our analysis handles arbitrary call graph inclusive recursion, works on a realistic low-level intermediate language, and uses a modified propagation method to correct an inaccuracy of the original algorithm. Furthermore, we discuss how loops and recursions over heap data structures can be parallelized based on the analysis information.<>