Abstract
Symbolic Evaluation is a technique aimed at determining dynamic properties of programs. We extend our intraprocedural data-flow framework introduced in [3] to support interprocedural symbolic evaluation. Our data-flow framework utilizes a novel approach based on an array algebra to handle aliases induced by procedure calls. It serves as as a basis for static program analysis (e.g. reaching definitions-, alias analysis, worst-case performance estimations, cache analysis). Examples for reaching definitions- as well as alias analysis are presented.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, R. Seti, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, MA, 1986.
J. Blieberger. Data-flow Frameworks for Worst-Case Execution Time Analysis. (submitted), 1997.
J. Blieberger and B. Burgstaller. Symbolic Reaching Definitions Analysis of Ada Programs. Proceedings of the Ada-Europe International Conference on Reliable Software Technologies, 238–250, June 1998.
J. Blieberger, T. Fahringer, and B. Scholz. An Accurate Cache Prediction for C-Programs with Symbolic Evaluation. (submitted), 1999.
T. E. Cheatham, G. H. Holloway, and J. A. Townley. Symbolic Evaluation and the Analysis of Programs. IEEE Trans. on Software Engineering, 5(4):403–417, July 1979.
J. D. Choi, M. Burke, and P. Carini. Efficient Flow-Sensitive Interprocedural Computation of Pointer-Induced Aliases and Side Effects. ACM PoPL, 1/93:232–245, 1993.
M. Haghighat, C. Polychronopoulos. Symbolic Analysis for Parallelizing Compilers. ACM Trans. Prog. Lang. Sys., 18(4):477–518, July 1996.
ISO/IEC 8652. Ada Reference manual, 1995.
W. Landi, and B. G. Ryder. Pointer-induced Aliasing: A Problem Classification. Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, 235–248, 1992
G. Ramalingam. The Undecidability of Aliasing. ACM Trans. Prog. Lang. Sys., 16(5):1467–1471, 1994.
V. C. Sreedhar. Effcient Program Analysis Using DJ Graphs. PhD thesis, School of Computer Science, McGill University, Montréal, Québec, Canada, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Ve lag Berlin Heidelberg
About this paper
Cite this paper
Blieberger, J., Burgstaller, B., Scholz, B. (1999). Interprocedural Symbolic Evaluation of Ada Programs with Aliases. In: González Harbour, M., de la Puente, J.A. (eds) Reliable Software Technologies — Ada-Europe’ 99. Ada-Europe 1999. Lecture Notes in Computer Science, vol 1622. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48753-0_12
Download citation
DOI: https://doi.org/10.1007/3-540-48753-0_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66093-4
Online ISBN: 978-3-540-48753-1
eBook Packages: Springer Book Archive