Safe ambients: abstract machine and distributed implementation

Authors:
Paola Giannini;Davide Sangiorgi;Andrea Valente
Affiliations:
Dipartimento di Informatica, Università del Piemonte Orientale, Alessandria, Italy;Dipartimento di Scienze dell'Informazione, Università di Bologna, Bologna, Italy;Department of Software and Media Technology, Aalborg University Esbjerg, Esbjerg, Denmark
Venue:
Science of Computer Programming
Year:
2006

Citing 13
Cited 6

Types for mobile ambients

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Shape analysis for mobile ambients

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Controlling interference in ambients

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Anytime, anywhere: modal logics for mobile ambients

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Secure safe ambients

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Mobile safe ambients

ACM Transactions on Programming Languages and Systems (TOPLAS)
Boxed Ambients

TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
The Problem of ``Weak Bisimulation up to''

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
A Calculus of Mobile Agents

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Mobile Ambients

FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Compilation and equivalence of imperative objects

Journal of Functional Programming
A bisimulation-based semantic theory of Safe Ambients

ACM Transactions on Programming Languages and Systems (TOPLAS)
A correct abstract machine for safe ambients

COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages

Pict correctness revisited

Theoretical Computer Science
Encapsulation and Dynamic Modularity in the π-calculus

Electronic Notes in Theoretical Computer Science (ENTCS)
A compositional theory for STM Haskell

Proceedings of the 2nd ACM SIGPLAN symposium on Haskell
Nomadic pict: Programming languages, communication infrastructure overlays, and semantics for mobile computation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Pict correctness revisited

FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Abstract machines for safe ambients in wide-area and mobile networks

COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

The abstract machine PAN for a distributed implementation of an ambient calculus is presented. PAN is different from, and simpler than, previous implementations of ambient-like calculi, mainly because: the underlying calculus is typed Safe Ambients (SA) rather than the untyped Ambient calculus and therefore does not present certain forms of interferences among processes (the grave interferences). In PAN the logical structure of an ambient system and its physical distribution are separated. A translation from SA terms to PAN terms is defined. The correctness of such a translation, which asserts that an SA term and its translation exhibit the same observational behavior, is proved. Moreover, a description of a distributed implementation of the abstract machine in Java is given.