SA

• Course front page
• Staff
• Students
• Login

Static Analysis

Q3 2009, 5 ECTS

The course presents principles and applications of static analysis of programs, and instills in the participants the following competences:

• to describe static analysis as a technique for computing conservative approximations of solutions for undecidable problems
• to refer the basic terminology and the mathematical foundations for static analysis
• to apply the monotone framework to construct algorithms for simple static analyses
• to describe advanced techniques for increasing the precision of static analysis and to relate the interplay between these

The course covers type analysis, lattice theory, control flow graphs, dataflow analysis, fixed-point algorithms, narrowing and widening, interprocedural analysis, control flow analysis, pointer analysis, and context and path sensitivity.

Lecturer

Michael Schwartzbach <mis@cs.au.dk>

Prerequisites

The participants are assumed to be familiar with advanced programming language concepts and the basics of compiler construction.

Time and Place

Wednesday 9:15-12:00 in Shannon-157.

Material

All course material will be available on-line. The lectures are mainly based on the following:

Lecture Notes on Static Analysis
TIP implementation (JavaDoc).

Assignments

Students must hand in solutions to a couple of assignments every week. Hand-ins from groups of sizes 2 or 3 are allowed.

Exam

The course concludes with a 2-hour written exam (7-scale) based on the material in the lecture note.

Course Plan