| Jose-Luis Vivas and Mads Dam. From higher-order #-calculus to #-calculus in the presence of static operators. In CONCUR '98: Concurrency Theory. Proceedings of the 9th International Conference, Lecture Notes in Computer Science 1466. Springer-Verlag, 1998. 19 |
....values that themselves name net level channels for communicating strings. We prove that well typed processes cannot go wrong , and deduce that we can omit most of the dynamic checks in the operational semantics. Section 4 of the paper concludes. Related work In earlier work, Vivas and Dam [15] investigate the behaviour of a blocking operator in the calculus: essentially CCS restriction P na, which blocks communication on the single channel a without binding it. Their specific observation is that this breaks Sangiorgi s reduction of the higher order calculus to the first order ....
....be possible to make a connection here to relevant versions of the calculus. For example, if encryption and decryption of messages are represented by communication on channels named by a private key, then carrying these out within a small sandbox area prevents eavesdropping. See Vivas and Dam [15] for an illustration of this using blocking. The ordering of levels immediately suggests notions of subtyping on channels: for example, a net level name might be used in place of a host level name. However, even if this were desirable, it breaks down as soon as we pass around names themselves. ....
J.-L. Vivas and M. Dam. From higher-order -calculus to -calculus in the presence of static operators. In CONCUR '98: Concurrency Theory. Proceedings of the 9th International Conference, Lecture Notes in Computer Science 1466. Springer-Verlag, 1998. 13
No context found.
Jose-Luis Vivas and Mads Dam. From higher-order #-calculus to #-calculus in the presence of static operators. In CONCUR '98: Concurrency Theory. Proceedings of the 9th International Conference, Lecture Notes in Computer Science 1466. Springer-Verlag, 1998. 19
No context found.
Jose-Luis Vivas and Mads Dam. From higher-order #-calculus to #-calculus in the presence of static operators. In CONCUR '98: Concurrency Theory. Proceedings of the 9th International Conference, Lecture Notes in Computer Science 1466. Springer-Verlag, 1998. 16
No context found.
Jose-Luis Vivas and Mads Dam. From higher-order #-calculus to #-calculus in the presence of static operators. In CONCUR '98: Concurrency Theory. Proceedings of the 9th International Conference, Lecture Notes in Computer Science 1466. Springer-Verlag, 1998. 19
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