Semantics and Verification of Software

News

  • 2017-10-26: Due to a public holiday there will be no exercise class on November 1st. The deadline for the second exercise sheet has been extended accordingly to November 8th.
  • 2017-09-15: we are online!

Schedule

Type Day Time Hall Start Lecturer
Lecture Tue 10:15 – 11:45 9U10 10 Oct Noll
  Thu 10:15 – 11:45 AH 6 12 Oct Noll
Exercise Wed 12:00 – 13:30 AH 3 25 Oct Kaminski/Matheja

Contents

The analysis and verification of software systems is an important issue. In particular, safety-critical systems are ones in which errors can be disastrous: loss of life, major financial losses, etc. Techniques to safeguard against such scenarios are essential for such systems. Testing can identify problems, especially if done in a rigorous fashion, but is generally not sufficient to guarantee a satisfactory level of quality. Formal methods, on the other hand, offer techniques ranging from the description of requirements in a formal notation to allow for rigorous reasoning about them, to techniques for automatic verification of software.
 
The goal of this course is to provide an introduction to the field of formal semantics for programming languages, with particular emphasis on software verification. The following topics will be covered:
  1. The imperative model language WHILE
  2. Operational semantics of WHILE
  3. Denotational semantics of WHILE
  4. Equivalence of operational and denotational semantics
  5. Axiomatic semantics of WHILE
  6. Compiler correctness
  7. Extensions: procedures, parallelism, …

Prerequisites

Basic knowledge of the following relevant undergraduate courses is expected:
  • Programming (essential concepts of imperative and object-oriented programming languages and elementary programming techniques)
  • Formal Languages and Automata Theory (regular and context-free languages, finite and pushdown automata)
  • Mathematical Logic

Slides & Exercises

No. Date Subject Slides Handout Exercises Solutions
1 10 Oct Introduction l1 l1    
2 12 Oct Operational Semantics of WHILE I (Evaluation of Expressions) l2 l2    
3 19 Oct Operational Semantics of WHILE II (Execution of Statements) l3 l3 ex-01   
4 24 Oct Operational Semantics of WHILE III (Summary & Application to Compiler Correctness) l4  l4    
5 26 Oct Operational Semantics of WHILE IV (The Compiler & Its Correctness)  l5 l5 ex-02   
6 07 Nov Denotational Semantics of WHILE I (The Approach)  l6 l6 ex-03  
7 14 Nov Denotational Semantics of WHILE II (Fixpoint Theory)  l7 l7    
8 16 Nov Denotational Semantics of WHILE III (Fixpoint & Coincidence Theorem)  l8  l8 ex-04   
9 21 Nov          
10 23 Nov          
11 28 Nov          
12 30 Nov          
13 05 Dec          
14 07 Dec          
15 12 Dec          
16 14 Dec          
17 19 Dec          
18 21 Dec          
19 09 Jan          
20 11 Jan          
21 16 Jan          
22 18 Jan          

Exam

  • There will be an oral exam. Possible dates will be announced later.
  • Registration is possible via this web page.
  • Admission requires to achieve 50% of the points in the exercises.

Further information

  • The lectures will be given in German or English, depending on the language proficiency of the audience.
  • The slides and other course material will be in English. There are no lecture notes (yet); the course material will consist of slides.

Background Literature