Home
Scholarly Works
The SCOOP Concurrency Model in Java-like Languages
Conference

The SCOOP Concurrency Model in Java-like Languages

Abstract

SCOOP is a minimal extension to the sequential object-oriented programming model for concurrency. The extension consists of one keyword (separate) that avoids explicit thread declarations, synchronized blocks, explicit waits, and eliminates data races and atomicity violations by construction, through a set of compiler rules. SCOOP was originally described for the Eiffel programming language. This paper makes two contributions. Firstly, it presents a design pattern for SCOOP, which makes it feasible to transfer SCOOP's concepts to different object-oriented programming languages. Secondly, it demonstrates the generality of the SCOOP model by presenting an implementation of the SCOOP design pattern for Java. Additionally, we describe tools that support the SCOOP design pattern, and give a concrete example of its use in Java.

Authors

Torshizi Faraz; Ostroff Jonathan S.; Paige Richard F.; Chechik Marsha

Series

Concurrent Systems Engineering Series

Publisher

IOS Press

Publication Date

December 1, 2009

DOI

10.3233/978-1-60750-065-0-7

Conference proceedings

Concurrent Systems Engineering Series

ISSN

1383-7575
View published work (Non-McMaster Users)

Contact the Experts team