Advertisement

A Dependently Typed Ambient Calculus

  • Cédric Lhoussaine
  • Vladimiro Sassone
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2986)

Abstract

The Ambient calculus is a successful model of distributed, mobile computation, and has been the vehicle of new ideas for resource access control. Mobility types have been used to enforce elementary access control policies, expressed indirectly via classification of ambients in groups by means of ‘group types.’ The paper presents a theory of dependent types for the Ambient calculus which allows greater flexibility, while keeping the complexity away from the programmer into the type system.

Keywords

Communication Type Dependent Type Access Control Policy Dynamic Type Typing Context 
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

  1. 1.
    Amtoft, T., Wells, J.: Mobile processes with dependent communication types and singleton types for names and capabilities. Technical Report 2002-3, Kansas State University (2002)Google Scholar
  2. 2.
    Bodei, C., Degano, P., Nielson, F., Nielson, H.R.: Static analysis for the π calculus with applications to security. Information and Computation 168, 68–92 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Bugliesi, M., Castagna, G., Crafa, S.: Boxed ambients. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 38–63. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Cardelli, L., Ghelli, G., Gordon, A.: Ambient groups and mobility types. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol. 1872, pp. 333–347. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  5. 5.
    Cardelli, L., Ghelli, G., Gordon, A.: Secrecy and group creation. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 365–379. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  6. 6.
    Cardelli, L., Gordon, A.: Mobile ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  7. 7.
    Cardelli, L., Gordon, A.: Types for mobile ambients. In: POPL 1999, pp. 79–92. ACM Press, New York (1999)CrossRefGoogle Scholar
  8. 8.
    Coppo, M., Dezani-Ciancaglini, M., Giovannetti, E., Salvo, I.: M3: Mobility types for mobile processes in mobile ambients. In: CAT 2003. Electronic Notes in Theoretical Computer Science, vol. 78. Elsevier, Amsterdam (2003)Google Scholar
  9. 9.
    Degano, P., Levi, F., Bodei, C.: Safe ambients: Control flow analysis and security. In: He, J., Sato, M. (eds.) ASIAN 2000. LNCS, vol. 1961, pp. 199–214. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  10. 10.
    Hennessy, M., Merro, M., Rathke, J.: Towards a behavioural theory of access and mobility control in distributed systems. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol. 2620, pp. 282–298. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  11. 11.
    Lhoussaine, C.: Type inference for a distributed π-calculus. In: Degano, P. (ed.) ESOP 2003. LNCS, vol. 2618, pp. 253–268. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  12. 12.
    Merro, M., Sassone, V.: Typing and subtyping mobility in boxed ambients. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 304–320. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  13. 13.
    Yoshida, N.: Channel dependent types for higher-order mobile processes. In: POPL 2004 (2004) (to appear)Google Scholar
  14. 14.
    Yoshida, N., Hennessy, M.: Assigning types to processes. In: LICS 2000, pp. 334–345 (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Cédric Lhoussaine
    • 1
  • Vladimiro Sassone
    • 1
  1. 1.University of SussexUK

Personalised recommendations