| Amadio, R., Meyssonnier, C.: On the decidability of fragments of the asynchronous -calculus, Proc. EXPRESS01, Electronic Notes in Theoretical Computer Science, 52.1, 2001, Also appeared as RR-INRIA 4241. |
No context found.
Amadio, R., Meyssonnier, C.: On the decidability of fragments of the asynchronous -calculus, Proc. EXPRESS01, Electronic Notes in Theoretical Computer Science, 52.1, 2001, Also appeared as RR-INRIA 4241.
No context found.
R. Amadio, C. Meyssonnier. On the decidability of fragments of the asynchronous -calculus. Journal of Nordic Computing (to appear). Also RRINRIA 4241.
....one that can encrypt or decrypt messages with that key. On the other hand, the condition is not Incidentally, the terminology locality is inspired by the calculus where it means that a thread cannot perform inputs on a received channel name; in our case, keys play the role of channels. See [AM01] for an analysis of the expressive power of name generation in the setting of the calculus. 11 so restrictive on generated nonces, i.e. names that are not used for encryption. In this case a principal that did not generate the nonce can actually use it, e.g. to sign a certain message. An ....
R. Amadio, C. Meyssonnier. On the decidability of fragments of the asynchronous -calculus. Proc. EXPRESS01, Electronic Notes in Theoretical Computer Science, 52.1, 2001. Also appeared as RRINRIA 4241.
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