Skip to main content
SpringerLink
Log in

Trust and Partial Typing in Open Systems of Mobile Agents

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

We present a partially typed semantics for Dπ, a distributed π-calculus. The semantics is designed for mobile agents in open distributed systems in which some sites may harbor malicious intentions. Nonetheless, the semantics guarantees traditional type-safety properties at good locations by using a mixture of static and dynamic type-checking. We show how the semantics can be extended to allow trust between sites, improving performance and expressiveness without compromising type safety.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Abadi, M. and Gordon, A.: A calculus for cryptographic protocols: The spicalculus, Inform. and Comput. 148 (1999), 1–70.

    Article  MATH  MathSciNet  Google Scholar 

  2. Amadio, R.: An asynchronous model of locality, failure, and process mobility, in COORDINATION '97, Lecture Notes in Comput. Sci. 1282, Springer, 1997.

  3. Amadio, R. and Prasad, S.: Localities and failures, in Proc. 14th Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Comput. Sci. 880, Springer, 1994.

  4. Boudol, G., Amadio, R. and Lhoussaine, C.: The receptive distributed pi-calculus, in Proceedings of the FST-TCS '99, 1999, pp. 304–315.

  5. Bugliesi, M., Crafa, S., Merro, M. and Sassone, V.: Communication interference in mobile boxed ambients, in FSTTCS '02: Int. Conf. on Foundations of Software Technology and Theoretical Computer Science, 2002.

  6. Cardelli, L. and Gordon, A. D.: Types for mobile ambients, in Symposium on Principles of Programming Languages, 1999, pp. 79–92.

  7. Cardelli, L. and Gordon, A. D.: Mobile ambients, Theoret. Comput. Sci. 240(1) (2000), 177–213. An extended abstract appeared in Proceedings of FoSSaCS '98, pp. 140–155.

    Article  MATH  MathSciNet  Google Scholar 

  8. Coppo, M., Dezani-Ciancaglini, M., Giovannetti, E. and Salvo, I.: M3: Mobility types for mobile processes in mobile ambients, in Electronic Notes in Theoretical Computer Science, Vol. 70, 2003.

  9. Crary, K., Walker, D. and Morrisett, G.: Typed memory management in a calculus of capabilities, in Twenty-Sixth ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Antonio, Texas, 1999, pp. 262–275.

  10. Fournet, C., Gonthier, G., Levy, J., Marganget, L. and Remy, D.: A calculus of mobile agents, in U. Montanari and V. Sassone (eds.), CONCUR: Proceedings of the International Conference on Concurrency Theory, Lecture Notes in Comput. Sci. 1119, Pisa, 1996, pp. 406–421.

  11. Gorla, D. and Pugliese, R.: Resource access control and dynamic privileges acquision, Technical Report, University of Florence, 2003.

  12. Hennessy, M. and Riely, J.: Type-safe execution of mobile agents in anonymous networks, Computer Science Technical Report 3/98, University of Sussex, 1998. Available from http://www.cogs.susx.ac.uk/.

  13. Hennessy, M. and Riely, J.: Resource access control in systems of mobile agents, Inform. and Comput. 173 (2002), 82–120.

    Article  MATH  MathSciNet  Google Scholar 

  14. Kozen, D.: Efficient code certification, Technical Report 98-1661, Cornell University, Department of Computer Science, 1988. Available from http://www.cs.cornell.edu/kozen/secure.

  15. Milner, R.: The polyadic π-calculus: A tutorial, Technical Report ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, UK, 1991. Also in F. L. Bauer, W. Brauer, and H. Schwichtenberg (eds.), Logic and Algebra of Specification, Springer-Verlag, 1993.

    Google Scholar 

  16. Milner, R., Parrow, J. and Walker, D.: A calculus of mobile processes, Parts I and II, Inform. and Comput. 100 (1992), 1–77.

    Article  MATH  MathSciNet  Google Scholar 

  17. Morrisett, G., Crary, K., Glew, N., Grossman, D., Samuels, R., Smith, F., Walker, D., Weirich, S. and Zdancewic, S.: TALx86: A realistic typed assembly language, in 1999 ACM SIGPLAN Workshop on Compiler Support for System Software, Atlanta, 1999, pp. 25–35.

  18. Morrisett, G., Walker, D., Crary, K. and Glew, N.: From system F to typed assembly language, in Conference Record of the ACM Symposium on Principles of Programming Languages, San Diego, 1998, pp. 85–97.

  19. Necula, G. C.: Proof-carrying code, in Conference Record of POPL '97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Paris, France, 1997, pp. 106–119.

  20. Nicola, R. D., Ferrari, G., Pugliese, R. and Venneri, B.: Types for access control, Theoret. Comput. Sci. 240(1) (2000), 215–254.

    Article  MATH  MathSciNet  Google Scholar 

  21. Pierce, B. and Sangiorgi, D.: Typing and subtyping for mobile processes, Math. Structures in Comput. Sci. 6(5) (1996), 409–454. Extended abstract in LICS '93.

    MATH  MathSciNet  Google Scholar 

  22. DeNicola, R., Ferrari, G. and Pugliese, R.: Klaim: A kernel language for agents interaction and mobility, in IEEE Transactions on Software Engineering, 1998, pp. 315–330.

  23. Riely, J. and Hennessy, M.: Trust and partial typing in open systems of mobile agents (extended abstract), in Conference Record of POPL '99: The 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1999, pp. 93–104.

  24. Sewell, P.:Global/local subtyping for a distributed π-calculus, Technical Report 435, Computer Laboratory, University of Cambridge, 1997.

  25. Yellin, F.: Low-level security in Java, in WWW4 Conference, 1995. Available from http://www.javasoft.com/sfaq/verifier.html.

Download references

Author information

Authors and Affiliations

  1. DePaul, CTI

    James Riely

  2. University of Sussex, UK

    Matthew Hennessy

Authors
  1. James Riely
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthew Hennessy
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Riely, J., Hennessy, M. Trust and Partial Typing in Open Systems of Mobile Agents. Journal of Automated Reasoning 31, 335–370 (2003). https://doi.org/10.1023/B:JARS.0000021016.61054.3b

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:JARS.0000021016.61054.3b

Search

Navigation