Paper Details

%T The SCOOP Concurrency Model in Java\-like Languages
%A Faraz Torshizi, Jonathan S. Ostroff, Richard F. Paige, Marsha Chechik
%E Peter H. Welch, Herman Roebbers, Jan F. Broenink, Frederick R. M. Barnes, Carl G. Ritson, Adam T. Sampson, G. S. Stiles, Brian Vinter
%B Communicating Process Architectures 2009
%X 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\[rs]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.

If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.

Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.