A fully abstract may testing semantics for concurrent objects

A Jeffrey, J Rathke - Theoretical Computer Science, 2005 - Elsevier
This paper provides a fully abstract semantics for a variant of the concurrent object calculus.
We define may testing for concurrent object components and then characterise it using a …

Contract compliance and choreography conformance in the presence of message queues

M Bravetti, G Zavattaro - International Workshop on Web Services and …, 2008 - Springer
Choreography conformance and contract compliance have been widely studied in the
context of synchronous communication. In this paper we approach a more realistic scenario …

A model of actors and grey failures

L Bocchi, J Lange, S Thompson… - Logical Methods in …, 2023 - lmcs.episciences.org
Existing models for the analysis of concurrent processes tend to focus on fail-stop failures,
where processes are either working or permanently stopped, and their state …

An executable specification of asynchronous Pi-Calculus semantics and may testing in Maude 2.0

P Thati, K Sen, N Martí-Oliet - Electronic Notes in Theoretical Computer …, 2004 - Elsevier
We describe an executable specification of the operational semantics of an asynchronous
version of the π-calculus in Maude by means of conditional rewrite rules with rewrites in the …

Parameterized, concurrent session types for asynchronous multi-actor interactions

M Charalambides, P Dinges, G Agha - Science of Computer Programming, 2016 - Elsevier
Session types have been proposed as a means of statically verifying implementations of
communication protocols. Although prior work has been successful for some classes of …

Contract-based discovery of web services modulo simple orchestrators

L Padovani - Theoretical Computer Science, 2010 - Elsevier
Web services are distributed processes exposing a public description of their behavior, or
contract. The availability of repositories of Web service descriptions enables interesting …

A rewriting based model for probabilistic distributed object systems

N Kumar, K Sen, J Meseguer, G Agha - Formal Methods for Open Object …, 2003 - Springer
Concurrent and distributed systems have traditionally been modelled using nondeterministic
transitions over configurations. The nondeterminism provides an abstraction over …

An algebraic theory of actors and its application to a simple object-based language

G Agha, P Thati - From Object-Orientation to Formal Methods: Essays in …, 2004 - Springer
The development of Simula by Ole-Johan Dahl and Kristen Nygaard introduced a number of
important programming language concepts–object which supports modularity in …

A Game Semantics of the Asynchronous π-Calculus

J Laird - International Conference on Concurrency Theory, 2005 - Springer
This paper studies the denotational semantics of the typed asynchronous π-calculus. We
describe a simple game semantics of this language, placing it within a rich hierarchy of …

Game semantics for higher-order concurrency

J Laird - International Conference on Foundations of Software …, 2006 - Springer
We describe a denotational (game) semantics for a call-by-value functional language with
multiple threads of control, which may communicate values of general type on locally …