Lehrstuhl Informatik II   
Sprachen und Beschreibungsstrukturen      
   Home Lehre Wintersemester 17/18 Vorlesungen Program Optimization login

Program Optimization

Dozent:Prof. Dr. Helmut Seidl
Ort/Zeit:Lecture: Mon. 12:15-13:45, Wed. 10:00-11:30, Exercises: Thu. 10:00-12:00, 00.13.009A
Beschreibung:    This course is about standard techniques used to optimize general purpose programming languages. How to avoid redundant computation, replace expensive computations with cheaper ones, and/or exploit hardware.


The lecture is meant for students doing Master studies who are interested in compiler technology. 

Programs which we write should be both efficient and easily to maintain. In particular, maintainability means that programs should be well-structured and easily understandable also by humans. Being well-structured and easily readable, though, may often come at the price oft a degradation in efficiency at run-time.

For this reason, most compilers offer an optimization phase in which the source program is analyzed and where various transformations are applied to automatically improve efficiency. In some cases, it may happen that the attempt for improvement overshoots the target and results in programs which are perhaps fast but are no longer equivalent to the original program.

In the lecture, we give an overview over standard techniques for improving the quality of the generated code. In particular, we are interested in methods which guarantee that the resulting code still is equivalent to the source program.

The topics covered:

** Intra-procedural analysis and optimizations

** Abstract Interpretation and Interval Analysis

** Interprocedural optimizations

** Exploitation of hardware features such as registers, pipelines, caches, specific instructions

** Optimization of functional languages

** Optimization of Prolog




If you have any questions regarding organization or content of the exercises, please contact Eugen Zalinescu (eugen.zalinescu@in.tum.de).

# Date Keywords Sheet Solutions
1 19.10.2017 Simple imperative language, CFGs, state 01.pdf  01sol.pdf


TUM - Lehrstuhl Informatik II (Sprachen und Beschreibungsstrukturen) Thanks: Tango and TinyMCE     Generationszeit: 8 ms