M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In Proceedings of LICS '98. IEEE, Computer Society Press, 1998.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....equivalences, 15,9] for which there are a range of powerful techniques based on labelled transition systems. These describe processes in terms of the actions they can perform and their consequences, with judgements of the form In this paper we show that, by building on the ideas in [2,18], similar techniques can be developed for typed equivalences for our version of the calculus in which names can be tested for identity, and more importantly the types of names can change dynamically. The central idea is to replace the untyped actions above with new typed actions of the ....

....observers names to the actual names used by the process. Thus in this setting typed 14 actions take the form I; P ; where I represents the view the type environment of the observer and is in general a many to one function whose domain coincides with that of I. In subsequent work, [2], these typed actions were used to provide a co inductive characterisation of a barbed congruence. Our results may thus be considered as a generalisation of this work to a language with name matching. The lack of a name equality test impacts upon the behavioural equivalence of the language through ....

[Article contains additional citation context not shown here]

M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In Proc. 13th LICS Conf. IEEE Computer Society Press, 1998.

....Most importantly, this is case for the asynchronous # calculus [2, 4, 3] Here, a process does not continue after an output action. Moreover, Sangiorgi has identified a private # calculus where the equivalences coincide. In the private # calculus , any output action must output a fresh name. In [1] Boreale and Sangiorgi consider the problem of giving a labelled characterization of barbed congruence for the # calculus without the match construct. This calculus forms a natural subcalculus. In particular, programming languages based on the # calculus and related calculi such as Pict [7] do not ....

Michele Boreale and Davide Sangiorgi. Bisimulation in name-passing calculi without matching. In Proceedings of LICS '98. IEEE, Computer Society Press, July 1998.

....and syntactic contexts. In the setting of the calculus, linearity and its relationship to contextual equivalences [21, 27] are studied in [25, 30, 34] In each case, it is shown that linearity induces a strictly larger contextual equivalence than the standard bisimilarities. 30] as well as [5] study typed bisimilarities in which two processes whose actions are equivalent up to forwarding of names are equated. 19] studies an untyped bisimulation in which visible actions can be ignored due to asynchronous observables. 13] studies a process equivalence in which certain actions are ....

Boreale, M. and Sangiorgi, D. Bisimulation in name-passing calculi without matching. LICS'98, IEEE, 1998.

....and by means of a type system in the calculus. Other devices have been proposed to reduce the number of transitions to consider when comparing calculus processes. An alternative approach is to use typed interfaces and typed bisimulations in order to structure interaction with the environment [8]. A more dynamic approach is to prune families of extraneous transitions from the synchronization tree. In [27] for instance, only transitions on active names are considered. 9 Conclusions In this paper, we have developed the theory of bisimulation for the joincalculus. We started from the ....

....coincidence of weak bisimilarity and barbed equivalence holds only in the presence of matching, which invalidates useful process equalities. It would be interesting to find direct, purely co inductive characterizations of barbed equivalence in the absence of matching. This issue is addressed in [8] in a calculus setting, and in [22] in an asynchronous calculus closely related to the join calculus. In this latter work, Merro and Sangiorgi introduce a new extrusion clause requiring that either the extruded name be the same on both sides of the bisimulation or that the two resulting processes ....

Michele Boreale and Davide Sangiorgi. Bisimulation in name-passing calculi without matching. In LICS '98 [19].

....order to dene some methods for checking bisimilarities between processes. These techniques have been introduced as meta level tools for proving bisimulation relations [SM92, San95] and to our knowledge have only been used in papers about the theory of calculus, to prove bisimilarity laws (e.g. [BS98, San96a]) The idea behind the up to techniques is to reduce the size of the relation one has to exhibit to establish a bisimilarity property, by providing syntactical tools to manipulate pairs of processes before checking that these pairs belong to the relation. For example, the classical proof of ....

M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In Proceedings of LICS '98 - to appear, 1998.

....precise Sangiorgi s claim [20] that internal mobility is responsible for the expressiveness of calculus. In this extended abstract proofs are just sketched; detailed proofs can be found in the full version of the paper [11] Related works The works which are most closely related to ours are [4,12,3]. In [4] Boreale and Sangiorgi study barbed congruence in synchronous calculus with capability types and no matching. Our characterization is much simpler than that in [4] but the latter is more general because it can be applied to several calculus languages (although the authors say that the ....

....claim [20] that internal mobility is responsible for the expressiveness of calculus. In this extended abstract proofs are just sketched; detailed proofs can be found in the full version of the paper [11] Related works The works which are most closely related to ours are [4,12,3] In [4] Boreale and Sangiorgi study barbed congruence in synchronous calculus with capability types and no matching. Our characterization is much simpler than that in [4] but the latter is more general because it can be applied to several calculus languages (although the authors say that the ....

[Article contains additional citation context not shown here]

Boreale, M. and D. Sangiorgi, Bisimulation in name-passing calculi without matching, in: 13th LICS Conf. (1998).

....p = q) V ] q jq(gt; pt) gt(r) rhpi:0) For certain phrases, the ordinary calculus (weak early) bisimilarity turns out to be too discriminating. Imposing type systems increases the number of provable equalities by weakening the capacities of the observer. By introducing a simple I O typing [PS93, BS98] one can prove the equality of phrases employing open variables in different manners, e.g. while tt do ( 0; 1) while tt do ( 1; 0) Though full abstraction is not gained by an I O type system, our experiments have given evidence that the I O types are usually sufficient for ....

M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In thirteen LICS Conf. IEEE Computer Society Press, 1998.

....subtyping. It is used to embed typed object calculi by Kleist and Sangiorgi [14] The present work differs in that it offers a semantic framework of subtyping not restricted to a specific syntactic construction. Their subtyping arises as a non trivial instance of the present theory [10] see also [4]) As to the embedding result, ours would be the first one which offers the sound embedding of functional subtyping with constant data domains into subtyping in name passing. Vast literature exists on the subtyping of sequential calculi, where diverse notions are studied from both syntactic and ....

Boreale, M. and Sangiorgi, D. Bisimulation in Name-Passing Calculi without Matching. LICS '98, 1998.

No context found.

M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In Proceedings of LICS '98. IEEE, Computer Society Press, 1998.

No context found.

M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In Proceedings of LICS '98. IEEE, Computer Society Press, 1998.

No context found.

M. Boreale, D. Sangiorgi. Bisimulation in Name-Passing Calculi without Matching. In Proc. of the 13th IEEE Symposium Logic In Computer Science (LICS'98), IEEE Computer Society Press, pp. 165-175, 1998.

No context found.

M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In 13th LICS Conf. IEEE Computer Society Press, 1998.

....semantics is sufficient for expressing many security properties (especially secrecy and autenthicity ones, 7] bisimulation is sometimes preferrable because it is supported by a nice, purely co inductive proof technique. The latter can be enhanced by tailoring, as we do, some up to techniques [21, 10] to the cryptographic setting. Another advantage of our semantics are the congruence rules that make compositional proofs possible. The use of trace and bisimulation semantics as proof techniques is illustrated with a few examples; some of the them concern the problem of implementing (like in [4] ....

....of given in Definition 3.8 gives us a powerful proof technique when proving equalities between two processes: it is sufficient to exhibit any bisimulation relation containing the given pair. This technique can be enhanced using the so called up to techniques (similar to those in, e.g. [21, 10]) which often permit to reduce the size of the relation to exhibit. We introduce below some useful up to techniques, which will be used in later proofs and examples. Up to structural equivalence allows one to freely identify structurally equivalent processes; up to weakening permits discarding ....

[Article contains additional citation context not shown here]

M. Boreale, D. Sangiorgi. Bisimulation in Name-Passing Calculi without Matching. In Proc. of the 13th IEEE Symposium Logic In Computer Science (LICS'98), IEEE Computer Society Press, pp. 165-175, 1998.

....developed for the pi calculus may be useful on other higher order languages, either by directly applying the technique to the language, or indirectly, by translating the language into the pi calculus. The ideas presented in this paper have also inspired proof techniques for subtype polymorphism [BS98] and for cryptography [BDP99] in pi calculus related languages. The proof methods we have proposed are quite manual, but may represent first steps towards more automatic, computer aided methods. The integration of the labeled bisimilarity of Section 12 with existing tools for automatic or ....

M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In 13th LICS Conf. IEEE Computer Society Press, 1998.

....matching transitions of processes have the same labels, therefore the problems given by restrictions (a) and (b) do not appear. Other studies of barbed congruence, or similar contextual based bisimulations, for mobile processes include [19, 20, 42, 14, 16] and, for a coordination language, 12] [9] studies barbed congruence in synchronous calculus with capability types and no matching, of which (a) and (b) are a special case. Our characterisations are simpler than those in [9] but the latter are more general, in that they can be applied to several calculus languages (although the ....

....bisimulations, for mobile processes include [19, 20, 42, 14, 16] and, for a coordination language, 12] 9] studies barbed congruence in synchronous calculus with capability types and no matching, of which (a) and (b) are a special case. Our characterisations are simpler than those in [9], but the latter are more general, in that they can be applied to several calculus languages (although the extension to asynchronous languages is not straightforward) The technical approaches are dioeerent: in [9] bisimulations have a type environment (in fact, closures) whereas in this paper ....

[Article contains additional citation context not shown here]

M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. To appear in Proc. LICS'98, IEEE Computer Society Press., 1998.

....and observer have unlimited access to registers. To ensure that apart from input and output communication between program and observer is only possible via these registers, we use a type system distinguishing between the capabilities of using a channel in input and output (I O types, cf. [PS93,BS98]) So, if is a free register, we can assign an external observer only the input capability on get and the output capability on put . The corresponding equivalence on calculus processes, for which soundness theorems similar to Theorems 1 and 2 hold, is closer to the observational congruence ....

M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In thirteen LICS Conf. IEEE Computer Society Press, 1998.

No context found.

M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In Proc. 13th LICS Conf. IEEE Computer Society Press, 1998.

No context found.

Boreale, M. and Sangiorgi, D. Bisimulation in name-passing calculi without matching. LICS'98, IEEE, 1998.

No context found.

M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In 13th LICS Conf. IEEE Computer Society Press, 1998.

No context found.

M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In Proc. 13th LICS Conf. IEEE Computer Society Press, 1998.

No context found.

Michele Boreale and D. Sangiorgi. Bisimulation in Name Passing Calculi without Matching. Proceedings of LICS, 1998.

No context found.

M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In Proceedings of LICS'98. IEEE, June 1998.

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