Verification, WS 04/05

Winter term 2004/4005

Lecturers: Bernd Finkbeiner, Andreas Podelski, Patrick Maier

Tutors: Thomas Wies, Eyad Alkassar, Ruzica Piskac

Hauptstudium: Stammvorlesung theoretische Informatik

Time and place

Introduction

The cause of the catastrophic crash of the Ariane 5 rocket in 1996 was traced to a simple problem in the computer software that calculated the rocket’s position. Despite rigorous testing of the software, the problem went unnoticed. Such software failures occur every day – though usually with less spectacular consequences.

How can one insure that computer programs actually do what they are intended to do? Simply running a program repeatedly with various inputs is inadequate, because one cannot tell which inputs might cause the program to fail. It is possible to tailor a tester to test a given program, but present-day programs are so complex that they cannot be adequately checked through conventional testing, which can leave significant bugs undetected.

Program verification uses mathematical and logical methods to prove that a program is correct. This approach was pioneered by, among others, Dijkstra, Floyd, Gries, Hoare, Lamport, Manna, Owicki and Pnueli. In the early years of verification research, the focus was on deductive proof systems. Back then, program verification was mostly done manually.

Today, we have powerful decision procedures that can, completely automatically, answer basic questions about the data types typically used by programmers. Model Checking is a “push-button” technology that can analyze finite-state abstractions of programs with as many as 1020 states. Verification research continues actively in both academia and industry (see conferences like CAV and TACAS, and verification projects by IBM, Microsoft, Bell Labs and many others).

This course takes an up-to-date look at the theory and practice of program verification.

News

Exams

We will have two written exams and an optional supplementary exam. You will need at least 50% of the total points of all exercise sheets in order to be allowed to participate in the final and supplementary exams.

The exams will take place on the following dates:

Supplementary exam

If you were admitted to participate in the final exam you are also allowed to take the supplementary. However, if you want to participate you must register until Friday, March 18.

You must bring the following items with you: Student card; passport or identity card; pen, stylus or pencil.

The exam will be a written exam and “open book”: You are allowed to bring with you any written material. Loose sheets must be marked by the owner’s name (As a rule of thumb, if you have never used a certain book for the tutorials, then it is unlikely to be useful to you during the exam.)

Electronic devices such as mobile phones, computers, PDAs, calculators, are not permitted.

Grading

The total grade for the lecture is the weighted average of all grades:

For passing, the weighted average must be better than 4.1. If you do not take part in the midterm or final exam without excuse you fail the corresponding exam with grade 5.0.

There is one exceptions to the above rules. If the weighted average is worse than 4.1, but you scored 4.0 or better in the supplementary exam, you pass the lecture with grade 4.0.

Certificates

Certificates for the lecture can be collected from our sectretary, Brigitta Hansen, room 602, building 46.1 (MPI).

Recommended Reading

SPIN

PVS