Abstract
An ambient is a named cluster of processes and subambients, which moves as a group.We describe type systems able to guarantee that certain ambients will remain immobile, and that certain ambients will not be dissolved by their environment.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Abadi. Secrecy by typing in security protocols. In Proceedings TACS’97, LNCS 1281, pages 611–638. Springer, 1997.
R.M. Amadio. An asynchronous model of locality, failure, and process mobility. In Proceedings COORDINATION 97, LNCS 1282. Springer, 1997.
R.M. Amadio and S. Prasad. Localities and failures. In Proceedings FST&TCS’94, LNCS 880, pages 205–216. Springer, 1994.
L. Cardelli. Abstractions for mobile computation. In Secure Internet Programming, LNCS. Springer, 1999.
L. Cardelli and A.D. Gordon. Mobile ambients. In Proceedings FoSSaCS’98, LNCS 1378, pages 140–155. Springer, 1998.
L. Cardelli and A.D. Gordon. Types for mobile ambients. In Proceedings POPL’99, pages 79–92. ACM, January 1999.
L. Cardelli, G. Ghelli, and A.D. Gordon. Mobility Types for Mobile Ambients. Technical Report, Microsoft Research, 1999 (to appear).
L. Cardelli, G. Ghelli, and A.D. Gordon. Ambient groups and mobility types. Unpublished, 1999.
R. De Nicola, G. Ferrari, R. Pugliese, and B. Venneri. Types for access control. Submitted for publication, 1998.
A.D. Gordon and L. Cardelli. Equational properties of mobile ambients. In Proceedings FoSSaCS’99, LNCS 1578, pages 212–226. Springer, 1999.
N. Heintz and J. Riecke. The SLam calculus: programming with secrecy and integrity. In Proceedings POPL’98, pages 365–377. ACM, 1998.
M. Hennessy and J. Riely. Resource access control in systems of mobile agents. In Proceedings HLCL’98, ENTCS 16(3). Elsevier, 1998.
T. Lindholm and F. Yellin. The Java Virtual Machine Specification. Addison-Wesley, 1997.
R. Milner. The polyadic π-calculus: A tutorial. Technical Report ECS-LFCS-91-180, University of Edinburgh, October 1991.
J. Riely and M. Hennessy. A typed language for distributed mobile processes. In Proceedings POPL’98, pages 378–390. ACM, 1998.
P. Sewell. Global/local subtyping and capability inference for a distributed π-calculus. In Proceedings ICALP’98, LNCS 1443, pages 695–706. Springer, 1998.
G. Smith and D. Volpano. Secure information flow in a multi-threaded imperative language. In Proceedings POPL’98, pages 355–364. ACM, 1998.
P. Sewell, P.T. Wojciechowski, and B.C. Pierce. Location independence for mobile agents. In Workshop on Internet Programming Languages, 1998.
T. Sekiguchi and A. Yonezawa. A calculus with code mobility. In Proceedings FMOODS’97, pages 21–36. IFIP, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cardelli, L., Ghelli, G., Gordon, A.D. (1999). Mobility Types for Mobile Ambients. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds) Automata, Languages and Programming. Lecture Notes in Computer Science, vol 1644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48523-6_20
Download citation
DOI: https://doi.org/10.1007/3-540-48523-6_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66224-2
Online ISBN: 978-3-540-48523-0
eBook Packages: Springer Book Archive