@InProceedings{Torshizi09,
  title =        "{T}he {SCOOP} {C}oncurrency {M}odel in {J}ava-like {L}anguages",
  author=        "Torshizi,  Faraz and Ostroff,  Jonathan S. and Paige,  Richard F. and Chechik,  Marsha",
  editor=        "Welch, Peter H. and Roebbers,  Herman and Broenink,  Jan F. and Barnes,  Frederick R. M. and Ritson,  Carl G. and Sampson,  Adam T. and Stiles,  G. S. and Vinter,  Brian",
  pages =        "7--27",
  booktitle=     "{C}ommunicating {P}rocess {A}rchitectures 2009",
  isbn=          "978-1-60750-065-0",
  year=          "2009",
  month=         "nov",
  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."
}