Results 1  10
of
36
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 62 (5 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,
Environmental bisimulations for higherorder languages
 In TwentySecond Annual IEEE Symposium on Logic in Computer Science
, 2007
"... Developing a theory of bisimulation in higherorder languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulation proof method with “upto context ” techniques, and (2) obtaining definitions and results that scale to languages with d ..."
Abstract

Cited by 35 (11 self)
 Add to MetaCart
Developing a theory of bisimulation in higherorder languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulation proof method with “upto context ” techniques, and (2) obtaining definitions and results that scale to languages with different features. To meet these challenges, we present environmental bisimulations, a form of bisimulation for higherorder languages, and its basic theory. We consider four representative calculi: pure λcalculi (callbyname and callbyvalue), callbyvalue λcalculus with higherorder store, and then HigherOrder πcalculus. In each case: we present the basic properties of environmental bisimilarity, including congruence; we show that it coincides with contextual equivalence; we develop some upto techniques, including upto context, as examples of possible enhancements of the associated bisimulation method. Unlike previous approaches (such as applicative bisimulations, logical relations, SumiiPierceKoutavasWand), our method does not require induction/indices on evaluation derivation/steps (which may complicate the proofs of congruence, transitivity, and the combination with upto techniques), or sophisticated methods such as Howe’s for proving congruence. It also scales from the pure λcalculi to the richer calculi with simple congruence proofs. 1
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.
A Theory of Recursive Domains with Applications to Concurrency
 In Proc. of LICS ’98
, 1997
"... Marcelo Fiore , Glynn Winskel (1) BRICS , University of Aarhus, Denmark (2) LFCS, University of Edinburgh, Scotland December 1997 Abstract We develop a 2categorical theory for recursively defined domains. ..."
Abstract

Cited by 23 (14 self)
 Add to MetaCart
Marcelo Fiore , Glynn Winskel (1) BRICS , University of Aarhus, Denmark (2) LFCS, University of Edinburgh, Scotland December 1997 Abstract We develop a 2categorical theory for recursively defined domains.
Nominal Calculi for Security and Mobility
 IN PROC. DARPA WORKSHOP ON FOUNDATIONS FOR SECURE MOBILE CODE
, 1997
"... ..."
Bigraphical Semantics of HigherOrder Mobile Embedded Resources with Local Names
 Proceedings of the Graph Transformation for Verification and Concurrency workshop (GTVC'05)
, 2006
"... Bigraphs have been introduced with the aim to provide a topographical metamodel for mobile, distributed agents that can manipulate their own linkages and nested locations, generalising both characteristics of the πcalculus and the Mobile Ambients calculus. We give the first bigraphical presentatio ..."
Abstract

Cited by 17 (10 self)
 Add to MetaCart
Bigraphs have been introduced with the aim to provide a topographical metamodel for mobile, distributed agents that can manipulate their own linkages and nested locations, generalising both characteristics of the πcalculus and the Mobile Ambients calculus. We give the first bigraphical presentation of a nonlinear, higherorder process calculus with nested locations, nonlinear active process mobility, and local names, the calculus of HigherOrder Mobile Embedded Resources (Homer). The presentation is based on Milner’s recent presentation of the λcalculus in local bigraphs. The combination of nonlinear active process mobility and local names requires a new definition of parametric reaction rules and a representation of the location of names. We suggest localised bigraphs as a generalisation of local bigraphs in which links can be further localised. Key words: bigraphs, local names, nonlinear process mobility
Mobile Computations and Hostile Hosts
, 1999
"... This paper scratches the surface of the problem of classifying the attacks that a mobile computation can be subjected to in an open network. The discussion is based on a simplified version of the Seal calculus. We show the impact of these attacks on the semantics of the calculus and on the notion ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
This paper scratches the surface of the problem of classifying the attacks that a mobile computation can be subjected to in an open network. The discussion is based on a simplified version of the Seal calculus. We show the impact of these attacks on the semantics of the calculus and on the notion of observational equivalence. 1 Introduction Wide area networks hold great promises in terms of distributed computing. Applications that scale to the size of the Internet and seamlessly provide access to massive amounts of information and value added services are now technically feasible. But programming these new applications is proving more difficult than anticipated. The blame lies in part with current distributed programming paradigms which are too static to accommodate the dynamics of an open systems of the size of the Internet. Mobile agent programming is a promising alternative to clientserver computing based on the simple idea that, instead of moving packet of data between stati...
A congruence format for namepassing calculi
 In Proceedings of the Second Workshop on Structural Operational Semantics (SOS’05), volume 156 of Electron. Notes Theor. Comput. Sci
, 2005
"... ..."
Asynchronous process calculi: the firstorder and higherorder paradigms (Tutorial)
, 1999
"... We compare the firstorder and the higherorder... ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
We compare the firstorder and the higherorder...
A Survey of Theories for Mobile Agents
, 1995
"... This paper presents a comparative survey of formalisms related to mobile agents. It describes the calculus and its extensions, the Ambient calculus, Petri nets, Actors, and the family of generative communication languages. Each of these formalisms defines a mathematical framework that can be used t ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
This paper presents a comparative survey of formalisms related to mobile agents. It describes the calculus and its extensions, the Ambient calculus, Petri nets, Actors, and the family of generative communication languages. Each of these formalisms defines a mathematical framework that can be used to reason about mobile code; they vary greatly in their expressiveness, in the mechanisms they provide to specify mobile code based applications and in their practical usefulness for the validation and the verification of such applications. In this paper we show how these formalisms can be used to represent the mobility and communication aspects of two mobile code environments: Obliq and Messengers. We compare and classify the different formalisms with respect to mobility and discuss some shortcomings and desirable extensions. We also point to other emerging concepts in formalisms for mobile code systems.