On interprocedural data flow analysis for object oriented languages
As object oriented languages ease software construction significantly, these languages are very promising candidates for parallelizing compilers. To combine the advantages of object oriented programming with the power of parallel processing two major problems have to be solved: the virtual function and the class scope problem. We present solutions to these problems and exemplify them by extending a fast interprocedural data flow analysis algorithm.
KeywordsObject oriented language interprocedural data flow analysis virtual function class scope
- 1.Keith. D. Cooper, Ken Kennedy: “Interprocedural Side-Effect Analysis in Linear Time”; Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, Atlanta, Georgia, June 22–24, 1988Google Scholar
- 2.Jürgen Ebert: “Effiziente Graphenalgorithmen”; Studientexte, Akademische Verlagsgesellschaft, 1981Google Scholar
- 3.Laurie J. Hendren, Alecandru Nicolau: “Parallelizing Programs with Recursive Data Structures”, in: IEEE Transactions on Parallel and Distributed Systems, Vol. 1, No. 1, January 1990Google Scholar
- 4.Paul Havlak, Ken Kennedy: “An Implementation of Interprocedural Bounded Regular Section Analysis”, in: IEEE Transactions on Parallel and Distributed Systems, Vol. 2, No. 3, July 1991Google Scholar