Results 1 
9 of
9
Decoding Choice Encodings
, 1999
"... We study two encodings of the asynchronous #calculus with inputguarded choice into its choicefree fragment. One encoding is divergencefree, but refines the atomic commitment of choice into gradual commitment. The other preserves atomicity, but introduces divergence. The divergent encoding is ..."
Abstract

Cited by 96 (5 self)
 Add to MetaCart
We study two encodings of the asynchronous #calculus with inputguarded choice into its choicefree fragment. One encoding is divergencefree, but refines the atomic commitment of choice into gradual commitment. The other preserves atomicity, but introduces divergence. The divergent encoding is fully abstract with respect to weak bisimulation, but the more natural divergencefree encoding is not. Instead, we show that it is fully abstract with respect to coupled simulation, a slightly coarserbut still coinductively definedequivalence that does not enforce bisimilarity of internal branching decisions. The correctness proofs for the two choice encodings introduce a novel proof technique exploiting the properties of explicit decodings from translations to source terms.
Seal: A Framework for Secure Mobile Computations
, 1999
"... . The Seal calculus is a distributed process calculus with localities and mobility of computational entities called seals. Seal is also a framework for writing secure distributed applications over large scale open networks such as the Internet. This paper motivates our design choices, presents t ..."
Abstract

Cited by 96 (4 self)
 Add to MetaCart
. The Seal calculus is a distributed process calculus with localities and mobility of computational entities called seals. Seal is also a framework for writing secure distributed applications over large scale open networks such as the Internet. This paper motivates our design choices, presents the syntax and reduction semantics of the calculus, and demonstrates its expressiveness by examples focused on security and management distributed systems. 1 Introduction Advances in computer communications and computer hardware are changing the landscape of computing. Networking is now cheap and pervasive. The Internet has become a platform for large scale distributed programming. What is needed now is programming languages that support the development of Internet applications. In the last couple of years a number of process calculi have been designed to model programming large scale distributed systems over open networks. Several of these calculi [12, 19, 34, 21] advocate programming m...
πCalculus, Internal Mobility, and AgentPassing Calculi
 THEORETICAL COMPUTER SCIENCE
, 1995
"... The πcalculus is a process algebra which originates from CCS and permits a natural modelling of mobility (i.e., dynamic reconfigurations of the process linkage) using communication of names. Previous research has shown that the πcalculus has much greater expressiveness than CCS, but also a much mo ..."
Abstract

Cited by 80 (12 self)
 Add to MetaCart
The πcalculus is a process algebra which originates from CCS and permits a natural modelling of mobility (i.e., dynamic reconfigurations of the process linkage) using communication of names. Previous research has shown that the πcalculus has much greater expressiveness than CCS, but also a much more complex mathematical theory. The primary goal of this work is to understand the reasons of this gap. Another goal is to compare the expressiveness of namepassing calculi, i.e., calculi like πcalculus where mobility is achieved via exchange of names, and that of agentpassing calculi, i.e., calculi where mobility is achieved via exchange of agents. We separate the mobility mechanisms of the πcalculus into two, respectively called internal mobility and external mobility. The study of the subcalculus which only uses internal mobility, called I, suggests that internal mobility is responsible for much of the expressiveness of the πcalculus, whereas external mobility is responsible for many of...
Bisimulation for higherorder process calculi
 INFORMATION AND COMPUTATION
, 1996
"... A higherorder process calculus is a calculus for communicating systems which contains higherorder constructs like communication of terms. We analyse the notion of bisimulation in these calculi. We argue that both the standard definition of bisimulation (i.e., the one for CCS and related calculi), ..."
Abstract

Cited by 58 (4 self)
 Add to MetaCart
A higherorder process calculus is a calculus for communicating systems which contains higherorder constructs like communication of terms. We analyse the notion of bisimulation in these calculi. We argue that both the standard definition of bisimulation (i.e., the one for CCS and related calculi), as well as higherorder bisimulation [E. Astesiano,
A Calculus of Secure Mobile Computations
, 1998
"... The sealcalculus is a distributed process calculus in which locations and movement of computational entities are explicit. The calculus is targeted at secure distributed applications over large scale open networks such as the Internet. Security is addressed by the addition of a finegrain access con ..."
Abstract

Cited by 28 (6 self)
 Add to MetaCart
The sealcalculus is a distributed process calculus in which locations and movement of computational entities are explicit. The calculus is targeted at secure distributed applications over large scale open networks such as the Internet. Security is addressed by the addition of a finegrain access control mechanism. This paper motivates our design choices, presents the syntax and reduction semantics of the calculus, and demonstrates its expressiveness by examples focused on security and management of large distributed systems.
Translating Core Facile
, 1995
"... In first approximation Core Facile is a simply typed calculus enriched with parallel composition, dynamic channel generation, and inputoutput synchronous communication primitives. In this paper we explore the (dynamic) semantics of core Facile programs. This should be taken as a basis for the def ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
In first approximation Core Facile is a simply typed calculus enriched with parallel composition, dynamic channel generation, and inputoutput synchronous communication primitives. In this paper we explore the (dynamic) semantics of core Facile programs. This should be taken as a basis for the definition of abstract machines, the transformation of programs, and the development of modal specification languages. We claim two main contributions. We introduce a new semantics based on the notion of barbed bisimulation. We argue that the derived equivalence provides a more satisfying treatment of restriction, in particular by proving the adequacy of a natural translation of Facile into ßcalculus we suggest that our approach is in good harmony with previous research on the semantics of subcalculi of Core Facile such as Chocs and ßcalculus. We illustrate at an abstract level various aspects of Facile compilation. In particular we introduce an `asynchronous' version of the Facile language...
Reasoning about HigherOrder Processes
, 1994
"... We address the specification and verification problem for process calculi such as Chocs, CML and Facile where processes or functions are transmissible values. Our work takes place in the context of a static treatment of restriction and of a bisimulationbased semantics. As a paradigmatic and simple ..."
Abstract

Cited by 17 (8 self)
 Add to MetaCart
We address the specification and verification problem for process calculi such as Chocs, CML and Facile where processes or functions are transmissible values. Our work takes place in the context of a static treatment of restriction and of a bisimulationbased semantics. As a paradigmatic and simple case we concentrate on (Plain) Chocs. We show that Chocs bisimulation can be characterized by an extension of HennessyMilner logic including a constructive implication, or function space constructor. This result is a nontrivial extension of the classical characterization result for labelled transition systems. In the second part of the paper we address the problem of developing a proof system for the verification of process specifications. Building on previous work for CCS we present an infinitary sound and complete proof system for the fragment of the calculus not handling restriction. Keywords: Higherorder process calculi; Bisimulation; Modal logics; Program specification; Program verif...
Congruence Proofs For Weak Bisimulation on Higherorder Processes: Results for Typed omegaorder Calculi
, 1996
"... Congruence proofs for bisimulation on higherorder process calculi tend to be significantly more complex than their counterparts in firstorder process algebra frameworks. Moreover, a standard technique that allows us to cover strong forms of bisimulation on higherorder calculi seems to fail for th ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Congruence proofs for bisimulation on higherorder process calculi tend to be significantly more complex than their counterparts in firstorder process algebra frameworks. Moreover, a standard technique that allows us to cover strong forms of bisimulation on higherorder calculi seems to fail for the corresponding weak forms. Similar problems are posed by applicative simulation on calculi and our starting point is a general and elegant technique for solving them that has been invented by Howe. We adapt and extend this technique to prove two new congruence results for !order process calculi. In the first case, where we use a static scoping discipline for action names, we treat a delay variant of late weak context bisimulation; in the second case, where we use a dynamic scoping discipline, we treat an early weak higherorder bisimulation. The present paper supersedes parts of our technical report [BF95], where we have considered secondorder processes.
An Analysis of picalculus Bisimulations
, 1995
"... The ßcalculus is a relatively simple framework in which the semantics of the dynamic creation and transmission of channels can be studied. We consider in particular the issue of defining and verifying the equivalence of ßterms in the context of bisimulation based semantics. We distinguish three ma ..."
Abstract
 Add to MetaCart
The ßcalculus is a relatively simple framework in which the semantics of the dynamic creation and transmission of channels can be studied. We consider in particular the issue of defining and verifying the equivalence of ßterms in the context of bisimulation based semantics. We distinguish three main contributions: (1) A characterization of `early' bisimulation in terms of a notion of `contextual' bisimulation. (2) The definition of a ßcalculus with explicit substitutions and the description of an abstract machine based on this notation which incrementally computes the synchronization tree of a ßprocess. (3) The introduction of a refinement of the `late' bisimulation which we call `uniform'. Roughly the latter corresponds to the idea of treating the formal parameter of an input prefix as a `logical' variable. It is argued that this might lead to more efficient verification tools. Finally, as an example of the expressive power of the ßcalculus, we show how this calculus can be used ...