MiKO---Mikado Koncurrent Objects

The motivation for the Mikado migration model is to provide programming constructs for controlling code mobility that are as independent as possible from the particular programming language used to program the code. The main idea is to regard a domain (or site, or locality), where mobile code may enter or exit, as a membrane enclosing running processes, and offering services that have to be called for entering or exiting the domain. MiKO---Mikado Koncurrent Objects is a particular instance of this model, where the membrane is explicitly split in two parts: the methods defining the interface, and a process part describing the data for, and the behavior of, the interface. The talk presents the syntax, operational semantics, and type system of MiKO, together with an example. It concludes by briefly mentioning the implementation of a language based on the calculus

An instance of the MIKADO migration model

In this document, we briefly describe the main contribution to the deliverable on experimenting with the implementation of most of the calculi considered in the project. First, we describe how two well known calculi for mobile processes KLAIM and Dπ have been implemented on the top of IMC. We then describe the implementation of the MiKO programming language, an instance of the parametric calculus introduced in the WP1 with the TyCO calculus as the content of the membrane itself. After this, we outline the description of the implementation of the abstract machine for an instance of the Kell Calculus that dedicates particular attention to the proof of its correctness. Our presentation ends with a discussion of the problem of implementing security membranes on the top of an execution platform

An instance of the MIKADO migration model

In this document, we briefly describe the main contribution to the deliverable on experimenting with the implementation of most of the calculi considered in the project. First, we describe how two well known calculi for mobile processes KLAIM and Dπ have been implemented on the top of IMC. We then describe the implementation of the MiKO programming language, an instance of the parametric calculus introduced in the WP1 with the TyCO calculus as the content of the membrane itself. After this, we outline the description of the implementation of the abstract machine for an instance of the Kell Calculus that dedicates particular attention to the proof of its correctness. Our presentation ends with a discussion of the problem of implementing security membranes on the top of an execution platform

MiKO Mikado Koncurrent Objects

enriched with constructs in[P ] that launches a process P in the contents part of the domain, out[x, M ] that sends a message M to the domain x, and mkdom[x, m|#P , P ] in P that creates a new domain x with guardian m|#P Universidade dos Acores, Departamento de Matematica Universidade do Porto, Departamento de Ciencia de Computadores Universidade de Lisboa, Departamento de Informatica 1 2 N ::= inaction | x{m|#P }[P ] | x ! M | N | N | new x N (networks) P ::= inaction | x ! M | x?m | x?#m | P | P | new x P | (processes) A # V | in[P ] | out[x, M ] | mkdom[x, m|#P , P ] in P M ::= l[ # V ] (messages) m ::= {l i = A i } i#I (methods) A ::= (#x)P (abstractions) V ::= x | A (values) Figure 1: Syntax of MiKO new x N | L # new x (N | L) x / # fn(L) (n-src) s{m|#S}[new c P ] # new c s{m|#S}[P ] c / # fn(m|#S) (n-psr) s{m|#new c S}[P ] # new c s{m|#S}[P ] c / # (fn(P) # fn(m)) (n-msr) Figure 2: Structural congruence on networks and contents P , visible in the membrane