eprintid: 354 rev_number: 12 eprint_status: archive userid: 32 dir: disk0/00/00/03/54 datestamp: 2011-06-14 10:33:12 lastmod: 2014-01-15 10:32:45 status_changed: 2011-06-14 10:33:12 type: book_section metadata_visibility: show item_issues_count: 0 creators_name: De Nicola, Rocco creators_name: Ferrari, GianLuigi creators_name: Pugliese, Rosario creators_id: r.denicola@imtlucca.it creators_id: creators_id: title: Locality Based Linda: Programming with Explicit Localities ispublished: pub subjects: QA75 divisions: CSA full_text_status: none 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. date: 1997 date_type: published series: Lecture Notes in Computer Science volume: 1214 publisher: Springer pagerange: 712-726 id_number: 10.1007/BFb0030636 refereed: TRUE isbn: 3-540-62781-2 book_title: TAPSOFT '97: Theory and Practice of Software Development editors_name: Bidoit, Michel editors_name: Dauchet, Max official_url: http://dx.doi.org/10.1007/BFb0030636 funders: 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". citation: De Nicola, Rocco and Ferrari, GianLuigi and Pugliese, Rosario Locality Based Linda: Programming with Explicit Localities. In: TAPSOFT '97: Theory and Practice of Software Development. Lecture Notes in Computer Science, 1214 . Springer, pp. 712-726. ISBN 3-540-62781-2 (1997)