An object calculus for asynchronous communication

Honda, Kohei; Tokoro, Mario

doi:10.1007/bfb0057019

Cited by 352 publications

(265 citation statements)

References 14 publications

Supporting

Mentioning

262

Contrasting

Unclassified

Order By: Relevance

“…The calculus presents two main syntactic categories: processes and networks. At process level we find the usual asynchronous π-calculus constructs [2,16]; processes are built from the inactive process, stop, and from the asynchronous output process, a! v , using three constructs: name restriction, (νn : T ) P , parallel composition, P | Q, and input, a?…”

Section: Dπ Syntax and Operational Semanticsmentioning

confidence: 99%

History-Based Access Control for Distributed Processes

Martins

Vasconcelos

2005

Trustworthy Global Computing

View full text Add to dashboard Cite

Abstract. This paper presents a type system to control the migration of code between network nodes in a concurrent distributed framework, using the Dπ language. We express resource access policies as types and enforce policies via a type system. Types describe paths travelled by migrating code, enabling the control of history sensitive access to resources. Sites are logically organised in subnetworks that share the same security policies, statically specified by a network administrator. The type system guarantees that well-typed networks are exempt from security policies violations at runtime.

show abstract

Section: Dπ Syntax and Operational Semanticsmentioning

confidence: 99%

History-Based Access Control for Distributed Processes

Martins

Vasconcelos

2005

Trustworthy Global Computing

View full text Add to dashboard Cite

show abstract

“…The asynchronous π-calculus [25] is obtained by a simple weakening of the π-calculus synchronization primitives. Asynchronous messages simplify the requirements for distributed synchronization [32], but they still do not localize the management of communication decisions.…”

Section: Distributionmentioning

confidence: 99%

Abstractions for Mobile Computation

Cardelli

1999

Secure Internet Programming

111

View full text Add to dashboard Cite

show abstract

“…The maximal congruence induced by completed trace equivalence has been studied in [9] for asynchronous ACP. Bisimulation [18] for asynchronous ~r-calculus has been investigated in [15,12,2].…”

Section: Introductionmentioning

confidence: 99%

“…This makes outputs non-blocking and immediately executable; their executions make messages available for consumption. The asynchronous variants of ~r-calculus [15,6,12,2] and CCS [21,11,8] follow the second approach and model outputs by creating new concurrent processes. This amounts to modelling an output prefix ~.P as a parallel composition a l PWork partially supported by EEC: HCM project EXPRESS, and by CNR: project "Specifica ad alto livello e verifica formale di sistemi digitali".…”

mentioning

confidence: 99%

Asynchronous Observations of Processes

Boreale

Nicola

Pugliese

1998

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We study may and must testing-based preorders in an asynchronous setting. In particular, we provide some full abstraction theorems that offer alternative characterizations of these preorders in terms of context closure w.r.t, basic observables and in terms of traces and acceptance sets. These characterizations throw light on the asymmetry between input and output actions in asynchronous interactions and on the difference between synchrony and asynchrony. IntroductionDistributed systems can seldom rely on a global clock, and little assumptions can be made about their relative speed; as a consequence, it is natural to adopt for them an asynchronous communication mechanism. This calls for non-blocking sending primitives that do not oblige producers and consumers to synchronize when exchanging messages, but allow the sender of a message to continue with its task while the message travels to destination. Therefore, for describing distributed systems, a model based on a paradigm that imposes a neat distinction between input and output primitives, in the style of [1] and [17], appears to be a natural choice. In spite of these considerations, the most studied concurrency models in the process algebra community (e.g. [18,3,14,20]) are based on synchronous communications and model process interaction as the execution of simultaneous "complementary actions". Only recently, variants of process algebras based on asynchronous communications have been studied. Two main approaches have been followed to this purpose. They differ in the way (non-blocking) output actions are modelled. These actions are rendered either as state trans]ormers or as processes themselves. The asynchronous variants of ACP [9] and CSP [16] follow the first approach and introduce explicit buffers in correspondence of output channels. This makes outputs non-blocking and immediately executable; their executions make messages available for consumption. The asynchronous variants of ~r-calculus [15,6,12,2] and CCS [21,11,8] follow the second approach and model outputs by creating new concurrent processes. This amounts to modelling an output prefix ~.P as a parallel composition a l PWork partially supported by EEC: HCM project EXPRESS, and by CNR: project "Specifica ad alto livello e verifica formale di sistemi digitali". The third author has been supported by a scholarship from CNR --Comitato Scienza e Tecnologie dell'Informazione.

show abstract

An object calculus for asynchronous communication

Cited by 352 publications

References 14 publications

History-Based Access Control for Distributed Processes

History-Based Access Control for Distributed Processes

Abstractions for Mobile Computation

Asynchronous Observations of Processes

Contact Info

Product

Resources

About