Abstract
In this paper we investigate the issue of defining a programming calculus which supports programming with explicit localities. We introduce a language which embeds the asynchronous Linda communication paradigm extended with explicit localities in a process calculus. We consider multiple tuple spaces that are distributed over a collections of sites and use localities to distribute/retrieve tuples and processes over/from these sites. The operational semantics of the language turns out to be useful for discussing the language design, e.g. the effects of scoping disciplines over mobile agents which maintain their connections to the located tuple spaces while moving along sites. The flexibility of the language is illustrated by a few examples.
Work partially supported by EEC: HCM project EXPRESS and Esprit Working Group CONFER2, and by CNR: Progetto Speciale “Modelli e Metodi per la Matematica e l'Ingegneria”.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Amadio, I. Castellani, D. Sangiorgi. On Bisimulation for the Asynchronous π-calculus. In Proc. of CONCUR'96, LNCS 1119, 1996.
R. Amadio, S. Prasad. Localities and Failures. In Proc. of FCT&TCS 14 LNCS 880, 1994.
E. Astesiano, G. Reggio. SMoLCS Driven Concurrent Calculi In Proc. of TAPSOFT'87, LNCS 249, 1987.
G. Berry, G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217–248, 1992.
G. Boudol, I. Castellani, M. Hennessy, A. Kiehn. Observing Localities. Theoretical Computer Science, 114, 1993.
F. Corradini, R. De Nicola. Locality Based Semantics for Process Algebras. Report DSI-94-05, Univ. Roma, La Sapienza, 1994 (to appear in Acta Informatica).
L. Cardelli. A language with distributed scope. Computing Systems, 8(1):27–59, MIT Press, 1995.
L. Cardelli. Global Computation. Manuscript, 1996.
N. Carriero, D. Gelernter. Linda in Context. Communications of the ACM, 32 (4): 444–458, 1989.
R. De Nicola, R. Pugliese. A Process Algebra based on Linda. Proc. COORDINATION'96, LNCS 1061, 1996.
C. Fournet, G. Gonthier, J.-L. Levy, L. Maranget, D. Rémy. A Calculus of Mobile Agents. Proc. CONCUR'96, LNCS 1119, 1996.
D. Gelernter. Generative Communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1):80–112, 1985.
D. Gelernter. Multiple Tuple Spaces in Linda. PARLE'89, LNCS 365, 1989.
A. Giacalone, P. Mishra, S. Prasad. Facile: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2), 1989.
M. Hennessy, H. Lin. Symbolic Bisimulations, Theoretical Computer Science, 138:353–389, 1995.
Sun Microsystems. The Java Language: A white paper. Sun Microsystems White Paper, 1994.
J. Leitcher. Shared Memories, Buses and LANs — Linda Implementations Across the Spectrum of Connectivity. Dep. of Computer Science, Yale Univ., Research Report YALEU/DCS/TR-714, 1989.
R. Milner. Communication and Concurrency. Prentice Hall Int., 1989.
R. Milner, J. Parrow, D. Walker. A calculus of mobile processes, (Part I and II). Information and Computation, 100:1–77, 1992.
D. Murphy. Observing Located Concurrency. MFCS'93, LNCS 711, 1993.
B. Pierce, D. Turner. Concurrent Objects in a Process Calculus. In “Theory and Practice of Parallel Programming”, LNCS 907, 1994.
G.D. Plotkin. A Structural Approach to Operational Semantics. Tech.Rep. DAIMI FN-19, Aarhus University, Dep. of Computer Science, 1981.
R. Pugliese. Semantic Theories for Asynchronous Languages. Ph.D. Thesis VIII-96-6, Univ. di Roma “La Sapienza”, Dip. Scienze dell'Informazione, 1996.
J. Reppy. Higher Order Concurrency. Ph.D. Thesis, Cornell University, Tr-92-1285, 1992.
B. Thomsen, L. Leth, A. Giacalone. Some Issues in the Semantics of Facile Distributed Programming. REX Workshop “Semantics: Foundations and Applications”, LNCS 666, Springer, 1992.
J.E. White. Telescript Technology: The Foundation for the Electronic Market Place. General Magic White Paper, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Nicola, R., Ferrari, G., Pugliese, R. (1997). Locality based Linda: Programming with explicit localities. In: Bidoit, M., Dauchet, M. (eds) TAPSOFT '97: Theory and Practice of Software Development. CAAP 1997. Lecture Notes in Computer Science, vol 1214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030636
Download citation
DOI: https://doi.org/10.1007/BFb0030636
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62781-4
Online ISBN: 978-3-540-68517-3
eBook Packages: Springer Book Archive