Teller D (2003) Formalisms for mobile resource control. In: Proceedings of FGC'03. Electronic notes in theoretical computer science, vol 85. Elsevier, Amsterdam Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Using Ambients to Control Resources - Teller, Zimmer, Hirschkoff (2004) (32 citations) Self-citation (Teller) (Correct)
No context found.
Teller D (2003) Formalisms for mobile resource control. In: Proceedings of FGC'03. Electronic notes in theoretical computer science, vol 85. Elsevier, Amsterdam
Using Ambients to Control Resources - Teller, Zimmer, Hirschkoff (2002) (32 citations) Self-citation (Teller) (Correct)
No context found.
D. Teller. Formalisms for mobile resource control. In Proc. of FGC'03, volume 85 of ENTCS. Elsevier, 2003.
Recovering Resources in the π-Calculus - Teller Self-citation (Teller) (Correct)
No context found.
D. Teller. Formalisms for mobile resource control. In FGC'03, volume 85 of ENCS. Elsevier, 2003.
Formalisms for Mobile Resource Control - Teller (2003) (1 citation) Self-citation (Teller) (Correct)
....calculus, we present the required enrichments to operational semantics and introduce a type system for resource control. Due to lack of space, we only present the main features of each calculus and type system; full definitions, as well as proofs, are available in a full version of this report [14]. The resource control policies that we propose are illustrated on a simple but su#ciently expressive running example that is common to all formalisms. In defining these calculi and type systems, we have tried to keep a uniform approach, staying faithful to the principles (i) iii) outlined ....
....M [P ] M.P #M# (x) M,N : M.N enter#M, N# enter(x, N) exit#M, N# exit(x, N) For space constraints, we shall present neither structural congruence nor the rules for reduction which we left unchanged. Full definitions are available in a full version of this report [14]. The semantics of rec is Rec rec X.P P X rec X.P The meaning of capabilities and cocapabilities is slightly modified, along the lines of Controlled Ambients usage of (co)capabilities. Instead of a two way synchronization between enter#n, k# and enter(x, k) and of another two way ....
[Article contains additional citation context not shown here]
D. Teller. Formalisms for mobile resource control. Technical report, LIP, 2003.
Using Ambients to Control Resources - Teller, Zimmer, Hirschkoff (2002) (32 citations) Self-citation (Teller) (Correct)
....classical unification problem. The question becomes more problematic if no information is given for recursion variables: one can compute a set of inequalities (resembling those given for the example of renaming in Sec. 3) but solving it in the general case would require more work. As reported in [24], our approach can be adapted to other formalisms for mobile and distributed computation that provide a primitive notion of location, such as Seals [28] Boxed Ambients [2, 3] Nomadic # [27] and Kells [23] In # calculus like languages, a natural notion of resource is given by channels, which ....
D. Teller. Formalisms for Mobile Resource Control. submitted, 2003. 18
Formalisms for Mobile Resource Control - Teller (2004) (1 citation) (Correct)
No context found.
D. Teller. Formalisms for mobile resource control. Technical Report (draft), LIP, 2003. http://www.ens-lyon.fr/~dtelle/recherche/Publications/mobileresourcesrr.ps.gz.
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