Mobile processes: a commented bibliography

We propose a short bibliographic survey of calculi for mobile processes. Contrasting with other similar exercises, we consider two related, but distinct, notions of mobile processes, namely labile processes, which can exhibit dynamic changes in their interaction structure, as modelled in the π-calculus of Milner, Parrow and Walker for example, and motile processes, which can exhibit motion, as modelled in the ambient calculus of Cardelli and Gordon. A common characteristic of the algebraic frameworks presented in this paper is the use of names as first class values and the support for the dynamic generation of new, fresh names.

[1]  Peter Sewell.  Global/Local Subtyping and Capability Inference for a Distributed pi-calculus , 1998, ICALP.

[2]  Robin Milner,et al.  Functions as processes , 1990, Mathematical Structures in Computer Science.

[3]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[4]  Roberto M. Amadio,et al.  The Receptive Distributed π-Calculus , 1999 .

[5]  Benjamin C. Pierce,et al.  Decoding Choice Encodings , 1996, CONCUR.

[6]  Benjamin C. Pierce,et al.  Foundational Calculi for Programming Languages , 1997, The Computer Science and Engineering Handbook.

[7]  Andrew D. Gordon,et al.  Notes on Nominal Calculi for Security and Mobility , 2000, FOSAD.

[8]  Silvano Dal-Zilio,et al.  An Interpretation of Typed Concurrent Objects in the Blue Calculus , 2000, IFIP TCS.

[9]  Matthew Hennessy,et al.  Distributed bisimulations , 1989, JACM.

[10]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[11]  Luca Cardelli,et al.  Mobility Types for Mobile Ambients , 1999, ICALP.

[12]  Andrew D. Gordon,et al.  A Concurrent Object Calculus: Reduction and Typing , 1998, HLCL.

[13]  Silvano Dal Zilio.  An interpretation of typed concurrent objects in the blue calculus , 2000 .

[14]  Luca Cardelli,et al.  Equational properties of mobile ambients , 1999, Mathematical Structures in Computer Science.

[15]  Nobuko Yoshida,et al.  Suptyping and Locality in Distributed Higher Order Processes (extended abstract) , 1999, CONCUR.

[16]  Luca Cardelli,et al.  Logical Properties of Name Restriction , 2001, TLCA.

[17]  Benjamin C. Pierce,et al.  Linearity and the pi-calculus , 1996, POPL '96.

[18]  Luca Cardelli,et al.  A language with distributed scope , 1995, POPL '95.

[19]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[20]  Cédric Fournet,et al.  The reflexive CHAM and the join-calculus , 1996, POPL '96.

[21]  Luca Cardelli,et al.  Anytime, anywhere: modal logics for mobile ambients , 2000, POPL '00.

[22]  Davide Sangiorgi,et al.  From pi-Calculus to Higher-Order pi-Calculus - and Back , 1993, TAPSOFT.

[23]  Davide Sangiorgi,et al.  Behavioral equivalence in the polymorphic pi-calculus , 1997, POPL '97.

[24]  Andrew D. Gordon,et al.  Region analysis and a pi-calculus with groups , 2002, J. Funct. Program..

[25]  Roberto M. Amadio.  An Asynchronous Model of Locality, Failurem and Process Mobility , 1997, COORDINATION.

[26]  Jean-Jacques Lévy,et al.  A Calculus of Mobile Agents , 1996, CONCUR.

[27]  Dal ZilioSilvano,et al.  Region analysis and a -calculus with groups , 2002 .

[28]  Davide Sangiorgi,et al.  Locality and Interleaving Semantics in Calculi for Mobile Processes , 1996, Theor. Comput. Sci..

[29]  Josva Kleist,et al.  Local pi-Calculus at Work: Mobile Objects as Mobile Processes , 2000, IFIP TCS.

[30]  Corrado Priami,et al.  Non-Interleaving Semantics for Mobile Processes , 1999, Theor. Comput. Sci..

[31]  Roberto M. Amadio,et al.  The Receptive Distributed pi-Calculus (Extended Abstract) , 1999, FSTTCS.

[32]  Andrew D. Gordon,et al.  Region Analysis and a pi-Calculus wiht Groups , 2000, MFCS.

[33]  Martín Abadi,et al.  A Calculus for Cryptographic Protocols: The spi Calculus , 1999, Inf. Comput..

[34]  Björn Victor,et al.  The fusion calculus: expressiveness and symmetry in mobile processes , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[35]  Luca Cardelli,et al.  Secrecy and Group Creation , 2000, CONCUR.

[36]  Luca Cardelli,et al.  Abstractions for Mobile Computation , 2001, Secure Internet Programming.

[37]  James Riely,et al.  A typed language for distributed mobile processes (extended abstract) , 1998, POPL '98.

[38]  Javier Esparza,et al.  Proof-Checking Protocols Using Bisimulations , 1999, CONCUR.

[39]  Mads Dam,et al.  Model Checking Mobile Processes , 1993, Inf. Comput..

[40]  Marco Pistore,et al.  A Partition Refinement Algorithm for the pi-Calculus (Extended Abstract) , 1996, CAV.

[41]  Gérard Boudol,et al.  Typing the Use of Resources in a Concurrent Calculus (Extended Abstract) , 1997, ASIAN.

[42]  Roberto M. Amadio,et al.  Localities and Failures (Extended Abstract) , 1994, FSTTCS.

[43]  Björn Victor,et al.  Calculi for Mobile Processes - Bibliography and Web Pages , 1998, Bull. EATCS.

[44]  Andrew M. Pitts,et al.  Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new? , 1993, MFCS.

[45]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[46]  B. Pierce,et al.  Typing and subtyping for mobile processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[47]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[48]  Robin Milner,et al.  Elements of interaction: Turing award lecture , 1993, CACM.

[49]  Naoki Kobayashi,et al.  A partially deadlock-free typed process calculus , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[50]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[51]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[52]  Cliff B. Jones.  A pi-Calculus Semantics for an Object-Based Design Notation , 1993, CONCUR.

[53]  Gérard Boudol.  The π-Calculus in Direct Style , 1998, High. Order Symb. Comput..

[54]  Marco Pistore,et al.  A Partition Refinement Algorithm for the -Calculus , 2001, Inf. Comput..

[55]  Luca Cardelli,et al.  Ambient Groups and Mobility Types , 2000, IFIP TCS.

[56]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[57]  Cedric Fournet.  Le join-calcul : un calcul pour la programmation repartie et mobile , 1998 .

[58]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[59]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

[60]  Daniel Hirschkoff.  A Full Formalisation of pi-Calculus Theory in the Calculus of Constructions , 1997, TPHOLs.

[61]  Nobuko Yoshida,et al.  Graph Types for Monadic Mobile Processes , 1996, FSTTCS.

[62]  Faron Moller,et al.  The Mobility Workbench - A Tool for the pi-Calculus , 1994, CAV.

[63]  Davide Sangiorgi.  An Interpretation of Typed Objects into Typed pi-Calculus , 1998, Inf. Comput..

[64]  Davide Sangiorgi,et al.  Extensionality and intensionality of the ambient logics , 2001, POPL '01.

[65]  Robin Milner,et al.  Modal Logics for Mobile Processes , 1991, Theor. Comput. Sci..

[66]  James Riely,et al.  Resource Access Control in Systems of Mobile Agents , 2002, Inf. Comput..

[67]  Nobuko Yoshida,et al.  On Reduction-Based Process Semantics , 1995, Theor. Comput. Sci..

[68]  Davide Sangiorgi,et al.  Imperative objects and mobile processes , 1998, PROCOMET.

[69]  Davide Sangiorgi.  Typed pi-calculus at Work: A Correctness Proof of Jones's Parallelisation Transformation on Concurrent Objects , 1999, Theory Pract. Object Syst..

[70]  Luca Cardelli,et al.  A Query Language Based on the Ambient Logic , 2001, SEBD.

[71]  Marco Pistore,et al.  Verifying Mobile Processes in the HAL Environment , 1998, CAV.

[72]  Andrew M. Pitts,et al.  A new approach to abstract syntax involving binders , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[73]  Mads Dam.  On the Decidability of Process Equivalences for the pi-Calculus , 1997, Theor. Comput. Sci..

[74]  Luca Cardelli,et al.  Types for mobile ambients , 1999, POPL '99.

[75]  Jan Vitek,et al.  Seal: A Framework for Secure Mobile Computations , 1998, ICCL Workshop: Internet Programming Languages.

[76]  David N. Turner,et al.  The polymorphic Pi-calculus : theory and implementation , 1996 .

[77]  Vasco Thudichum Vasconcelos,et al.  Typed Concurrent Objects , 1994, ECOOP.

[78]  Matthew Hennessy.  A Typed Language for Distributed Mobile Processes , 1998 .