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 p-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]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

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

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

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

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

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

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

[8]  Robin Milner,et al.  Elements of interaction , 1993 .

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

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

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

[12]  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).

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

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

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

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

[17]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

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

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

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

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

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

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

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

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

[26]  Robin Milner.  Functions as Processes , 1990, ICALP.

[27]  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).

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

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

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

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

[32]  Daniel Hirschko.  A full formalisation of pi-calculus theory in the Calculus of Constructions , 1997 .

[33]  Davide Sangiorgi,et al.  Behavioral equivalence in the polymorphic pi-calculus , 2000, JACM.

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

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

[36]  Naoki Kobayashi.  A partially deadlock-free typed process calculus , 1998, TOPL.

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

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

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

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

[41]  Robin Milner,et al.  Modal Logics for Mobile Processes , 1991, CONCUR.

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

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

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

[45]  Luca Cardelli,et al.  Mobile Ambients , 1998, Foundations of Software Science and Computation Structure.

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

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

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

[49]  A. Fleischmann.  Distributed Systems , 1994, Springer Berlin Heidelberg.

[50]  Benjamin C. Pierce,et al.  Linearity and the pi-calculus , 1999, TOPL.

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

[52]  Davide Sangiorgi,et al.  Interpreting Functions as Pi-Calculus Processes: A Tutorial , 1999 .

[53]  Faron Mollerz,et al.  The Mobility Workbench | a Tool for the -calculus | , 1994 .

[54]  Mads Dam,et al.  On the Decidability of Process Equivalences for the pi-calculus , 1995, International Conference on Algebraic Methodology and Software Technology.

[55]  Mads Dam.  Model Checking Mobile Processes , 1993, CONCUR.

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

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

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

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

[60]  M. E. Crandall,et al.  Names , 1924, Living I Was Your Plague.

[61]  Nobuko Yoshida,et al.  Subtyping and locality in distributed higher order processes , 1999 .

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

[63]  G. Erard Boudol,et al.  Typing the Use of Resources in a Concurrent Calculus (extended Abstract) , 1997 .

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

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

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

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

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

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

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

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

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

[73]  Davide Sangiorgi,et al.  Typing and subtyping for mobile processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[74]  Davide Sangiorgi.  An Interpretation of Typed Objects into Typed -calculus an Interpretation of Typed Objects into Typed -calculus , 1996 .

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

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

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

[78]  R. Milner.  Calculi for interaction , 1996, Acta Informatica.

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

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

[81]  R. Amadio,et al.  Localities and Failures , 1995 .

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

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

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