Jump to content

Ambient calculus

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Xudong Guan (talk | contribs) at 00:32, 4 July 2002 ([VP02b] => [PV02]). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Ambient calculus is a form of notation devised by Luca Cardelli and Andy Gordon in 1998 and used to describe and theorise about mobile systems. It is useful to model interactions in such systems as the Internet.

Researchers

(Alphabetically ordered; feel free to add/update your information here)

Online papers

(Current year in chronical order, others in alphabetical order. Links to ResearchIndex is highly recommended.)

- 2002 -

  • [PV02] New! Iain Phillips and Maria G. Vigliotti. On reduction Semantics for the Push and Pull Ambient Calculus. Second International Conference of TCS 2002, Montreal, August 2002, To appear. Available from: http://www.doc.ic.ac.uk/~mgv98/
  • [BZ02] New! Nadia Busi and Gianluigi Zavattaro. On the Expressiveness of Movement in Pure Mobile Ambients. In Proc. of FWAN 2002, Foundations of Wide Area Network Computing, Malaga, Spain. Available from: http://www.cs.unibo.it/~zavattar/papers.html
  • [Zim02] Pascal Zimmer. On the expressiveness of pure safe ambients. INRIA Research Report RR-4350, France, 2002. (Full version of [Zim00b])

- 2001 -

  • [AKP01] T. Amtoft, A. J. Kfoury, and S. M. Pericas-Geertsen. What are Polymorphically-Typed Ambients? In David Sands, editor, ESOP'01, volume 2028 of LNCS, pages 206--220, Springer-Verlag, 2001. Longer version as a Boston University Tech. Report BUCS-TR-2000-021.
  • [BC01] M. Bugliesi and G. Castagna. Secure safe ambients. In Proc. POPL'01, the 28th ACM Symposium on Principles of Programming Languages, pages 222--235, London, 2001. ACM Press.
  • [CDG+01] W. Charatonik, S. Dal-Zilio, A. D. Gordon, S. Mukhopadhyay, and J. Talbot. The complexity of model checking ambients. In Proc. FOSSACS'01, volume 2032 of Lecture Notes in Computer Science, pages 152--167, Springer-Verlag, 2001.
  • [CG01a] L. Cardelli and G. Ghelli. A query language for semistructed data based on the ambient logic. In Proc. ESOP'01, volume 2028 of Lecture Notes in Computer Science, pages 1--22, Springer-Verlag, 2001.
  • [CGG01] L. Cardelli, G. Ghelli, and A. D. Gordon. Types for the ambient calculus. To appear in I&C special issue on TCS'2000.
  • [CT01] W. Charatonik and J. Talbot. The decidability of model checking mobile ambients. Inn Proc. CSL'01, the 15th Annual Conference of the European Association for Computer Science Logic, LNCS, pages 339--354, 2001.
  • [Dal01] S. Dal-Zilio. Fixed points in the ambient logic. April 2001.
  • [LM01] F. Levi, S. Maffeis. An abstract interpretation framework for analysing mobile ambients. In Proc. SAS'01, volume 2126 of Lecture Notes in Computer Science, pp. 395-411, Springer-Verlag, 2001. http://www.di.unipi.it/~maffeis/aiamb.ps (Context)
  • [MH01] M. Merro and M. Hennessy. Bisimulation congruences in safe ambients. Computer Science Report 5/01. An extended abstract will appear in Proc. POPL'02.
  • [San01] D. Sangiorgi. Extensionality and intensionality of the ambient logics. In Proc. POPL'01, pages 4-17, ACM, 2001.
  • [SV01] D. Sangiorgi and A. Valente. A distributed abstract machine for safe ambients. In Proc. ICALP'01, volume 2076 of LNCS, pages 408--420, Springer-Verlag, 2001.

- 2000 -

  • [BCC00] Michele Bugliesi, Giuseppe Castagna, and Silvia Crafa. Typed mobile objects. In Proc. CONCUR'2000, volume 1877 of LNCS, pages 504--520, 2000.
  • [CGG00] L. Cardelli, G. Ghelli, and A. D. Gordon. Ambient groups and mobility types. In Proc. of IFIP TCS2000, volume 1872 of Lecture Notes in Computer Science, pages 333--347, Springer-Verlag, 2000.
  • [DS00] M. Dezani-Ciancaglini and I. Salvo. Security types for mobile safe ambients. In Proc. ASIAN'00, volume 1961 of LNCS, pages 215--236, Springer-Verlag, 2000.
  • [DLB00] P. Degano, F. Levi and C. Bodei. Safe ambients: control flow analysis and security. In Proc. ASIAN'00, volume 1961 of LNCS, pages 199--214, Springer-Verlag, 2000.
  • [FLS00] C. Fournet, J. Levy, A. Schmitt. An asynchronous, distributed implementation of mobile ambients. In Proc. IFPI TCS2000, pages 348--364, Japan.
  • [LB00] F. Levi and C. Bodei. Security analysis for mobile ambients. In Proceedings of the Workshop on Issues in the Theory of Security, (co-located with ICALP 2000), pages 18--23, 2000.
  • [LS00] F. Levi and D. Sangiorgi. Controlling interference in ambients. In Proc. POPL'00, pages 352--364, Boston, Massachusetts, Jan. 19-21, 2000.
  • [NN00a] H. R. Nielson and F. Nielson. Shape analysis for mobile ambients. In Proc. POPL'00, pages 142--154, ACM Press, 2000.
  • [NNS00] F. Nielson, H. R. Nielson, and M. Sagiv. A kleene analysis of mobile ambients. In Proc. ESOP'00, volume 1782 of Lecture Notes in Computer Science, pages 305--319. Springer-Verlag, 2000.
  • [Zim00a] P. Zimmer. Subtyping and typing algorithms for mobile ambients. In FOSSACS'2000, Berlin, volume 1784 of Lecture Notes in Computer Science, pp. 375--390, Springer-Verlag, 2000.
  • [Zim00b] Pascal Zimmer. On the expressiveness of pure mobile ambients. In Proc. EXPRESS'00, volume 39 of Electronic Notes in Theoretical Computer Science, pages 81--104, Elsevier.

- 1999 -

  • [Car99a] L. Cardelli. Abstractions for mobile computation. In J. Vitek and C. Jensen (eds), Secure Internet Programming: Security Issues for Mobile and Distributed Objects, volume 1603 of Lecture Notes in Computer Science, pages 51-94. Springer-Verlag, 1999. Also as a Microsoft Research Tech. Report MSR-TR-98-34.
  • [CG99] L. Cardelli and A. D. Gordon. Types for mobile ambients. In Proc. POPL'99, pages 79-92. ACM Press. 1999.
  • [CGG99] L. Cardelli, G. Ghelli, and A. D. Gordon. Mobility types for mobile ambients. In J. Wiedermann, P. van Emde Boas, and M. Nielsen, eds., ICALP'99, vol. 1644 of LNCS, pp. 230--239. Springer-Verlag, July 1999. Extended version appears as Microsoft Research Technical Report MSR-TR-99-32, 1999.
  • [GC99] A. D. Gordon and L. Cardelli. Equational properties of mobile ambients. In Proc. FoSSaCS'99, volume 1578 of Lecture Notes in Computer Science, pages 212--226. Springer-Verlag, 1999.
  • [HJNN99] R. R. Hansen, J. G. Jensen, F. Nielson, and H. R. Nielson. Abstract interpretation of mobile ambients. In Proc. SAS'99, volume 1694 of Lecture Notes in Computer Science, pages 134-148. Springer-Verlag, 1999. http://www.daimi.au.dk/~fn/Papers/HJNN99ai.ps (Context)
  • [NNHJ99] F. Nielson, H. R. Nielson, R. R. Hansen, and J. G. Jensen. Validating firewalls in mobile ambients. In J. Baeten and S. Mauw, editors, Proc. CONCUR'99, volume 1664 of Lecture Notes in Computer Science, pages 463-477. Springer-Verlag, 1999.
  • [PP99] I. Petre and L. Petre. Mobile ambients and P-Systems. Turku Centre for Computer Science, TUCS Technical Report No. 293, June 1999.
  • [Sch99] Dmitri Schamschurko. A specification of the CORBA communication layer in the ambient calculus. In Proc. WADT'99, Bonas, France, 15-18 September 1999.
  • [Vig99] Maria Grazia Vigliotti. Transitions systems for the ambient calculus. Master thesis, Imperial College of Science, Technology and Medicine (University of London), September 1999. (Context)

- 1998 -

  • [CG98a] L. Cardelli and A. D. Gordon. Mobile ambients. In Maurice Nivat, editor, Proc. FOSSACS'98, volume 1378 of Lecture Notes in Computer Science, pages 140--155. Springer-Verlag, 1998. Also appear in Theoretical Computer Science, 240(1), pp.177-213, June 6, 2000.
  • [CG98b] L. Cardelli and A. D. Gordon. Mobile ambients - annex. unpublished notes, 1998.

- 1997 -

  • [Car97] L. Cardelli. Mobile ambient synchronization. SRC Technical Note 1997-013. DEC System Research Center, July 1997.