Download:
|
by Torben Amtoft, Assaf J. Kfoury, Santiago M. Pericas-geertsen
http://www.church-project.org/reports/electronic/Amt+Kfo+Per:ESOP-2001.ps.gz
Add To MetaCart
Abstract:
cs-people.bu.edu/santiago The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code [CG98]. We consider an Ambient Calculus where ambients transport and exchange programs rather that just inert data. We propose different senses in which such a calculus can be said to be polymorphically typed, and design accordingly a polymorphic type system for it. Our type system assigns types to embedded programs and what we call behaviors to processes; a denotational semantics of behaviors is then proposed, here called trace semantics, underlying much of the remaining analysis. We state and prove a Subject Reduction property for our polymorphicallytyped calculus. Based on techniques borrowed from finite automata theory, type-checking of fully type-annotated processes is shown to be decidable. Our polymorphically-typed calculus is a conservative extension of the typed
Citations
|
663
|
Mobile ambients
– Cardelli, Gordon
|
|
277
|
A calculus of mobile agents
– Fournet, Gonthier, et al.
- 1996
|
|
233
|
Pict: A programming language based on the pi-calculus
– Pierce, Turner
- 2000
|
|
220
|
Typing and subtyping for mobile processes
– Pierce, Sangiorgi
- 1996
|
|
146
|
Types for Mobile Ambients
– Cardelli, Gordon
- 1998
|
|
124
|
Controlling Interference in Ambients
– Levi, Sangiorgi
- 2000
|
|
100
|
Abstractions for mobile computations
– Cardelli
- 1999
|
|
93
|
The polymorphic pi-calculus: Theory and implementation
– Turner
- 1996
|
|
90
|
Language primitives and type discipline for structured communication-based programming
– Honda, Vasconcelos, et al.
- 1998
|
|
86
|
Seal: A framework for secure mobile computations
– Vitek, Castagna
|
|
85
|
A typed language for distributed mobile processes
– Riely, Hennessy
- 1998
|
|
72
|
Trust and partial typing in open systems of mobile agents
– Riely, Hennessy
- 1999
|
|
64
|
Higher-order concurrent programs with finite communication topology
– Nielson, Nielson
- 1994
|
|
59
|
Ambient groups and mobility types
– Cardelli, Ghelli, et al.
- 2000
|
|
59
|
An interaction-based language and its typing system
– Takeuchi, Honda, et al.
- 1994
|
|
48
|
Shape analysis for mobile ambients
– Nielson, Nielson
- 2000
|
|
47
|
Behavioral equivalence in the polymorphic pi-calculus
– Pierce, Sangiorgi
|
|
39
|
Types and subtypes for client-server interactions
– Gay, Hole
|
|
38
|
Assigning types to processes
– Yoshida, Hennessy
|
|
34
|
Subtyping and locality in distributed higher order processes (ex-tended abstract
– Yoshida, Hennessy
- 1999
|
|
33
|
What are Polymorphically-Typed Ambients
– Amtoft, Kfoury, et al.
- 2001
|
|
29
|
Secure compositions of insecure components
– Sewell, Vitek
- 1999
|
|
24
|
The Essence of Concurrent ML
– Panangaden, Reppy
- 1997
|
|
22
|
Subtyping and typing algorithms for mobile ambients
– Zimmer
- 2000
|
|
18
|
Mobile Objects
– Bugliesi, Castagna
- 2000
|
|
12
|
Type and Effect Systems: Behaviours for Concurrency
– Amtoft, Nielson, et al.
- 1999
|
|
11
|
Principal typing schemes in a polyadic pi-calculus
– Vasconcelos, Honda
- 1993
|
|
10
|
A sort inference algorithm for the polyadic pi-calculus
– Gay
- 1993
|
|
8
|
The Zip Calculus
– Tullsen
- 2000
|
|
4
|
Behaviour analysis for validating communication patterns
– Amtoft, Nielson, et al.
- 1998
|
