A CSP model of Eiffel’s SCOOP. 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. par 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. par 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.
Keywords for this software
References in zbMATH (referenced in 4 articles , 1 standard article )
Showing results 1 to 4 of 4.
- Brooke, Phillip J.; Paige, Richard F.: Cameo: an alternative model of concurrency for Eiffel (2009)
- Nienaltowski, Piotr: Flexible access control policy for SCOOP (2009)
- Ostroff, Jonathan S.; Torshizi, Faraz Ahmadi; Huang, Hai Feng; Schoeller, Bernd: Beyond contracts for concurrency (2009)
- Brooke, Phillip J.; Paige, Richard F.; Jacob, Jeremy L.: A CSP model of Eiffel’s SCOOP (2007)