Abstract
LLinda (Locality based Linda) is a variant of Linda which supports a programming paradigm where agents can migrate from one computing environment to another. In this paper, we define a type system for LLinda that permits statically checking access rights violations of mobile agents. Types are used to describe processes intentions (read, write, execute, ...) relatively to the different localities they are willing to interact with or they want to migrate to. The type system is used to determine the operations that processes want to perform at each locality, to check whether they comply with the declared intentions and whether they have the necessary rights to perform the intended operations at the specific localities.
Work partially supported by EEC: HCM project EXPRESS and Esprit Working Group CONFER2, by CNR Integrated Project “Metodi e Strumenti per la Progettazione e la Verifica di Sistemi Eterogenei Connessi mediante Reti di Comunicazione” and Progetto Speciale “Modelli e Metodi per la Matematica e l'Ingegneria”, and by Istituto di Elaborazione dell'Informazione CNR, Pisa.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
N. Busi, R. Gorrieri, G. Zavattaro. A Process Algebraic View of Linda Coordination Primitives. Theoretical Computer Science. (to appear)
L. Cardelli. A language with distributed scope. Computing Systems, 8(1):27–59, MIT Press, 1995.
N. Carriero, D. Gelernter. Linda in Context. Communications of the ACM, 32(4):444–458, 1989.
P. Ciancarini, R. Gorrieri, G. Zavattaro. Towards a Calculus for Generative Communication. Proc. FMOODS'96, pp.283–297, Chapman & Hall, 1996.
P. Ciancarini, K.K. Jensen, D. Yankelevich. On the Operational Semantics of a Coordination Language. Proc. Object-Based Models and Languages for Concurrent Systems, LNCS 924, pp.77–106, Springer, 1995.
R. De Nicola, G.-L. Ferrari, R. Pugliese. Locality based Linda: programming with explicit localities. Proc. TAPSOFT'97, LNCS 1214, pp.712–726, Springer, 1997.
R. De Nicola, R. Pugliese. A Process Algebra based on Linda. Proc. COORDINATION'96, LNCS 1061, pages 160–178, Springer, 1996.
D. Gelernter. Generative Communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1):80–112, 1985.
A. Giacalone, P. Mishra, S. Prasad. Facile: A symmetric integration of concurrent and functional programming. Int. Journal of Parallel Programming, 18(2), 1989.
A. Ingolfsdottir. Semantic Models for Communicating Processes with Value-Passing. Ph.D. Thesis, University of Edinburgh, 1994.
N. Kobayashi, B. Pierce and D. Turner. Linearity and the π-calculus. In Proc. POPL'96, 1996.
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.
B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. Proc. LICS'93, IEEE-Press, 1993 (to appear in Mathematical Struct. in Comp. Science)
G.D. Plotkin. Lectures notes in domain theory. University of Edinburgh, 1983.
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, 1992.
Sun Microsystems. The Java Language: A white paper. White Paper, 1994.
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.
D. Volpano, G. Smith. A typed-based approach to program security. Proc. TAPSOFT'97, LNCS 1214, pp.607–621, Springer, 1997.
J.E. White. Telescript Technology: The Foundation for the Electronic Market Place. General Magic White Paper, 1994.
General Magic. Telescript Technology: Mobile Agents. White Paper, 1996.
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). Coordinating mobile agents via blackboards and access rights. In: Garlan, D., Le Métayer, D. (eds) Coordination Languages and Models. COORDINATION 1997. Lecture Notes in Computer Science, vol 1282. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63383-9_83
Download citation
DOI: https://doi.org/10.1007/3-540-63383-9_83
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63383-9
Online ISBN: 978-3-540-69527-1
eBook Packages: Springer Book Archive