Abstract
This paper reports on constructing an exhaustive full program control flow framework for precise data flow analysis of real programs. We discuss the problem of ambiguous calling relations in the presence of function pointers. A flow insensitive analysis is suggested and implemented for real C programs.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D. Callahan. The program summary graph and flow-sensitive interprocedural data flow analysis. In SIGPLAN Conf. on Prog. Lang. Design and Imple. June 1988.
M. Emami and et al. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In Proceedings of the Conference on Programming Language Design and Implementation, pages 242–256, New York, NY, USA, June 1994. ACM Press.
M. W. Hall and et al. Fiat: A framework for interprocedural analysis and transformation. In Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science, pages 522–545, Portland, Oregon, August 12–14, 1993. Springer-Verlag.
Mary W. Hall and Ken Kennedy. Efficient call graph analysis. ACM Letters on Programming Languages and Systems, 1(3):227–242, September 1992.
Mary Jean Harrold and Mary Lou Soffa. Efficient computation of interprocedural definition-use chains. ACM Transactions on Programming Languages and Systems, 16(2):175–204, March 1994.
E. Myers. A precise interprocedural data flow algorithm. In Conference Record of the Eighth annual ACM Symposium on Principles of Programming Languages, pages 219–230. ACM, ACM, January 1981.
B. Steensgaard. Points-to analysis by type inference of programs with structures and unions. Lecture Notes in Computer Science, 1060:136-??, 1996.
William E. Weihl. Interprocedural data flow analysis in the presence of pointers, procedure variables and label variables. In Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, pages 83–94, Las Vegas, Nevada, January 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, H., Watson, I. (1997). A full program control flow representation for real programs. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds) Euro-Par'97 Parallel Processing. Euro-Par 1997. Lecture Notes in Computer Science, vol 1300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0002729
Download citation
DOI: https://doi.org/10.1007/BFb0002729
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63440-9
Online ISBN: 978-3-540-69549-3
eBook Packages: Springer Book Archive