A CSP model of Eiffel’s SCOOP

Authors:
Phillip J. Brooke;Richard F. Paige;Jeremy L. Jacob
Affiliations:
University of Teesside, School of Computing, TS1 3BA, Middlesbrough, UK;University of York, Department of Computer Science, YO10 5DD, Heslington, York, UK;University of York, Department of Computer Science, YO10 5DD, Heslington, York, UK
Venue:
Formal Aspects of Computing
Year:
2007

Citing 0
Cited 3

The safety-critical java mission model: a formal account

ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
A formal reference for SCOOP

Empirical Software Engineering and Verification
Performance analysis of SCOOP programs

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

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.