Cameo: an alternative model of concurrency for Eiffel

Brooke, Phillip J.; Paige, Richard F.

doi:10.1007/s00165-008-0096-1

Cited by 6 publications

(5 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We currently plan to include other semantic formalisations of Scoop-like languages, e.g. the concurrent Eiffel proposed by [5] (similar to Scoop but differences regarding separate object calls), other actor-based object-oriented languages, and concurrency concepts like "co-boxes" [34]. Scoop-Gts is obviously Turing-complete (one can simulate a 2-counter Minsky machine by non-recursive models with one object per handler, similar to the construction in [15]).…”

Section: Figmentioning

confidence: 99%

A Graph-Based Semantics Workbench for Concurrent Asynchronous Programs

Corrodi¹,

Heubner²,

Poskitt³

2016

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. A number of novel programming languages and libraries have been proposed that offer simpler-to-use models of concurrency than threads. It is challenging, however, to devise execution models that successfully realise their abstractions without forfeiting performance or introducing unintended behaviours. This is exemplified by Scoop-a concurrent object-oriented message-passing language-which has seen multiple semantics proposed and implemented over its evolution. We propose a "semantics workbench" with fully and semi-automatic tools for Scoop, that can be used to analyse and compare programs with respect to different execution models. We demonstrate its use in checking the consistency of semantics by applying it to a set of representative programs, and highlighting a deadlock-related discrepancy between the principal execution models of the language. Our workbench is based on a modular and parameterisable graph transformation semantics implemented in the Groove tool. We discuss how graph transformations are leveraged to atomically model intricate language abstractions, and how the visual yet algebraic nature of the model can be used to ascertain soundness.

show abstract

Section: Figmentioning

confidence: 99%

A Graph-Based Semantics Workbench for Concurrent Asynchronous Programs

Corrodi¹,

Heubner²,

Poskitt³

2016

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

show abstract

“…The given verification approach and modelling choices can also be applied to other concurrent asynchronous libraries and languages, e.g. the alternative concurrent Eiffel model CAMEO [3], and the existing GTS formalisation of Grand Central Dispatch [12]. As a future step, we want to include verification approaches beyond the strategies of GROOVE, which will depend on novel abstraction techniques for CPM (and its extensions), e.g.…”

Section: Resultsmentioning

confidence: 99%

Towards Practical Graph-Based Verification for an Object-Oriented Concurrency Model

Heußner¹,

Poskitt²,

Corrodi³

et al. 2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

To harness the power of multi-core and distributed platforms, and to make the development of concurrent software more accessible to software engineers, different object-oriented concurrency models such as SCOOP have been proposed. Despite the practical importance of analysing SCOOP programs, there are currently no general verification approaches that operate directly on program code without additional annotations. One reason for this is the multitude of partially conflicting semantic formalisations for SCOOP (either in theory or by-implementation). Here, we propose a simple graph transformation system (GTS) based run-time semantics for SCOOP that grasps the most common features of all known semantics of the language. This run-time model is implemented in the stateof-the-art GTS tool GROOVE, which allows us to simulate, analyse, and verify a subset of SCOOP programs with respect to deadlocks and other behavioural properties. Besides proposing the first approach to verify SCOOP programs by automatic translation to GTS, we also highlight our experiences of applying GTS (and especially GROOVE) for specifying semantics in the form of a run-time model, which should be transferable to GTS models for other concurrent languages and libraries.

show abstract

“…embed a model of exception handling in our CSP model [Bro06b,Bro06c] and examine the behaviours under the various options -in particular, to establish suitable constraints on asynchronous exception handlers to ensure that they do not trigger further problems;…”

Section: Resultsmentioning

confidence: 99%

“…The response to this is difficult: one possibility is that a randomly chosen object has its reservations taken away and an exception raised, perhaps 'deadlock recovery attempt'. Deadlock avoidance during design The CSP model in [Bro06b,Bro06c] could be developed to the point where Eiffel compilers write out CSP suitable for input to FDR [FSE95] or an alternative CSP tool; the tool then checks the CSP model of that particular system for sequences of events leading to deadlock. Problems in the infrastructure Our system comprises one or more partitions.…”

Section: Additional Sources Of Exceptionsmentioning

confidence: 99%

Exceptions in Concurrent Eiffel.

Brooke¹,

Paige²

2007

JOT

Self Cite

View full text Add to dashboard Cite

We describe the problem of asynchronous exceptions in Eiffel's Simple Concurrent Object-Oriented Programming (SCOOP). We discuss a range of possible solutions to further enable dependable computing in concurrent Eiffel. We propose a mechanism to handle aynchronous exceptions via a limited developer choice, including the notion of a failed or dead object, and necessarily introduce a small number of new exceptions. We additionally describe a number of mechanisms that were discarded as unsuitable.

show abstract

Cameo: an alternative model of concurrency for Eiffel

Cited by 6 publications

References 13 publications

A Graph-Based Semantics Workbench for Concurrent Asynchronous Programs

A Graph-Based Semantics Workbench for Concurrent Asynchronous Programs

Towards Practical Graph-Based Verification for an Object-Oriented Concurrency Model

Exceptions in Concurrent Eiffel.

Contact Info

Product

Resources

About