2007
DOI: 10.1007/s00165-007-0033-8
|View full text |Cite
|
Sign up to set email alerts
|

A CSP model of Eiffel’s SCOOP

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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
36
0

Year Published

2009
2009
2016
2016

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 20 publications
(36 citation statements)
references
References 9 publications
0
36
0
Order By: Relevance
“…Each object holds a list of objects that have reserved it; the last entry is the 'active reservation' or 'active lock'. This is part of the lock-passing mechanism from [BPJ07]. So for a calling b.f , a must hold the active lock on b.…”
Section: Locking Lazy Locks and Lock-passingmentioning
confidence: 99%
See 4 more Smart Citations
“…Each object holds a list of objects that have reserved it; the last entry is the 'active reservation' or 'active lock'. This is part of the lock-passing mechanism from [BPJ07]. So for a calling b.f , a must hold the active lock on b.…”
Section: Locking Lazy Locks and Lock-passingmentioning
confidence: 99%
“…This wrapper has the same preconditions as the called feature. 3 Locks are passed on through call chains, as described in [BPJ07]. Thus an object may be locked if…”
Section: Locking Lazy Locks and Lock-passingmentioning
confidence: 99%
See 3 more Smart Citations