Abstract
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.
Chapter PDF
Similar content being viewed by others
References
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, 1988
Jürgen Ebert: “Effiziente Graphenalgorithmen”; Studientexte, Akademische Verlagsgesellschaft, 1981
Laurie J. Hendren, Alecandru Nicolau: “Parallelizing Programs with Recursive Data Structures”, in: IEEE Transactions on Parallel and Distributed Systems, Vol. 1, No. 1, January 1990
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 1991
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Südholt, M., Steigner, C. (1992). On interprocedural data flow analysis for object oriented languages. In: Kastens, U., Pfahler, P. (eds) Compiler Construction. CC 1992. Lecture Notes in Computer Science, vol 641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55984-1_15
Download citation
DOI: https://doi.org/10.1007/3-540-55984-1_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55984-9
Online ISBN: 978-3-540-47335-0
eBook Packages: Springer Book Archive