Results 11  20
of
29
Ambient Calculi with Types: a Tutorial
 Global Computing  Programming Environments, Languages, Security and Analysis of Systems, volume 2874 of LNCS
, 2003
"... A tutorial introduction to the key concepts of ambient calculi and their type disciplines, illustrated through a number of systems proposed in the last few years, such as Mobile Ambients, Safe Ambients, Boxed Ambients, and other related calculi with types. ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
A tutorial introduction to the key concepts of ambient calculi and their type disciplines, illustrated through a number of systems proposed in the last few years, such as Mobile Ambients, Safe Ambients, Boxed Ambients, and other related calculi with types.
Specification and Security Analysis of Mobile AdHoc Networks
, 2006
"... I certify that this dissertation, and the research to which it refers, are the product of my own work, and that any ideas or quotations from the work of others are properly acknowledged. Signed: Date: Mobile adhoc networks consist of mobile wireless devices which autonomously organise their communi ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(Show Context)
I certify that this dissertation, and the research to which it refers, are the product of my own work, and that any ideas or quotations from the work of others are properly acknowledged. Signed: Date: Mobile adhoc networks consist of mobile wireless devices which autonomously organise their communication infrastructure. Because of the simple network deployment this networking paradigm offers much convenience, but security turns out to be an important concern when considering the threats implied in using the wireless medium. In order to eliminate such concerns, formal specification and analysis techniques have to be used so that the employed communication protocols can be proved secure or their vulnerabilities exposed. While many such frameworks have been proposed for the analysis of classical security protocols, the challenges of the new setting prevent these from being applied directly. The main complication stems from the fact that the actions of intermediate
A Semantic Theory for Global Computing Systems
, 2004
"... We introduce cKlaim, a process calculus that can be thought of as a variant of the #calculus with process distribution, process mobility and asynchronous communication through distributed repositories. Upon it, we develop a semantic theory to reason about programs. More precisely, we introduce a ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We introduce cKlaim, a process calculus that can be thought of as a variant of the #calculus with process distribution, process mobility and asynchronous communication through distributed repositories. Upon it, we develop a semantic theory to reason about programs. More precisely, we introduce a natural contextually defined behavioural semantics, give a coinductive characterization in terms of a labelled bisimulation and illustrate some significant laws. Then, we smoothly tune the theory to model two more concrete settings obtained by explicitly considering failures and node connections, two lowlevel features that in real life can a#ect the underlying network infrastructure and, hence, the ability of processes to perform remote operations.
On Coincidence of Distributed and Performance Equivalence for Basic Parallel Processes
, 2002
"... We prove that distributed bisimilarity and a timed equivalence called performance equivalence coincide on Basic Parallel Processes. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We prove that distributed bisimilarity and a timed equivalence called performance equivalence coincide on Basic Parallel Processes.
Theories for Ubiquitous Processes and Data: Platform for 15year
 Grand Challenge.” Workshop on Grand Challenges for Computing Research
, 2002
"... Overview This paper is written as background for a proposed Grand ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Overview This paper is written as background for a proposed Grand
Abstract A Chart Semantics for the PiCalculus
"... We present a graphical semantics for the picalculus, that is easier to visualize and better suited to expressing causality and temporal properties than conventional relational semantics. A pichart is a finite directed acyclic graph recording a computation in the picalculus. Each node represents a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a graphical semantics for the picalculus, that is easier to visualize and better suited to expressing causality and temporal properties than conventional relational semantics. A pichart is a finite directed acyclic graph recording a computation in the picalculus. Each node represents a process, and each edge either represents a computation step, or a messagepassing interaction. Picharts enjoy a natural pictorial representation, akin to message sequence charts, in which vertical edges represent control flow and horizontal edges represent data flow based on message passing. A pichart represents a single computation starting from its top (the nodes with no ancestors) to its bottom (the nodes with no descendants). Unlike conventional reductions or transitions, the edges in a pichart induce ancestry and other causal relations on processes. We give both compositional and operational definitions of picharts, and illustrate the additional expressivity afforded by the chart semantics via a series of examples.
Twenty years on: Reflections on the CEDISYS project. Combining true concurrency with process algebra
"... ..."
(Show Context)
Basic Observables for a Calculus for Global Computing
, 2004
"... We discuss a basic process calculus useful for modelling applications over global computing systems and present the associated semantic theories as determined by some basic notions of observation. The main features of the calculus are explicit distribution, remote operations, process mobility and a ..."
Abstract
 Add to MetaCart
(Show Context)
We discuss a basic process calculus useful for modelling applications over global computing systems and present the associated semantic theories as determined by some basic notions of observation. The main features of the calculus are explicit distribution, remote operations, process mobility and asynchronous communication through distributed data spaces. We introduce some natural notions of extensional observations and study their closure under operational reductions and/or language contexts to obtain barbed congruence and may testing. For these equivalences, we provide alternative tractable characterizations as labelled bisimulation and trace equivalence. We discuss some of the induced equational laws and relate them to design choices of the calculus. In particular, we show that some of these laws do not hold any longer if the language is rendered less abstract by introducing (asynchronous and undetectable) failures or by implementing remote communications via process migrations and local exchanges. In both cases, we also investigate the adaptation of the tractable characterizations of barbed congruence and may testing to the lowerlevel scenarios.
Editor: I. Castellani (INRIA)
, 2002
"... Models of distribution and mobility: state of the art ..."
(Show Context)
The Marvel Programming Model: a higherorder distributed process calculus
, 2001
"... Contents 1 Introduction 2 1.1 Requirements for a distributed programming model . . . . . . . . . . . . . . . . . . . . . 3 1.2 Introducing the Mcalculus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2 The Mcalculus: syntax and operational semantics 6 2.1 Syntax . . . . . . ..."
Abstract
 Add to MetaCart
Contents 1 Introduction 2 1.1 Requirements for a distributed programming model . . . . . . . . . . . . . . . . . . . . . 3 1.2 Introducing the Mcalculus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2 The Mcalculus: syntax and operational semantics 6 2.1 Syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2 Operational semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.3 Typing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 3 Discussion and examples 18 3.1 Transparent communications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 3.2 Resource names and dynamic binding . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 3.3 Dynamic reconfiguration examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 3.3.1 Creating a n