Abstract
This paper studies one important aspect of distributed systems, locality, using a calculus of distributed higher-order processes in which not only basic values or channels, but also parameterised processes are transferred across distinct locations. An integration of the subtyping of λ-calculus and IO-subtyping of the π-calculus offers a tractable tool to control the locality of channel names in the presence of distributed higher order processes. Using a local restriction on channel capabilities together with a subtyping relation, locality is preserved during reductions even if we allow new receptors to be dynamically created by instantiation of arbitrary higher-order values and processes. We also show that our method is applicable to more general constraints, based on local and global channel capabilities.
Supported by EPSRC GR/K60701 and CONFER II. E-mail:.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abadi, M. and Gordon, A., The Spi-calculus, Computer and Communications Security, pp. 36–47, ACM Press, 1997.
Amadio, R., Translating Core Facile, ECRC Research Report 944-3, 1994.
Amadio, R., An asynchronousmodel of locality, failure, and processmobility. INRIA Report 3109, 1997.
Boreale, M., On the Expressiveness of Internal Mobility in Name-Passing Calculi, CONCUR’96, LNCS 1119, pp. 163–178, Springer-Verlag, 1996.
Boudol, G., The p-Calculus in Direct Style, POPL’98, pp. 228–241, ACMPress, 1998.
Cardelli, L. and Gordon, A., TypedMobile Ambients, POPL’99, pp. 79–92, ACM Press, 1999.
Chien, A., Concurrent Aggregates, MIT Press, 1993.
Ferreira, W., Hennessy, M. and Jeffrey, M., A Theory ofWeak Bisimulation for Core CML, ICFP, pp. 201–212, ACM Press, 1996. The full version appeared in J. Func. Pro., 8(5):447-491, 1998.
Giacalone, A., Mistra, P. and Prasad, S., Operational and Algebraic Semantics for Facile, ICALP’90, LNCS 443, pp. 765–780, Springer-Verlag, 1990.
Fournet, C., Gonthier, G., Lévy, J.-J., Maranget, L., and Rémy, D., A Calculus for Mobile Agents, CONCUR’ 96, LNCS 1119, pp. 406–421, Springer-Verlag, 1996.
Hartonas, C. and Hennessy, M., Full Abstractness for a Functional/Concurrent Language With HigherOrder Value-Passing, Information and Computation, Vol. 145, pp. 64–106, 1998.
Heintze, N. and Riecke, J., The SLam Calculus: Programming with Secrecy and Integrity, POPL’98, pp. 365–377.ACM Press, 1998.
Hennessy, M. and Riely, J., Resource Access Control in Systems of Mobile Agents, CS Report 02/98, University of Sussex, http://www.cogs.susx.ac.uk, 1998.
Honda, K., Composing Processes, POPL’96, pp. 344–357, ACM Press, 1996.
Honda, K. and Tokoro, M., An Object Calculus for Asynchronous Communication. ECOOP’91, LNCS 512, pp. 133–147, Springer-Verlag 1991.
Honda, K. and Yoshida, N., On Reduction-Based Process Semantics. TCS, pp. 437–486, No.151, NorthHolland, 1995.
Jeffrey, A. and Wakeman, I., SafetyNet. Available from: http://klee.cs.depaul.edu/an/, 1998.
Leth, L. and Thomsen, B., Some Facile Chemistry, ERCC Technical Report, ERCC-92-14, 1992.
Merro, M. and Sangiorgi, D., On asynchrony in name-passing calculi, ICALP’98, LNCS 1443, pp. 856867, Springer-Verlag, 1998.
Milner, R., Parrow, J. G. and Walker, D. J., A Calculus of Mobile Processes. Information and Computation, 100(1), pp. 1–77, 1992.
De Nicola, R., Ferrari, G. and Pugliese, R., Klaim: a Kernel Language for Agents Interaction and Mobility, IEEE Trans. on Software Engineering, Vol.24(5), 1998.
O’Hearn, P., Power, J., Takeyama, M., and Tennent, D., Syntactic Control of Interference Revised, MFPS’97, ENCS, Elsevier, 1997.
Pierce, B. C. and Sangiorgi. D, Typing and subtyping for mobile processes. MSCS, 6(5):409–454, 1996.
Pierce, B. and Turner, D., Pict: A Programming Language Based on the Pi-calculus, Indiana University, CSCI Technical Report, 476, March, 1997.
Riely, J. and Hennessy, M., Trust and Partial Typing in Open Systems of Mobile Agents, CS Technical Report, University of Sussex, 04/98, Available at: http://www.cogs.susx.ac.uk, 1998.
Sangiorgi, D., ExpressingMobility in Process Algebras: First Order and Higher Order Paradigms. Ph.D. Thesis, University of Edinburgh, 1992.
Sangiorgi, D., The name discipline of uniform receptiveness, ICALP’97, LNCS 1256, pp. 303–313, 1997.
Sekiguchi, T. and Yonezawa, A., A calculus with code mobility, IFIP, pp. 21–36, Chapman & Hall, 1997.
Sewell, P., Global/Local Subtyping and Capability Inference for a Distributed π-calculus, ICALP’98, LNCS 1443, pp. 695–706, Springer-Verlag, 1998.
Vasconcelos, V. and Honda, K., Principal Typing Scheme for Polyadic π-Calculus. CONCUR’93, LNCS 715, pp. 524–538, Springer-Verlag, 1993.
Vitek, J. and Castagna, G., A Calculus of Secure Mobile Computations, Available at: http://cuiwww.unige.ch/~jvitek, 1999.
Yoshida, N., Graph Types for Monadic Mobile Processes, FST/TCS’16, LNCS 1180, pp. 371–386, Springer-Verlag, 1996. Full version as LFCS Technical Report, ECS-LFCS-96-350, 1996.
Yoshida, N., Minimality and Separation Results on Asynchronous Mobile Processes: representability theorems by concurrent combinators. CONCUR’98, pp. 131–146, LNCS 1466, Springer-Verlag, 1998. Full version as CS Report 05/98, University of Sussex, Available at: http://www.cogs.susx.ac.uk, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yoshida, N., Hennessy, M. (1999). Subtyping and Locality in Distributed Higher Order Processes. In: Baeten, J.C.M., Mauw, S. (eds) CONCUR’99 Concurrency Theory. CONCUR 1999. Lecture Notes in Computer Science, vol 1664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48320-9_38
Download citation
DOI: https://doi.org/10.1007/3-540-48320-9_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66425-3
Online ISBN: 978-3-540-48320-5
eBook Packages: Springer Book Archive