White Rose University Consortium logo
University of Leeds logo University of Sheffield logo York University logo

A CSP Model of Eiffel's SCOOP

Brooke, P.J., Paige, R.F. and Jacob, J.L. (2007) A CSP Model of Eiffel's SCOOP. Formal Aspects of Computing, 19 (4). pp. 487-512. ISSN 0934-5043

Full text not available from this repository.

Abstract

The current informal semantics of the simple concurrent object-oriented programming (SCOOP) mechanism for Eiffel is described. We construct and discuss a model using the process algebra CSP. This model gives a more formal semantics for SCOOP than existed previously. We implement the model mechanically via a new tool called CSPsim. We examine two semantic variations of SCOOP: when and how far to pass locks, and when to wait for child calls to complete. We provide evidence that waiting for child calls to complete both unnecessarily reduces parallelism without any increase in safety and increases deadlocks involving callbacks. Through the creation and analysis of the model, we identify a number of ambiguities relating to reservations and the underlying run-time system and propose means to resolve them.

Item Type: Article
Institution: The University of York
Academic Units: The University of York > Computer Science (York)
Depositing User: York RAE Import
Date Deposited: 08 Apr 2009 15:47
Last Modified: 08 Apr 2009 15:47
Published Version: http://dx.doi.org/10.1007/s00165-007-0033-8
Status: Published
Publisher: Springer Science + Business Media
Identification Number: 10.1007/s00165-007-0033-8
URI: http://eprints.whiterose.ac.uk/id/eprint/6177

Actions (repository staff only: login required)