Mas­ter-Vor­le­sung: De­si­gning code ana­ly­ses for lar­ge-sca­le soft­ware sys­tems (DE­CA 1)

Cour­se num­ber and lan­gua­ge


The teaching language will be English. Questions in German will be permitted.

Re­gis­te­ring and com­mu­ni­ca­ting

To attend the course, you have to register in the PAUL system as a participant.

To ask questions, please use the discussion forum in PANDA, so that others can benefit from the answers as well.

If needed, we will also send updates through PANDA circulars.


This schedule gives a rough indication of which topics will be covered when.

The following course schedules are non-binding and may change at any time and without prior announcement.

Lecture schedule

Date Lecture topic Lecturer
11.10. Introduction and course outline Bodden
18.10. Type systems and flow-insensitive, constraint-based analysis Bodden
25.10. Lattices and fixed points Bodden
08.11. Intra-procedural flow-sensitive static code analysis Bodden
15.11. Interval analysis, widening and narrowing Prasad
22.11. Call-graph construction Bodden
29.11. Pointer Analysis Mory
06.12. Inter-procedural program analysis Bodden
13.12. Call-strings approach to context-sensitive analysis Bodden
20.12. Functional approach to context-sensitive analysis Bodden
10.01. Distributive analyses using IFDS Bodden
17.01. Distributive analyses using IDE Bodden
24.01. VASCO Schlichtig
31.01. Recap & guest lecture regarding code analysis in practice Bodden & Krüger


Exercise / Lab schedule

Date Lecture topic Teaching Assistants
16.10. Introduction to exercises and labs Prasad
23.10. Jimple and control-flow graph Schlichtig
06.11. Lattices and design decisions Prasad
13.11. Intra-procedural analysis and monotone framework Schlichtig
20.11. Constant Analysis Schlichtig
27.11. Call-graph construction Prasad
04.12 Points-to analysis Schlichtig
11.12. Field & access paths Schlichtig
18.12. Call-strings approach to context-sensitive analysis Karakaya
08.01. Precision & scalability Prasad
15.01. Distributive analyses using IFDS Schlichtig
22.01. Distributive analyses using IDE Schlichtig
29.01. VASCO Schlichtig


Lab assignments

Lab Hand out date Due date
L0 Introduction to the labs 13.11. -
L1 Intra-procedural typestate analysis 27.11. 11.12.
L2 Call-graph algorithms and pointer analysis 11.12. 29.12.
L3 Inter-procedural and field-sensitive taint analysis 08.01. 24.01.
L4 Linear Constant Propagation Using IDE 22.01. 31.01.



Static code analysis is used to detect bugs and security breaches, and aids compiler optimization. By searching for suspicious/interesting patterns in a program’s code it allows to extract useful information that can be used in a variety of applications. This course will explain how to design static code analyses that are inter-procedural, i.e., consider the whole program, across procedure boundaries. Designing such analyses is challenging, as they need to handle millions of program statements efficiently and precisely. Example applications are drawn from the area of IT security. 

DE­CA 1 and 2

Since 2020/21, we started offering DECA in two parts, DECA 1 and 2. This winter term, DECA will amount to "DECA 1", covering basic, introductory topics. At the end of this course you will be able to design and implement full-fledged static program analyses, albeit using rather state-of-the art concepts.

If you also attend "DECA 2" in the summer term, you will be taught quite novel, advanced concepts out of cutting-edge research such as weighted pushdown systems and demand-driven program analyses. After having attended this course, you will be one of a select few worldwide that master these exciting technologies. If you wish to attend "DECA 2", we strongly recommend to complete "DECA 1" first.

Cour­se struc­ture

Each week, two hours will be dedicated to the lecture, and two hours will be dedicated to concrete exercise classes and graded programming labs.

In the exercise sessions, you will be able to apply the notions seen during the lecture into more concrete topics, preparing you to present your knowledge (with respect to the final exam).

The goal of the programming labs is to allow you to create concrete program analyses, solving open problems on the current topic, and deepening your knowledge and understanding of the notions seen in the lecture and exercise sessions. The lab assignments will mostly be done at home, using the scheduled lab hours to answer questions on the ongoing lab.

If you have questions to the organisation of the course, the topic, the exercises, or the labs, or if you get stuck when solving the exercises or labs, please use the forum in PANDA. We try to answer on a regular basis and as soon as possible.


Graded labs:

  • During the semester, you will have to hand in four graded labs.
  • Each lab has to be handed in through PANDA on its due date by 08:00 am. The dates can be found here.
  • The labs will be done in groups of four.
  • Late labs will not be accepted.
  • Plagiarism will result on a 0 grade for the lab and will be reported to the department. It can result in severe consequences such as financial fine and expulsion from the university.

Final exam:

At the end of the course, you will have the opportunity to register for the written exam based on your lab grade:

  • If you scored below 50%, you cannot register to the exam.
  • If you scored 50% or more, you can register to the exam.
  • If you scored 70% or more, you will receive a bonus of 0.3 on your final grade.
  • If you scored 90% or more, you will receive a bonus of 0.7 on your final grade.

The exam will be in a written format, except for students under the old Prüfungsordnung who will need to register for an oral exam.


A mature understanding of the Java programming language and object-oriented programming will be helpful.


Topics covered include:

  • Intra-procedural data-flow analysis
  • Call-graph construction algorithms
  • Context-insensitive inter-procedural data-flow analysis
  • Context-sensitivity using the call-strings approach
  • Value-based contexts
  • Context-sensitivity using the functional approach
  • Efficiently solving distributed problems in the IFDS and IDE frameworks
  • Current challenges in inter-procedural static program analysis

Throughout the course and the exercice sessions, we will discuss applications to software security.

Lear­ning out­co­mes

After having attended this course, students will have learned…

  • how to make educated design decisions when designing automated code analysis for large-scale software systems,
  • which algorithms have which properties when using them to implement static code-analyses,
  • how to design real–world code analyses for practical problem cases from the area of IT security
  • how to interpret important terminology such as context, flow, field and object sensitivity
  • how to evaluate and explain the important limitations of static code analysis
  • which typical security code analyses exist (OWASP Top 10 etc.) and how they relate to the analysis frameworks explained in the course.

Recommended reading material

We will not be able to provide a script for this course. We will provide powerpoint slides where available, but will develop some concepts also on the blackboard. Students are highly encouraged to take their own copies during their lecture.

A lot of the material is also covered in the following books and papers, however, those publications present the material in a more complex manner than in the lectures, which is why they should mostly be used for deeper personal study.