Startseite > Fachgruppen > Softwaretechnik > Lehre > Vorlesungsarchiv > Designing code analyses for large-scale software systems (DECA) SS2016

Designing code analyses for large-scale software systems (DECA) SS2016

Course number and language

L.079.05804

Signing up for oral exam

In case you have already earned the required 50% of points in the exercises, you may now start signing up for an examination slot for your oral exam. This website here tells you the kind of information we require:

https://cs.uni-paderborn.de/en/studies/formalities/examination-dates/registering-for-examinations/

Please send the appropriate appointment request to: Jutta Haupt <jutta@uni-paderborn.de>

Note: In the Computer Science Master you can choose to be examined within two modules, Modellbasierte Softwareentwicklung and Analytische Methoden des Software Engineering. If you choose the first option, Modellbasierte Softwareentwicklung, this will make it easier for us to find an appointment slot, because in this module we can arrange oral exams with a single professor at a time. Hence, for us that would be the preferred option.

So far we have reserved examination slots on the following days: 

  • Thu Aug 4th
  • Fri Aug 5th
  • Thu Aug 18th
  • Mon Aug 29th
  • Tue Aug 30th

We would prefer if any of those days would work for you.

 

 

Course material

The slides and exercise sheets will be uploaded before each lecture on the course's KoaLA page.

Time and place

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

Lectures:

Wed 09:00-11:00 at F0.530

A preliminary schedule is available here.

Exercise classes:

Wed 11:00-12:00 at F2.211
Wed 12:00-13:00 at F2.211

Registering and asking questions

To attend the course, you have to register in the PAUL system as a participant. To ask questions, please use the discussion forum in KOALA, so that others can benefit from the answers as well.

Abstract

Static code analysis has the goal of finding programming mistakes automatically, by searching for suspicious anti-patterns in a program’s code. 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. 

Prerequisites

The course Software Analysis is a recommended but not required prerequisite. A mature understanding of the Java programming languages and object-oriented programming will be helpful.

Syllabus

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, we will discuss applications to software security.

Learning outcomes

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.

Assignments

Every second week, during the exercise class, we will be releasing an exercise sheet covering the topics of the current lecture. The main aim of the exercise sheets is to deepen your knowledge and your understanding of the topic. You need to achieve at least 50% of all points to be admitted to the oral exam. You have to hand in your solutions in groups of three students at the beginning of the exercice session two weeks after the sheet is released.

The weekly exercise classes (see above) serve the following purposes: Solving open problems on the current topic, deepen your knowledge and understanding and preparing you to present your knowledge (with respect to the final oral exam). 

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

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.