Design of Multiprograms: 2006-2007 (Winter)

Also see TU/e educational info for 2IS10.

A N N O U N C E M E N T S
18 Jan. 2007 Note the location for block D: Auditorium 10
15 Nov. 2006 Note the location for block C: Laplace Building -1.19 (basement)
15 Nov. 2006 Register for this course at wsinset@tue.nl

Lectures are given by Wim Feijen.

Coordination is done by Tom Verhoeff (Software Engineering & Technology).

Lectures are planned on Thursdays at 3rd and 4th hour in the Laplace Building LG -1.19.

COURSE DESCRIPTION

It will be shown, through a variety of examples, how multiprograms can be formally derived by just the predicate calculus and the simple theory of Owicki and Gries. The course will be very explicit about design principles, and on-the-fly a number of fundamental laws concerning parallelism will be addressed. The examples extend from simple mutual exclusion algorithms to far more sophisticated distributed algorithms and communication protocols.

PREREQUISITES

Prerequisites are: mastery of the predicate calculus, familiarity with Hoare-triples, love of mathematical elegance, and willingness to actively partake in the course.

COURSE MATERIAL

The book On a Method of Multiprogramming by W.H.J. Feijen and A.J.M. van Gasteren, Springer 1999, covers the course material.

REGISTRATION

Applicants for the course are requested to register by email at wsinset@tue.nl.

EXAMINATION

The examination is through two or three homework assignments and a final discussion about the subject matter.