Abstract
In this chapter we complete the setting of our framework for interprocedural program optimization. We first introduce flow graph systems and interprocedural flow graphs as program representations, and subsequently, describe the interface connecting HO-DFA and IDFA. Central is then the extension of the two-step scheme of optimal intraprocedural program optimization to the interprocedural setting. It turns out that this scheme applies naturally to the interprocedural setting, too. One should note, however, that in contrast to the data flow analyses the transformations based thereon usually require additional care.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1998). The Interprocedural Setting. In: Optimal Interprocedural Program Optimization. Lecture Notes in Computer Science, vol 1428. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49639-4_7
Download citation
DOI: https://doi.org/10.1007/3-540-49639-4_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65123-9
Online ISBN: 978-3-540-49639-7
eBook Packages: Springer Book Archive