Concurrency Simple and Safe: The SCOOP Model

Speaker:  Bertrand Meyer – Zurich, Switzerland
Topic(s):  Human Computer Interaction , Artificial Intelligence, Machine Learning, Computer Vision, Natural language processing , Software Engineering and Programming , Computational Theory, Algorithms and Mathematics , Society and the Computing Profession , Applied Computing

Abstract

While multi-core processors have made concurrent programming essential, traditional threading models remain notoriously error-prone due to data races and deadlocks. This lecture presents SCOOP (Simple Concurrent Object-Oriented Programming), a model that integrates concurrency into the object-oriented framework by treating every object as being handled by an autonomous "processor." By introducing a single keyword, separate, the model forces the compiler to handle synchronization automatically, effectively eliminating data races by construction. The talk explores how SCOOP reinterprets classic Design by Contract (DbC) principles—treating preconditions as "wait conditions"—to provide a reasoning mechanism for concurrent systems that is as straightforward as for sequential ones.

About this Lecture

Number of Slides:  30
Duration:  minutes
Languages Available:  English, French, German, Italian, Russian
Last Updated:  27/02/2026

Request this Lecture

To request this particular lecture, please complete this online form.

Request a Tour

To request a tour with this speaker, please complete this online form.

All requests will be sent to ACM headquarters for review.