Advertisement

Coordinating mobile agents via blackboards and access rights

  • Rocco De Nicola
  • GianLuigi Ferrari
  • Rosario Pugliese
Regular Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1282)

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.

Keywords

Type System Mobile Agent Operational Semantic Structural Rule Typing Rule 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    N. Busi, R. Gorrieri, G. Zavattaro. A Process Algebraic View of Linda Coordination Primitives. Theoretical Computer Science. (to appear)Google Scholar
  2. 2.
    L. Cardelli. A language with distributed scope. Computing Systems, 8(1):27–59, MIT Press, 1995.Google Scholar
  3. 3.
    N. Carriero, D. Gelernter. Linda in Context. Communications of the ACM, 32(4):444–458, 1989.CrossRefGoogle Scholar
  4. 4.
    P. Ciancarini, R. Gorrieri, G. Zavattaro. Towards a Calculus for Generative Communication. Proc. FMOODS'96, pp.283–297, Chapman & Hall, 1996.Google Scholar
  5. 5.
    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.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    R. De Nicola, R. Pugliese. A Process Algebra based on Linda. Proc. COORDINATION'96, LNCS 1061, pages 160–178, Springer, 1996.Google Scholar
  8. 8.
    D. Gelernter. Generative Communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1):80–112, 1985.CrossRefGoogle Scholar
  9. 9.
    A. Giacalone, P. Mishra, S. Prasad. Facile: A symmetric integration of concurrent and functional programming. Int. Journal of Parallel Programming, 18(2), 1989.Google Scholar
  10. 10.
    A. Ingolfsdottir. Semantic Models for Communicating Processes with Value-Passing. Ph.D. Thesis, University of Edinburgh, 1994.Google Scholar
  11. 11.
    N. Kobayashi, B. Pierce and D. Turner. Linearity and the π-calculus. In Proc. POPL'96, 1996.Google Scholar
  12. 12.
    R. Milner. Communication and Concurrency. Prentice Hall Int., 1989.Google Scholar
  13. 13.
    R. Milner, J. Parrow, D. Walker. A calculus of mobile processes, (Part I and II). Information and Computation, 100:1–77, 1992.CrossRefGoogle Scholar
  14. 14.
    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)Google Scholar
  15. 15.
    G.D. Plotkin. Lectures notes in domain theory. University of Edinburgh, 1983.Google Scholar
  16. 16.
    R. Pugliese. Semantic Theories for Asynchronous Languages. Ph.D. Thesis VIII-96-6, Univ. di Roma “La Sapienza”, Dip. Scienze dell'Informazione, 1996.Google Scholar
  17. 17.
    J. Reppy. Higher Order Concurrency. Ph.D. Thesis, Cornell University, 1992.Google Scholar
  18. 18.
    Sun Microsystems. The Java Language: A white paper. White Paper, 1994.Google Scholar
  19. 19.
    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.Google Scholar
  20. 20.
    D. Volpano, G. Smith. A typed-based approach to program security. Proc. TAPSOFT'97, LNCS 1214, pp.607–621, Springer, 1997.Google Scholar
  21. 21.
    J.E. White. Telescript Technology: The Foundation for the Electronic Market Place. General Magic White Paper, 1994.Google Scholar
  22. 22.
    General Magic. Telescript Technology: Mobile Agents. White Paper, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Rocco De Nicola
    • 1
  • GianLuigi Ferrari
    • 2
  • Rosario Pugliese
    • 1
  1. 1.Dipartimento di Sistemi e InformaticaUniversity di FirenzeItaly
  2. 2.Dipartimento di InformaticaUniversity di PisaItaly

Personalised recommendations