A Distributed Abstract Machine for Boxed Ambient Calculi

Andrew Phillips, Nobuko Yoshida, and Susan Eisenbach

Abstract

Boxed ambient calculi have been used to model and reason about a wide variety of problems in mobile computing. Recently, several new variants of Boxed Ambients have been proposed, which seek to improve on the original calculus. In spite of these theoretical advances, there has been little research on how such calculi can be correctly implemented in a distributed environment. This paper bridges a gap between theory and implementation by defining a distributed abstract machine for a variant of Boxed Ambients with channels. The abstract machine uses a list semantics, which is close to an implementation language, and a blocking semantics, which leads to an efficient implementation. The machine is proved sound and complete with respect to the underlying calculus. A prototype implementation is also described, together with an application for tracking the location of migrating ambients. The correctness of the machine ensures that the work done in specifying and analysing mobile applications is not lost during their implementation.

Details

Publication typeArticle
Published inEuropean Symposium on Programming
URLhttp://dx.doi.org/10.1007/b96702
Pages155–170
Volume2986
SeriesLNCS
PublisherSpringer
> Publications > A Distributed Abstract Machine for Boxed Ambient Calculi