Practical course in Model Checking


Schedule

There will be regular meetings every 2 -4 weeks to discuss the achievements made so far as well as to determine the next objectives. The meetings take place in the seminar room (room 4201b) of the chair.

Date

Topics

Slides

14.10.2010, 10:00

Introduction

28.10.2010, 12:00

Mutual Exclusion

11.11.2010, 12:00

Consensus Problem

25.11.2010, 12:00

13.01.2011, 12:00

 

 


News


Content

Model Checking is an automatic approach to program verification. In this practical course we will consider real world systems and specify their designated behavior. We then use the state of the art Model Checker Spin and its modelling language Promela to build a verification model of the system under consideration. Subsequently, Spin is used to check whether our model complies with the specification.

In this lab, we will start with some introductory examples of how to use Spin and its modelling language Promela. Then we will consider different distributed algorithms like

  • mutual exclusion algorithms,

  • leader election protocols and

  • routing protocols.

The aim is to model these algorithms in Promela and - dependent on the protocol under consideration - specify the important properties.


Prerequisites

This course is suitable for Hauptdiplom, bachelor, as well as master students. 

We expect students who have attended the lecture Model Checking, or Automata Theory lectures from Computer Science Chair 7.


Materials

Additional literature can be found in:

  • Christel Baier, Joost-Pieter Katoen: Principle of Model Checking, MIT Press, 2008
  • Holzmann, Gerard J.: The spin model checker, Addison-Wesley, 2004
  • Tel, Gerard: Introduction to distributed algorithms, 2nd edition, Cambridge UP, 2000
  • E.M. Clarke, O. Grumberg, D.A. Peled: Model Checking, MIT Press, 1999
  • http://www.spinroot.com


Contact

For questions please contact