C. Fournet, J.-J. Levy, and A. Schmitt. A distributed implementation of mobile ambients. In Proc. of IFIP TCS'00, pages 348-364. Springer Verlag, 1872.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and distribution. However, we are aware of only two distributed implementations of the pi calculus: Facile [8] which uses a hand shake discipline for communication, and an indirect encoding into the join calculus [5] which is then implemented on Jocaml [4] Other related implementations [20, 6] add explicit location constructs to the pi calculus and use di#erent mechanisms for distributed interaction. There are two reasons for why pi calculus interaction has not been used for distributed interaction. First, synchronous rendezvous (as found in the pi calculus) seemed awkward to ....

C. Fournet, J.-J. Levy, and A. Schmitt. An asynchronous, distributed implementation of mobile ambients. In IFIP TCS 2000, LNCS 1872:348--364.

....and distributed systems. The main points of our approach are: i The use of cocapabilities to make both the source site and target site of each movement aware of the mobility, resulting in a 3 way synchronization which actually corresponds to mechanisms used when implementing MA, as observed in [8]. ii A resource control policy to define the number of resources occupied by each site in its parent site, as well as the total amount of resources available in each site for use by its direct subsites. iii A type system to enforce resource control policies. Correctness of this type system ....

C. Fournet, J.-J. Levy, and A. Schmitt. An asynchronous, distributed implementation of mobile ambients. In IFIP TCS, pages 348--364, 2000.

....and distributed systems. The main points of our approach are: i The use of cocapabilities to make both the source site and target site of each movement aware of the mobility, resulting in a 3 way synchronization which actually corresponds to mechanisms used when implementing MA, as observed in [8]. ii A resource control policy to de ne the number of resources occupied by each site in its parent site, as well as the total amount of resources available in each site for use by its direct subsites. iii A type system to enforce resource control policies. Correctness of this type system ....

C. Fournet, J.-J. Levy, and A. Schmitt. An asynchronous, distributed implementation of mobile ambients. In IFIP TCS, pages 348-364, 2000.

....client.open end.X] Figure 5: Cab protocol CA style (see Fig. 1) tation of movements in ambient calculi suggests this kind of three way synchronization. To illustrate our claim, let us consider the following transition in Mobile Ambients: h[m[in n] n[0] h[n[m[0] As shown in [10, 22], a practical implementation of this rule requires that h must be aware of the presence of n, no matter how n may have entered h. More generally, the execution of this movement will involve a synchronization between n (who is actually present) m (who looks for n) and h (who knows about the ....

C. Fournet, J.-J. Levy, and A. Schmitt. A distributed implementation of mobile ambients. In Proc. of IFIP TCS'00, pages 348--364. Springer Verlag, 1872.

....predict, and non trivial results could be derived algebraically. Although the work here is based on ROAM, both ETS MT and the encoding can be easily migrated to SA. From the implementation point of view, single threadness and stability can be utilized to overcome the heavy synchronization costs [4] needed to realize the three basic ambient reductions [11] This paper shows that even with a small portion of pure ambients which only allows for either stable ambients or single threaded ambients, the expressive power of is still retained, while the implementation costs will be largely ....

C. Fournet, J.-J. Levy, and A. Schmitt. An asynchronous, distributed implementation of mobile ambients. In Proc. IFIP TCS'2000.

.... to:arrived[open farrived; cabg: end[open fend; cabg:out to] The client = client[call from j out call:in cab:trip from to j out trip:out cab] cab[rec X:in # call:open call:in trip:open trip: open arrived:out client:open end:X] Figure 5: Cab protocol CA style As shown in [8, 18], a practical implementation of this rule requires that h must be aware of the presence of n, no matter how n may have entered h. More generally, the execution of this rule will need a synchronization between n (who is present) m (who looks for n) and h (who knows about m and n) Similarly, the ....

C. Fournet, J.-J. Levy, and A. Schmitt. A distributed implementation of mobile ambients. In Proceedings of IFIP International Conference on Theoretical Computer Science (IFIP TCS 2000), pages 348-364. Springer Verlag, 1872. 19

....G n , G r and G s implementing the local security contexts of the ambients involved in the action. The agreement among four entities needed to perform ambient movements may appear to have a heavy run time overhead. However, if one considers a low level description of an ambient move (e.g. see [FLS00,SV01]) it involves exactly three ambients and the process performing the movement action. Notice that the coordination step adheres to the principles of subsidiarity, i.e. only the ambients directly involved in the action can forbid it, and location awareness, e.g. guardian G n authorizes the ....

....3.7 One may wonder how much run time overhead is introduced by the execution monitoring performed by guardians. In the case of ambient movements (in) and (out) the agreement among four entities is a faithful representation of what happens in the distributed abstract machines for Mobile Ambients [FLS00] and for Safe Ambients [SV01] The asynchronous messagepassing protocol of [FLS00] could be used to split the synchronization among four entities required in rules (in) and (out) into multiple synchronization steps each involving only two entities. The splitting could give rise to a number of ....

[Article contains additional citation context not shown here]

Cedric Fournet, Jean-Jacques Levy, and Alan Schmitt. An asynchronous, distributed implementation of mobile ambients. In IFIP TCS, pages 348--364, 2000.

No context found.

C. Fournet, J.-J. Levy, and A. Schmitt. An asynchronous, distributed implementation of mobile ambients. In J. van Leeuwen, O. Watanabe, M. Hagiya, P. Mosses, and T. Ito, editors, Proceedings of IFIP TCS 2000, volume 1872 of LNCS. IFIP TC1, Springer-Verlag, Aug. 2000.

No context found.

C. Fournet, J.-J. Levy, and A. Schmitt. An asynchronous, distributed implementation of mobile ambients. In J. van Leeuwen, O. Watanabe, M. Hagiya, P. Mosses, and T. Ito, editors, Proceedings of IFIP TCS 2000, volume 1872 of LNCS, Sendai, Japan, 17-19 Aug. 2000. IFIP TC1, Springer-Verlag. An extended report is available from http://research.microsoft.com/~fournet.

No context found.

Cedric Fournet, Jean-Jacques Levy, and Alan Schmitt. An asynchronous, distributed implementation of mobile ambients. In J. van Leeuwen, O. Watanabe, M. Hagiya, P.D. Mosses, and T. Ito, editors, Proceedings of IFIP TCS 2000.

.... the core language for JoCaml and its predecessors, and has inspired the design of several other languages [3, 23, 27, 28] More formally, the join calculus is also a speci cation language, that can be used to state and prove the properties of programs, such as the correctness of an implementation [10, 1]. JoCaml is an extension of Objective Caml 1.07 [20] a typed programming language in the ML family with a mix of functional, imperative, and objectoriented features. JoCaml extends OCaml, in the sense that OCaml programs and libraries are just a special kind of JoCaml programs and libraries. ....

C. Fournet, J.-J. Levy, and A. Schmitt. An asynchronous, distributed implementation of mobile ambients. In J. van Leeuwen, O. Watanabe, M. Hagiya, P. Mosses, and T. Ito, editors, Proceedings of IFIP TCS 2000.

....to establish more challenging equations, beyond the scope of these notes. We refer to [1] for a detailed proof of the security of a distributed, cryptographic implementation of the join calculus, to [13] for a series of fully abstract encodings between variants of the join calculus, and to [17] for the correctness proof of an implementation of Ambients in JoCaml using coupled simulations. 4 Labeled semantics Labeled transition systems traditionally provide ne semantics for process calculi. Seen as auxiliary semantics for a reduction based calculus, they o er several advantages, such ....

C. Fournet, J.-J. Levy, and A. Schmitt. An asynchronous, distributed implementation of mobile ambients. In Proceedings of IFIP/TCS '00, Sendai, Japan, 17-19 Aug. 2000. An extended report is available from http://research.microsoft.com/~fournet.

No context found.

C. Fournet, J.-J. Levy, and A. Schmitt. A distributed implementation of mobile ambients. In Proc. of IFIP TCS'00, pages 348-364. Springer Verlag, 1872.

No context found.

C. Fournet, J.-J. Levy, and A. Schmitt. A distributed implementation of mobile ambients. In Proc. of IFIP TCS'00, pages 348-364. Springer Verlag, 1872.

No context found.

Fournet C, Levy J-J, Schmitt A (1872) A distributed implementation of mobile ambients. In: Proceedings of IFIP TCS'00. Springer, Berlin Heidelberg New York, pp 348--364

No context found.

C. Fournet, Levy, and A. Schmitt. An asynchronous, distributed implementation of mobile ambients. In Proceedings of IFIP TCS 2000, LNCS 1872:348--364. http: //research.microsoft.com/ # fournet/papers/implementation-of-ambients-tcs.pdf

No context found.

C. Fournet, J.-J. Levy, and A. Schmitt. A distributed implementation of mobile ambients. In Proc. of IFIP TCS'00, pages 348--364. Springer Verlag, 1872.

No context found.

C. Fournet, J.-J. Levy, and A. Schmitt. An asynchronous, distributed implementation of mobile ambients. In IFIP TCS, pages 348--364, 2000.

No context found.

C. Fournet, J.-J. Levy and A. Schmitt. An Asynchronous, Distributed Implementation of Mobile Ambients. In IFIP TCS 2000, volume 1872 of LNCS, pages 348--364. Springer-Verlag, 2000.

No context found.

C. Fournet, J-J. Levy, and Schmitt. A. An asynchronous, distributed implementation of mobile ambients. In Proceedings of IFIP TCS'00, number 1872 in LNCS. Springer-Verlag, 2000.

No context found.

C. Fournet, J.-J. Levy, and A. Schmitt. A distributed implementation of mobile ambients. In Proc. of IFIP TCS'00, pages 348-364. Springer Verlag, 1872.

No context found.

C. Fournet, J.-J. Levy, and A. Schmitt. An asynchronous, distributed implementation of mobile ambients. In IFIP TCS, pages 348--364, 2000. 20

No context found.

C. Fournet, J-J. Levy, and Shmitt. A. An asynchronous, distributed implementation of mobile ambients. In International Conference IFIP TCS, number 1872 in Lecture Notes in Computer Science. Springer, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC