Course Tutorials Exams Lecture Notes Problem Sets


People: Bernd Finkbeiner, Klaus Dräger, Andrey Kupriyanov, Michael Gerke
Lecture Room: HS 002 Building E 1 3
Lecture Time: Tuesdays and Thursdays 14:15-15:55
Tutorials: Room 014 Building E 1 3, Wednesdays 16:15-17:45

HS IV Math building E 2 4, Fridays 12:15-13:45
Office Hours: Bernd Finkbeiner: Wednesdays 15:00-16:00 E 1 3 / 506

Klaus Dräger & Andrey Kupriyanov E 1 3 / 508

Michael Gerke E 1 3 / 507



How can one ensure 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. 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. This course takes an up-to-date look at the theory and practice of program verification.

Main Textbooks

Recommended Reading