SCOOP Archives - Bertrand Meyer's technology+ blog

Detecting deadlock automatically? (New paper)

21 January 2015 by Bertrand Meyer

To verify sequential programs, we have to prove that they do the right thing, but also that they do it within our lifetime — that they terminate. The termination problem is considerably harder with concurrent programs, since they add a new form of non-termination: deadlock. A set of concurrent processes or threads will deadlock if … Read more

Concurrency video

17 April 201428 August 2013 by Bertrand Meyer

Our Concurrency Made Easy project, the result of an ERC Advanced Investigator Grant, is trying to solve the problem of making concurrent programming simple, reliable and effective. It has spurred related efforts, in particular the Roboscoop project applying concurrency to robotics software. Sebastian Nanz and other members of the CME project at ETH have just … Read more

Concurrent programming is easy

17 April 201420 June 2011 by Bertrand Meyer

Concurrent programming raises very hard problems. But the difficulty should be for the implementers of a concurrency model, not the application programmers. This article discusses concurrency challenges and presents the new SCOOP implementation which targets them.

Assessing concurrency models

17 April 201412 June 2011 by Bertrand Meyer

In a recent experiment with students we wanted to know how the SCOOP concurrency model compares to Java Threads in terms of ease of learning, program readability and correctness. Our group, however, is heavily involved with SCOOP. How did we address the risk of bias, and other parts of the “Professor Smith Syndrome”? What are our results, and can you believe them?