Program Analysis - Advanced Course WS 19/20

Lecturer	Eva Darulova Maria Christakis Daniel Neider
TA's	Rosa Abbasi, Michalis Kokologiannakis
Place	MPI-SWS building G 26, room 111
First lecture	Tuesday, 5 Nov 2019, 13:45
Exercises	Thursdays, 10:00 - 11:30
Office hours	On demand, send an email
Credits	6 CP
Can I audit?	Yes, email the instructor if you are interested

Topics

Program analysis can be used to find or to show the absence of certain kinds of bad program behaviours, e.g. division by zero, null-pointer access, etc., in general fully automatically. In this course, we will

introduce the theoretical foundation of many static analysis techniques (data flow analysis, abstract interpretation)
present the main types of dynamic techniques (fuzz testing, symbolic execution)
discuss the tradeoffs in efficiency, accuracy, and soundness between the different techniques
show applications of program analysis techniques in various application areas

Prerequisites

While there are no formal pre-requisites for the class, it is intended for advanced Bachelor or Master students. Previous classes on semantics, automated reasoning, verification or compiler construction are helpful, but not necessary.

Imprint Data Protection