An abstract machine for a distributed implementation of an ambient calculus is presented. The abstract machine is different from, and simpler than, previous implementations of ambient-like calculi, mainly because: the underlying calculus is typed Safe Ambients rather than the untyped Ambient calculus and therefore does not present certain forms of interferences among processes (the emph{grave interferences}); the logical structure of an ambient system and its physical distribution are separated. The proof of correctness and a description of a distributed implementation of the abstract machine in Java are given.
P. Giannini, D. Sangiorgi, A. Valente (2006). Safe Ambients: Abstract machine and distributed implementation. SCIENCE OF COMPUTER PROGRAMMING, 59, 209-249 [10.1016/j.scico.2005.05.002].
Safe Ambients: Abstract machine and distributed implementation
SANGIORGI, DAVIDE;
2006
Abstract
An abstract machine for a distributed implementation of an ambient calculus is presented. The abstract machine is different from, and simpler than, previous implementations of ambient-like calculi, mainly because: the underlying calculus is typed Safe Ambients rather than the untyped Ambient calculus and therefore does not present certain forms of interferences among processes (the emph{grave interferences}); the logical structure of an ambient system and its physical distribution are separated. The proof of correctness and a description of a distributed implementation of the abstract machine in Java are given.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
