Mobility and Security

We discuss the computational aspects of wide area networks, and we describe various facets of a process calculus devised to embody mobility, security, and wide area network semantics. These lecture notes are an abridged version of [8, 11, 27, 12, 13]. Part I: Wide Area Computation

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

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

[3]  Sam Toueg,et al.  Unreliable Failure Detectors for Asynchronous Systems , 1991 .

[4]  Yves Lafont,et al.  The Linear Abstract Machine , 1988, Theor. Comput. Sci..

[5]  James H. Morris,et al.  Lambda-calculus models of programming languages. , 1969 .

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

[7]  Sam Toueg,et al.  Asynchronous consensus and broadcast protocols , 1985, JACM.

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

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

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

[11]  Luca Cardelli,et al.  Service Combinators for Web Computing , 1999, DSL.

[12]  Munindar P. Singh,et al.  Agents on the Web: Mobile Agents , 1997, IEEE Internet Comput..

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

[14]  Mads Dam,et al.  Relevance logic and concurrent composition , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[15]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[16]  Jean-Yves Girard,et al.  Linear Logic and Lazy Computation , 1987, TAPSOFT, Vol.2.

[17]  Robin Milner,et al.  Flowgraphs and Flow Algebras , 1979, JACM.

[18]  Alasdair Urquhart,et al.  Semantics for relevant logics , 1972, Journal of Symbolic Logic.

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

[20]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[21]  J. Girard,et al.  Proofs and types , 1989 .

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

[23]  Peter W. O'Hearn,et al.  The Logic of Bunched Implications , 1999, Bulletin of Symbolic Logic.

[24]  Glynn Winskel,et al.  Linear Logic on Petri Nets , 1993, REX School/Symposium.

[25]  Christian F. Tschudin,et al.  Towards mobile cryptography , 1998, Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186).

[26]  Luca Cardelli,et al.  Migratory applications , 1995, UIST '95.

[27]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

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

[29]  Nicholas Carriero,et al.  Linda in context , 1989, CACM.

[30]  Luca Cardelli,et al.  Abstractions for Mobile Computation , 1999, Secure Internet Programming.

[31]  Roberto M. Amadio,et al.  An Asynchronous Model of Locality, Failure and Process Mobility , 1997, COORDINATION.

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

[33]  Guy L. Steele,et al.  The Java Language Specification , 1996 .

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

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

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

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

[38]  Oscar Nierstrasz,et al.  Object-Based Models and Languages for Concurrent Systems , 1994, Lecture Notes in Computer Science.

[39]  Rocco De Nicola,et al.  Locality Based Linda: Programming with Explicit Localities , 1997, TAPSOFT.

[40]  David K. Gifford,et al.  Remote evaluation , 1990, TOPL.