Skip to main content
Conference ProceedingsOPEN ACCESS

An asynchronous, distributed implementation of mobile ambients

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1872 LNCS 348-364
DOI: 10.1007/3-540-44929-9_26
53Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a first distributed implementation of the CardelliGordon's ambient calculus. We use Jocaml as an implementation language and we present a formal translation of Ambients into the distributed join calculus, the process calculus associated with Jocaml. We prove the correctness of the translation. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Fournet, C., Levy, J. J., & Schmitt, A. (2000). An asynchronous, distributed implementation of mobile ambients. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1872 LNCS, pp. 348–364). Springer Verlag. https://doi.org/10.1007/3-540-44929-9_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free