ETH Zuerich - Homepage
Information Security

Formal Methods and Functional Programming

Master in Information Security

For more information about the Information Security Master Track visit:

Bachelor Course 252-0058-00L, Spring Semester 2011



Lecturers: Prof. Dr. David Basin and Prof. Dr. Peter Müller

Classes: Tue 10-12 in HG F 3, Thu 10-12 in HG F 7


Exercises (updated for second half of the course):

Please attend the same session as in the first half of the course (the rooms and times are unchanged). If you want to switch session/group (for language reasons), please email Alex Summers

Solutions can be submitted in two ways: you can either send them by email to the assistant assigned to you or submit them on paper in the appropriate box outside room RZ F1. Solutions must be received by 9:15 on the Monday after the exercise is
published, in order to receive feedback.

Credits: 7

Homework is optional, but highly recommended. There will be a midterm and an end-of-semester final exam. The grade in the course will be determined by averaging the points from both exams.

Requirements: none

Language: English


In this course, participants will learn about new ways of specifying, reasoning about, and developing programs and computer systems. Our objective is to help students raise their level of abstraction in modeling and implementing systems.

The first part of the course will focus on designing and reasoning about functional programs. Functional programs are mathematical expressions that are evaluated and reasoned about much like ordinary mathematical functions. As a result, these expressions are simple to analyze and compose to implement large-scale programs. We will cover the mathematical foundations of functional programming, the lambda calculus, as well as higher-order programming, typing, and proofs of correctness.

The second part of the course will focus on deductive and algorithmic validation of programs modeled as transition systems. As an example of deductive verification, students will learn how to formalize the semantics of imperative programming languages and how to use a formal semantics to prove properties of languages and programs. As an example of algorithmic validation, the course will introduce model checking and apply it to programs and program designs.


Literature for the first part:

Literature for the second part:

Additional literature for interested students:

Course Material: here


Wichtiger Hinweis:
Diese Website wird in älteren Versionen von Netscape ohne graphische Elemente dargestellt. Die Funktionalität der Website ist aber trotzdem gewährleistet. Wenn Sie diese Website regelmässig benutzen, empfehlen wir Ihnen, auf Ihrem Computer einen aktuellen Browser zu installieren. Weitere Informationen finden Sie auf
folgender Seite.

Important Note:
The content in this site is accessible to any browser or Internet device, however, some graphics will display correctly only in the newer versions of Netscape. To get the most out of our site we suggest you upgrade to a newer browser.
More information

© 2011 ETH Zurich | Imprint | Disclaimer | 19 July 2011