Cameo: an alternative model of concurrency for Eiffel

TY - JOUR

T1 - Cameo

T2 - an alternative model of concurrency for Eiffel

AU - Brooke, Phillip

AU - Paige, Richard

PY - 2009/8

Y1 - 2009/8

N2 - We present a new concurrency model for the Eiffel programming language. The model is motivated by describing a number of semantic problems with the leading concurrency model for Eiffel, namely SCOOP. Our alternative model aims to preserve the existing behaviour of sequential programs and libraries wherever possible. Comparison with the SCOOP model is made. The concurrency aspects of the alternative model are presented in CSP along with a model of exceptions. The results show that while the new model provides increased parallelism, this comes with the price of increased overhead due to lock management.

AB - We present a new concurrency model for the Eiffel programming language. The model is motivated by describing a number of semantic problems with the leading concurrency model for Eiffel, namely SCOOP. Our alternative model aims to preserve the existing behaviour of sequential programs and libraries wherever possible. Comparison with the SCOOP model is made. The concurrency aspects of the alternative model are presented in CSP along with a model of exceptions. The results show that while the new model provides increased parallelism, this comes with the price of increased overhead due to lock management.

KW - Concurrency

KW - Formal methods

KW - Programming languages

KW - Eiffel

KW - Alternative to SCOOP

KW - Asynchronous exceptions

UR - http://www.scopus.com/inward/record.url?scp=70350571348&partnerID=8YFLogxK

U2 - 10.1007/s00165-008-0096-1

DO - 10.1007/s00165-008-0096-1

M3 - Article

SN - 0934-5043

VL - 21

SP - 363

EP - 391

JO - Formal Aspects of Computing

JF - Formal Aspects of Computing

IS - 4

ER -