Introduction to methods for proving the correctness of sequential, parallel, and distributed programs.

Professional competence
The students:

• Describe operational semantics of sequential, parallel, and distributed programs
• Know the concepts of partial and total correctness of programs
• Establish soundness and completeness of proof systems
• Construct input-output specifications of programs
• Conduct correctness proofs for programs of different classes with the help of proof rules
• Check interference and deadlock freedom of parallel programs
• Transform parallel and distributed programs into nondeterministic programs

Methodological competence
The students:

• Recognize correctness as an important aspect of programs and informatics systems

Social competence
The students:

• Work together in small groups to solve problems
• Present their solutions to groups of other students

Self-competence
The students:

• Learn persistence in pursuing difficult tasks
• Learn precision in specifying problems         

Program verification is a systematic approach to show the absence of errors in programs. For this purpose desirable behavioural properties of a given program are proven. For instance, a sorting program should only deliver sorted arrays.

Partial correctness, termination, and the absence of runtime errors are essential for sequential programs. Additional behavioural properties are of interest for parallel programs: absence of interference, absence of deadlocks, and fair behaviour.

The module focuses on the verification of parallel programs. For this purpose classic methods of Hoare's logic are combined with more recent techniques of program transformation. Sequential programs are covered in preparation for this.

essential:
"K.R. Apt, E.-R. Olderog, Programmverifikation, Springer-Verlag, 1994''

Or the extended English version:
"K.R. Apt, F.S. de Boer, E.-R. Olderog, Verfication of Sequential and Concurrent

At the end of the lecture period

Written exam or oral exam