Concepts of Concurrent Computation

Sebastian Nanz, Chris Poskitt, Spring 2015



22.02.2015 — The paper assignment has been completed. Please see the paper assigned to you in the seminar schedule.

18.02.2015 — The project assignment has been posted.

26.11.2014 — the initial version of the course webpage is live. Curious about the project planned for this year? This video might give you a hint!

Course description

252-0268-00 Concepts of Concurrent Computation

Abstract: Concurrent programming is one of the major challenges in software development. The "Concepts of Concurrent Computation" course explores important models of concurrency, with a special emphasis on concurrent object-oriented programming and process calculi.

Objective: After completing this course, students will understand the principles and techniques of concurrent programming, supporting theories allowing formal reasoning about concurrent systems, and advances in concurrent object-oriented programming.


Grading: No Testat is delivered for the course. The assessment consists of a project (35%), a seminar talk (15%), and a written semester end exam (50%) for which no supporting material is allowed. The only way to get a grade is to take the written exam, deliver a seminar talk, and submit the project. This applies regardless of your department or status. The performance assessment is only offered at the end after the course unit. Repetition is only possible after re-enrolling.

Lecture layout: The course's lectures are of two different kinds: the Tuesday session is a traditional lecture; the Wednesday session is devoted to seminar talks by the student participants, based on research papers related to the topics of the course. The research papers to be presented will be assigned at the start of the course.

Helping and getting help

The course has a mailing list with all the registered students and assistants: If your e-mail address is missing, ask the assistants. In addition to the mailing list, we offer office hours on Friday from 14:00 to 16:00 in RZ J6. Please send a message at least 15 minutes in advance to either Mischael Schill or Chandrakana Nandi.


For the development of SCOOP programs, we will provide a virtual machine (the link will be provided within the project description). For the development of Java programs, you can use a Java development environment of your choice. For example, you can use NetBeans or Eclipse.


Further reading

Lecture and Seminar


Day Time Location
Tuesday (Lecture) 10:15-12:00 RZ F 21
Wednesday (Seminar) 15:15-17:00 RZ F 21



Date Lecture Title (Lecturer) Slides Readings
Tuesday 17.02.2015  1 Welcome and introduction (SN) Final version pdf
Tuesday 24.02.2015  2 Challenges of concurrency (SN) Final version pdf Chapter 2
Tuesday 03.03.2015  3 Synchronisation algorithms (CP) Final version pdf Chapter 3
Tuesday 10.03.2015  4 Semaphores (CP) Final version pdf Chapter 4
Tuesday 17.03.2015  5 Monitors (SN) Final version pdf Chapter 5
Tuesday 24.03.2015  6 SCOOP (SN) Final version pdf Chapter 9
Tuesday 31.03.2015  7 Lock-free approaches (CP) Final version pdf Herlihy & Shavit
(§10.5-6, 11.1-2, 18)
Tuesday 07.04.2015  no lecture Easter break
Tuesday 14.04.2015  8 Correctness conditions (CP) Final version pdf Herlihy & Shavit (Chapter 3)
Tuesday 21.04.2015  9 Petri nets (CP) Final version pdf Reisig, 2013 (Chapters 1-3)
Esparza & Heljanko, 2008 (Chapters 1-3)
Furia et al., 2012 (Chapter 8)
Tuesday 28.04.2015  10 CCS (SN) Final version pdf Chapter 7
Tuesday 05.05.2015  11 Bisimulations (SN) Final version pdf Chapter 7
Tuesday 12.05.2015  12 Coalgebra (G. Caltais) Final version pdf Jacobs & Rutten, 1997 (tutorial)
Silva et al., 2010 (paper)
Jacobs, 2012 (book)
Tuesday 19.05.2015  13 Languages for concurrency and parallelism (SN) Final version pdf
Tuesday 26.05.2015  Exam

Temporary version = Temporary version Final version = Final version


Date Presenter(s) Paper
Wednesday 11.03.2015 Ruben Wohlgenannt Paper 5 [Cai et al., ICSE'12] [slides]
Fabian Stutz Paper 4 [Cai et al., ICSE'14] [slides]
David Wellig Paper 12 [Eslamimehr et al., FSE'14] [slides]
Wednesday 18.03.2015 Seraiah Walter Paper 1 [Jiang et al., ICSE'14] [slides]
Thomas Müller Paper 25 [Pradel et al., ISSTA'14] [slides]
Wednesday 25.03.2015 Tijana Zivic Paper 30 [Jin et al., OSDI'12] [slides]
Wednesday 01.04.2015 Vytautas Astrauskas Paper 15 [Tasharofi et al., ASE'13] [slides]
Otto Bibartiu Paper 20 [Imam et al., OOPSLA'12] [slides]
Peter Pilgerstorfer Paper 29 [Reichenbach et al., ECOOP'12] [slides]
Wednesday 15.04.2015 Alexander Kogtenkov Paper 8 [Araujo et al., ICSE'11] [slides]
Marcin Dzieżyc Paper 13 [Farzan et al., FSE'12] [slides]
Hugo Sandelius Paper 27 [Luo et al., ISSTA'13] [slides]
Wednesday 22.04.2015 Thomas Betschart Paper 19 [Tripp et al., OOPSLA'13] [slides]
Álvaro Marco Añó Paper 3 [Liu et al., ICSE'14] [slides]
Severin Münger Paper 16 [Botincan et al., ASE'11] [slides]
Wednesday 29.04.2015 Benjamin Weber Paper 23 [Anderson et al., OOPSLA'11] [slides]
Wednesday 06.05.2015 Project Tournament (from 14:15)



Day Time Location
Wednesday (Exercise) 14:15-15:00 RZ F 21


Date Title Material
Wednesday 18.02.2015 Warm up assignment exercise solution Haiku
Wednesday 25.02.2015 Challenges of concurrency exercise promela code solution promela solution
Wednesday 04.03.2015 Synchronization algorithms exercise promela code solution code solutions
Wednesday 11.03.2015 Semaphores exercise solution code
Wednesday 18.03.2015 Monitors exercise solution
Wednesday 25.03.2015 SCOOP exercise solution
Wednesday 01.04.2015 Lock-free approaches exercise solution
Wednesday 15.04.2015 Correctness conditions exercise solution
Wednesday 22.04.2015 Petri nets exercise solution
Wednesday 29.04.2015 CCS exercise solution
Wednesday 06.05.2015 Project Tournament
Wednesday 13.05.2015 Bisimulations and Coalgebra exercise solution
Wednesday 20.05.2015 Questions, answers, and problem discussion session



The project has its own page now.