Prototyping a Concurrency Model

Morandi, Benjamin; Schill, Mischael; Nanz, Sebastian; Meyer, Bertrand

doi:10.1109/acsd.2013.21

Cited by 16 publications

(77 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is achieved based on the sound (finitely representable) over-approximation of ("lasso shaped") alias expressions in terms of regular expressions, as in Lemma 2. We also discuss the integration and applicability of the alias calculus on top of the Maude formalization of SCOOP [21].…”

Section: Discussionmentioning

confidence: 99%

“…In this section we provide a brief overview on the integration and applicability of the alias calculus in SCOOP [21] -a simple object-oriented programming model for concurrency. Two main characteristics make SCOOP simple: 1) just one keyword programmers have to learn and use in order to enable concurrent executions, namely, separate and 2) the burden of orchestrating concurrent executions is handled within the model, therefore reducing the risk of correctness issues.…”

Section: ⊓ ⊔mentioning

confidence: 99%

“…For instance, the class structure defining a node in a simple linked list, with filed next is declared as: We include in Appendix E the whole class structure corresponding to (1), together with (the relevant parts of) the console output. For a detailed description of SCOOP and its Maude formalization we refer the interested reader to the work in [21].…”

Section: ⊓ ⊔mentioning

confidence: 99%

“…We choose K more as a notational convention to enable compact and modular definitions. In reality, the K-rules in this section are implemented in Maude, as rewriting theories, on top of the formalization of SCOOP [21] (we refer to Section 4 for more details on our approach). In short, our strategy is to start with a program built on top of the control structures in (3), then to apply the corresponding K-rules in order to get the "may aliasing" information in a designated K-cell ( − al ).…”

Section: A K-machinery For Collecting Aliasesmentioning

confidence: 99%

“…may aliasing is its integration in SCOOP [21] -a simple object oriented programming model for concurrency; thus an operational based approach on handling the alias calculus is more appropriate. The basis of a RL-based framework for the design and analysis of the SCOOP model was recently set in [21]. The reference implementation of SCOOP is Eiffel [19].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Expression-Based Aliasing for OO–languages

Caltais

2015

Communications in Computer and Information Science

View full text Add to dashboard Cite

Abstract. Alias analysis has been an interesting research topic in verification and optimization of programs. The undecidability of determining whether two expressions in a program may reference to the same object is the main source of the challenges raised in alias analysis. In this paper we propose an extension of a previously introduced alias calculus based on program expressions, to the setting of unbounded program executions such as infinite loops and recursive calls. Moreover, we devise a corresponding executable specification in the K-framework. An important property of our extension is that, in a non-concurrent setting, the corresponding alias expressions can be over-approximated in terms of a notion of regular expressions. This further enables us to show that the associated K-machinery implements an algorithm that always stops and provides a sound over-approximation of the "may aliasing" information, where soundness stands for the lack of false negatives. As a case study, we analyze the integration and further applications of the alias calculus in SCOOP. The latter is an object-oriented programming model for concurrency, recently formalized in Maude; K definitions can be compiled into Maude for execution.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: ⊓ ⊔mentioning

confidence: 99%

Section: ⊓ ⊔mentioning

confidence: 99%

Section: A K-machinery For Collecting Aliasesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Expression-Based Aliasing for OO–languages

Caltais

2015

Communications in Computer and Information Science

View full text Add to dashboard Cite

show abstract

An Interference-Free Programming Model for Network Objects

Schill

Poskitt

Meyer

2016

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Network objects are a simple and natural abstraction for distributed object-oriented programming. Languages that support network objects, however, often leave synchronization to the user, along with its associated pitfalls, such as data races and the possibility of failure. In this paper, we present D-SCOOP, a distributed programming model that allows for interference-free and transactionlike reasoning on (potentially multiple) network objects, with synchronization handled automatically, and network failures managed by a compensation mechanism. We achieve this by leveraging the runtime semantics of a multi-threaded object-oriented concurrency model, directly generalizing it with a message-based protocol for efficiently coordinating remote objects. We present our pathway to fusing these contrasting but complementary ideas, and evaluate the performance overhead of the automatic synchronization in D-SCOOP, finding that it comes close to-or outperforms-explicit locking-based synchronization in Java RMI.

show abstract

Safe and Efficient Data Sharing for Message-Passing Concurrency

Morandi

Nanz

Meyer

2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

International audienceMessage passing provides a powerful communication abstraction in both distributed and shared memory environments. It is particularly successful at preventing problems arising from shared state, such as data races, as it avoids sharing in general. Message passing is less effective when concurrent access to large amounts of data is needed, as the overhead of messaging may be prohibitive. In shared memory environments, this issue could be alleviated by supporting direct access to shared data; but then ensuring proper synchronization becomes again the dominant problem. This paper proposes a safe and efficient approach to data sharing in message-passing concurrency models based on the idea of distinguishing active and passive computational units. Passive units do not have execution capabilities but offer to active units exclusive and direct access to the data they encapsulate. The access is transparent due to a single primitive for both data access and message passing. By distinguishing active and passive units, no additional infrastructure for shared data is necessary. The concept is applied to SCOOP, an object-oriented concurrency model, where it reduces execution time by several orders of magnitude on data-intensive parallel programs

show abstract

Prototyping a Concurrency Model

Cited by 16 publications

References 23 publications

Expression-Based Aliasing for OO–languages

Expression-Based Aliasing for OO–languages

An Interference-Free Programming Model for Network Objects

Safe and Efficient Data Sharing for Message-Passing Concurrency

Contact Info

Product

Resources

About