| Recommended semester: 4th -7th semester |
| Scope and form: Lectures and assignments |
| Evaluation: Oral presentation and approval of reports
|
| Examination: 13-scale |
| Prerequisites: 02240 |
| Preferred prerequisites: compilertheory |
Aim: The aim of the course is to give an introduction to the analyses and
transformations that frequently are used in optimising compilers.
Program analysis offers static compile-time techniques for predicting
safe and computable approximations to the set of values or behaviours
arising dynamically at run-time when executing a program on a
computer. A classical application is to allow compilers to generate
code avoiding redundant computations, e.g. by reusing available
results or by moving loop invariant computations out of loops, or
avoiding superfluous computations, e.g. of results known to be not
needed or of results known already at compile-time. Among the more
recent applications is the validation of safety and security
properties of software systems. |
Contents: The course starts by giving a brief introduction to the main
approaches to program analysis and their applications. The focus is
on data flow and control flow analysis techniques and algorithms for
efficient implementation. |
| Contact: Hanne Riis Nielson, building 322, (+45) 4525 3736, riis@imm.dtu.dk |
| Department: 002 Informatics and Mathematical Modelling |
| Course URL: http://www.imm.dtu.dk/courses/02242 |
| Updated: 26-11-2001 |
