[PDF][PDF] Mobile ambients

L Cardelli, A Gordon - Theoretical computer science, 2000 - microsoft.com
Mobile Ambients TCS Submission3.fm Page 1 Thursday, February 11, 1999, 3:52 pm 1
Abstract We introduce a calculus describing the movement of processes and devices, including …

Mobile ambients

L Cardelli, AD Gordon - … Conference on Foundations of Software Science …, 1998 - Springer
Mobile ambients Page 1 Mobile Ambients Luca Cardelli* Digital Equipment Corporation
Systems Research Center Andrew D. Gordon* University of Cambridge Computer Laboratory …

KLAIM: A kernel language for agents interaction and mobility

R De Nicola, GL Ferrari… - IEEE Transactions on …, 1998 - ieeexplore.ieee.org
We investigate the issue of designing a kernel programming language for mobile computing
and describe KLAIM, a language that supports a programming paradigm where processes …

Linearity and the pi-calculus

N Kobayashi, BC Pierce, DN Turner - ACM Transactions on …, 1999 - dl.acm.org
The economy and flexibility of the pi-calculus make it an attractive object of theoretical study
and a clean basis for concurrent language design and implementation. However, such …

Anytime, anywhere: Modal logics for mobile ambients

L Cardelli, AD Gordon - Proceedings of the 27th ACM SIGPLAN-SIGACT …, 2000 - dl.acm.org
The Ambient Calculus is a process calculus where processes may reside within a hierarchy
of locations and modify it. The purpose of the calculus is to study mobility, which is seen as …

Pict: A programming language based on the pi-calculus

BC Pierce, DN Turner - 2000 - direct.mit.edu
Milner, Parrow, and Walker's π-calculus [MPW92, Mil91] generalizes the channel-based
communication of CCS and its relatives by allowing channels to be passed as data along …

Process algebras with localities

I Castellani - Handbook of Process Algebra, 2001 - Elsevier
Process algebras can be enriched with localities that explicitly describe the distribution of
processes. Localities may represent physical machines, or more generally distribution units …

Ott: Effective tool support for the working semanticist

P Sewell, FZ Nardelli, S Owens, G Peskine… - Journal of functional …, 2010 - cambridge.org
Semantic definitions of full-scale programming languages are rarely given, despite the many
potential benefits. Partly this is because the available metalanguages for expressing …

A theory of contracts for web services

G Castagna, N Gesbert, L Padovani - ACM Transactions on …, 2009 - dl.acm.org
Contracts are behavioral descriptions of Web services. We devise a theory of contracts that
formalizes the compatibility of a client with a service, and the safe replacement of a service …

Deriving bisimulation congruences for reactive systems

JJ Leifer, R Milner - International Conference on Concurrency Theory, 2000 - Springer
The dynamics of reactive systems, eg CCS, has often been defined using a labelled
transition system (LTS). More recently it has become natural in defining dynamics to use …