Zusammenfassung
In diesem Abschnitt wollen wir einige grundlegende Techniken kennen lernen, mit denen die Qualität des Codes, den der Übersetzer erzeugt, verbessert werden kann. Das Qualitätsmaß ist hierbei nicht a priori festgelegt. In diesem Buch werden wir vor allem daran interessiert sein, die Ausführungszeit des Programms zu verbessern.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literaturverzeichnis
Paul Anderson, David Binkley, Genevieve Rosay, Tim Teitelbaum. Flow insensitive points-to sets. Information & Software Technology, 44(13):743–754, 2002.
Patrick Cousot, Radhia Cousot. Static Determination of Dynamic Properties of Programs. In 2nd Int. Symp. on Programming, pp. 106–130. Dunod, Paris, France, 1976.
Patrick Cousot, Radhia Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In 4th ACM Symp. on Principles of Programming Languages (POPL), pp. 238–252, 1977.
Patrick Cousot, Nicolas Halbwachs. Automatic Discovery of Linear Restraints among Variables of a Program. In 5th ACM Symp. on Principles of Programming Languages (POPL), pp. 84–97, 1978.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clif Stein. Introduction to Algorithms (Third Edition). MIT Press, 2009.
Manuel Fähndrich, Jakob Rehof, Manuvir Das. Scalable Context-sensitive Flow Analysis Using Instantiation Constraints. SIGPLAN Not., 35(5):253–263, 2000.
Robert Giegerich, Ulrich Möncke, Reinhard Wilhelm. Invariance of Approximate Semantics with Respect to Program Transformations. In GI Jahrestagung, pp. 1–10, 1981.
Philippe Granger. Static Analysis of Linear Congruence Equalities among Variables of a Program. In Int. Joint Conf. on Theory and Practice of Software Development (TAPSOFT), pp. 169–192. LNCS 493, Springer, 1991.
Thomas Gawlitza, Helmut Seidl. Precise Fixpoint Computation Through Strategy Iteration. In European Symposium on Programming (ESOP), pp. 300–315. LNCS 4421, Springer, 2007.
Michael Karr. Affine Relationships Among Variables of a Program. Acta Informatica, 6:133–151, 1976.
Gary A. Kildall. A Unified Approach to Global Program Optimization. In ACM Symp. on Principles of Programming Languages (POPL), pp. 194–206, 1973.
Jens Knoop. Optimal Interprocedural Program Optimization, A New Framework and Its Application. LNCS 1428, Springer, 1998.
Jens Knoop, Oliver Rüthing, Bernhard Steffen. Optimal Code Motion: Theory and Practice. ACM Trans. Program. Lang. Syst., 16(4):1117–1155, 1994.
Jens Knoop, Oliver Rüthing, Bernhard Steffen. Partial Dead Code Elimination. In ACM Conf. on Programming Languages Design and Implementation (PLDI), pp. 147–158, 1994.
John B. Kam, Jeffrey D. Ullman. Global Data Flow Analysis and Iterative Algorithms . Journal of the ACM, 23(1):158–171, 1976.
John B. Kam, Jeffrey D. Ullman. Monotone Data Flow Analysis Frameworks . Acta Inf., 7:305–317, 1977.
Donglin Liang, Maikel Pennings, Mary Jean Harrold. Extending and Evaluating Flow-insensitive and Context-insensitive Points-to Analyses for Java. In ACM SIGPLAN-SIGSOFT Workshop on Program Analysis For Software Tools and Engineering (PASTE), pp. 73–79, 2001.
Markus Müller-Olm, Helmut Seidl. Precise Interprocedural Analysis through Linear Algebra. In 31st ACM Symp. on Principles of Programming Languages (POPL), pp. 330–341, 2004.
Markus Müller-Olm, Helmut Seidl. A Generic Framework for Interprocedural Analysis of Numerical Properties. In Static Analysis, 12th Int. Symp. (SAS), pp. 235–250. LNCS 3672, Springer, 2005.
Markus Müller-Olm, Helmut Seidl. Analysis of Modular Arithmetic. ACM Trans. Program. Lang. Syst., 29(5), 2007.
G. Ramalingam. On Loops, Dominators, and Dominance Frontiers. ACM Trans. Program. Lang. Syst. (TOPLAS), 24(5):455–490, 2002.
Axel Simon. Value-Range Analysis of C Programs: Towards Proving the Absence of Buffer Overflow Vulnerabilities. Springer Verlag, 2008.
Mooly Sagiv, Thomas W. Reps, Reinhard Wilhelm. Parametric Shape Analysis via 3-Valued Logic. In 26th ACM Symp. on Principles of Programming Languages (POPL), pp. 105–118, 1999.
Mooly Sagiv, Thomas W. Reps, Reinhard Wilhelm. Parametric Shape Analysis via 3-Valued Logic. ACM Trans. Program. Lang. Syst. (TOPLAS), 24(3):217–298, 2002.
Bjarne Steensgaard. Points-to Analysis in Almost Linear Time. In 23rd ACM Symp. on Principles of Programming Languages (POPL), pp. 32–41, 1996.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Seidl, H., Wilhelm, R., Hack, S. (2010). Grundlagen und intraprozedurale Optimierung. In: Übersetzerbau. eXamen.press. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03331-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-03331-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03329-2
Online ISBN: 978-3-642-03331-5
eBook Packages: Life Science and Basic Disciplines (German Language)