Optimal Interprocedural Program Optimization: A New Framework and Its Application

✍ Scribed by Jens Knoop (auth.)

Publisher: Springer-Verlag Berlin Heidelberg
Year: 1998
Tongue: English
Leaves: 298
Series: Lecture Notes in Computer Science 1428
Edition: 1
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

Starting from the intraprocedural basic case, this monograph focuses on interprocedural optimization. It emphasizes the analogies and essential differences between intraprocedural and interprocedural optimization, and offers cookbook style support for constructing the underlying algorithms. It is aimed at compiler constructors and researchers interested in the systematic transfer of intraprocedural optimizations to the interprocedural setting, as well as students seeking a gentle introduction to the field.

✦ Table of Contents

Preface....Pages 1-12
The Intraprocedural Framework....Pages 15-29
Optimal Intraprocedural Code Motion: The Transformations....Pages 31-48
Optimal Intraprocedural Code Motion: The DFA-Algorithms....Pages 49-67
The Programming Language....Pages 71-77
Higher Order Data Flow Analysis....Pages 79-97
The Interprocedural Setting....Pages 99-108
Interprocedural Abstract Interpretation....Pages 109-140
A Cookbook for Optimal Interprocedural Program Optimization....Pages 141-144
Optimal Interprocedural Code Motion: The Transformations....Pages 147-207
Optimal Interprocedural Code Motion: The IDFA-Algorithms....Pages 209-248
Perspectives....Pages 251-270

✦ Subjects

Logics and Meanings of Programs; Programming Languages, Compilers, Interpreters; Software Engineering

📜 SIMILAR VOLUMES

Optimal Interprocedural Program Optimiza

📁 Optimal Interprocedural Program Optimization: A New Framework and Its Application

✍ Jens Knoop (auth.) 📂 Library 📅 1998 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

<p>Starting from the intraprocedural basic case, this monograph focuses on interprocedural optimization. It emphasizes the analogies and essential differences between intraprocedural and interprocedural optimization, and offers cookbook style support for constructing the underlying algorithms. It is

Optimal Interprocedural Program Optimiza

📁 Optimal Interprocedural Program Optimization: A New Framework and Its Application (Lecture Notes in Computer Science, 1428)

✍ Jens Knoop 📂 Library 📅 1999 🏛 Springer 🌐 English

<span>Starting from the intraprocedural basic case, this monograph focuses on interprocedural optimization. It emphasizes the analogies and essential differences between intraprocedural and interprocedural optimization, and offers cookbook style support for constructing the underlying algorithms. It

Optimization Theory and Methods: Nonline

📁 Optimization Theory and Methods: Nonlinear Programming (Springer Optimization and Its Applications)

✍ Wenyu Sun Ya-xiang Yuan 📂 Library 📅 2006 🌐 English

Optimization Theory and Methods can be used as a textbook for an optimization course for graduates and senior undergraduates. It is the result of the authors teaching and research over the past decade. It describes optimization theory and several powerful methods. For most methods, the book discusse

Optimal Transport and Applications to Ge

📁 Optimal Transport and Applications to Geometric Optics

✍ Cristian E. Gutiérrez 📂 Library 📅 2023 🏛 Springer Nature Singapore 🌐 English

This book concerns the theory of optimal transport (OT) and its applications to solving problems in geometric optics. It is a self-contained presentation including a detailed analysis of the Monge problem, the Monge-Kantorovich problem, the transshipment problem, and the network flow problem. A chap

Optimal Quadratic Programming Algorithms

📁 Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities (Springer Optimization and Its Applications)

✍ Zdenek Dostal 📂 Library 📅 2009 🌐 English

Quadratic programming (QP) is one advanced mathematical technique that allows for the optimization of a quadratic function in several variables in the presence of linear constraints. This book presents recently developed algorithms for solving large QP problems and focuses on algorithms which are, i

Dynamic Programming and Its Application

📁 Dynamic Programming and Its Application to Optimal Control

✍ R. Boudarel, J. Delmas and P. Guichet (Eds.) 📂 Library 📅 1971 🏛 Academic Press New York. 🌐 English