The Kell calculus: A family of higher-order distributed process calculi

Lecture Notes in Computer Science

Volumn 3267, Issue , 2005, Pages 146-178

  Schmitt, Alan ^a   Stefani, Jean Bernard ^a  

^a INRIA RHÔNE ALPES   (France)

Author keywords

Ambients; Components; Distributed programming; Higher order bisimulation; Higher order languages; Mobile code; Process calculi

Indexed keywords

COMPUTER AIDED DESIGN; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; MATHEMATICAL MODELS; NETWORK COMPONENTS; OPERATIONS RESEARCH; SEMANTICS;

AMBIENTS; DISTRIBUTED PROGRAMMING; HIGHER-ORDER BISIMULATION; HIGHER-ORDER LANGUAGES; MOBILE CODES; PROCESS CALCULI;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 23944449086     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31794-4_9     Document Type: Conference Paper

References (39)

1. J. Aldrich, C. Chambers, and D. Notkin. Architectural Reasoning in ArchJava. In Proceedings 16th European Conference on Object-Oriented Programming (ECOOP), 2002.
2. R. Amadio. An asynchronous model of locality, failure, and process mobility. Technical report, INRIA RR-3109, INRIA Sophia-Antipolis, France, 1997.
3. F. Barbanera, M. Bugliesi, M. Dezani-Ciancaglini, and V. Sassone. A calculus of bounded capacities. In ASIAN 03, volume 2896 of LNCS, pages 205-223. Springer, 2003.
4. G. Boudol. A Generic Membrane Model, this volume, 2004.
5. E. Bruneton, V. Quéma T. Coupaye, M. Leclercq, and J.B. Stefani. An Open Component Model and its Support in Java. In Proceedings 7th International Symposium on Component-based Software Engineering (CBSE 2004), LNCS 3054. Springer, 2004.
6. M. Bugliesi, G. Castagna, and S. Crafa. Boxed ambients. In 4th International Symposium on Theoretical Aspects of Computer Software (TACS), 2001.
7. M. Bugliesi, S. Crafa, M. Merro, and V. Sassone. Communication Interference in Mobile Boxed Ambients. In Proceedings of the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FST-TCS '02, volume LNCS 2556. Springer, 2002.
8. M. Carbone and S. Maffeis. On the Expressive Power of Polyadic Synchronization in π-calculus. Electronic Notes in Theorectical Computer Science, vol. 68, no 2, 2002.
9. L. Cardelli and A. Gordon. Mobile Ambients. Theoretical Computer Science, vol. 240, no 1, 2000.
10. G. Castagna and F. Zappa. The Seal Calculus Revisited. In Proceedings 22th Conference on the Foundations of Software Technology and Theoretical Computer Science, number 2556 in LNCS. Springer, 2002.
11. I. Castellani. Process algebras with localities. In Handbook of Process Algebra, J. Bergstra, A. Ponse and S. Smolka (eds). Elsevier, 2001.
12. D. Clarke and T. Wrigstad. External Uniqueness is Unique Enough. In Proceedings 17th European Conference on Object-Oriented Programming (ECOOP), 2003.
13. 3: Mobility types for mobile processes in mobile ambients. In CATS 2003), volume 78 of ENTCS, 2003.
14. S. Dal-Zilio. Mobile Processes: A Commented Bibliography. In Modeling and Verification of Parallel Processes, 4th Summer School, MOVEP 2000, volume 2067 of LNCS. Springer, 2001.
15. C. Fournet. The Join-Calculus. PhD thesis, Ecole Polytechnique, Palaiseau, France, 1998.
16. C. Fournet, G. Gonthier, J.J. Levy, L. Maranget, and D. Remy. A calculus of mobile agents. In In Proceedings 7th International Conference on Concurrency Theory (CONCUR '96), Lecture Notes in Computer Science 1119. Springer Verlag, 1996.
17. J.C. Godskesen, T. Hildebrandt, and V. Sassone. A calculus of mobile resources. In Proceedings 13th International Conference on Concurrency Theory (CONCUR 02), 2002.
18. M. Hennessy, J. Rathke, and N. Yoshida. Safedpi: a language for controlling mobile code. Technical Report 2003:02, University of Sussex, 2003. Extended abstract presented at Foundations of Software Science and Computation Structures - 7th International Conference, FOSSACS 2004.
19. M. Hennessy and J. Riely. Resource access control in systems of mobile agents. Technical report, Technical Report 2/98 - School of Cognitive and Computer Sciences, University of Sussex, UK, 1998.
20. A. Jeffrey and J. Rathke. Contextual equivalence for higher-order π-calculus revisited. In Proceedings, 19th Conference on the Mathematical Foundations of Programming Semantics, 2003.
21. G. Leavens and M. Sitaraman (eds). Foundations of Component-Based Systems. Cambridge University Press, 2000.
22. L. Leth and B. Thomsen. Some facile chemistry. Formal Aspects of Computing Vol.7, No 3, 1995.
23. F. Levi and D. Sangiorgi. Controlling interference in ambients. In Proceedings 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2000), 2000.
24. N. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
25. N. Medvidovic and R. N. Taylor. A Classification and Comparison Framework for Software Architecture Description Languages. IEEE Transactions on Software Engineering, vol. 26, no. 1, 2000.
26. M. Merro and M. Hennessy. Bisimulation congruences in safe ambients. In 29th ACM Symposium on Principles of Programming Languages (POPL), Portland, Oregon, 16-18 January, 2002.
27. R. Milner. Communicating and mobile systems: the π-calculus. Cambridge University Press, 1999.
28. R. De Nicola, G.L. Ferrari, and R. Pugliese. Klaim: a Kernel Language for Agents Interaction and Mobility. IEEE Trans. on Software Engineering, Vol. 24, no 5, 1998.
29. R. De Nicola, G.L. Ferrari, R. Pugliese, and B. Venneri. Types for Access Control. Theoretical Computer Science, Vol. 240, no 1, 2000.
30. A. Ravara, A. Matos, V. Vasconcelos, and L. Lopes. Lexically scoping distribution: what you see is what you get. In FGC: Foundations of Global Computing, volume 85(1) of ENTCS. Elsevier, 2003.
31. D. Sangiorgi. Bisimulation for higher-order process calculi. Information and Computation, 131, No 2, 1996.
32. D. Sangiorgi and D. Walker. The π-calculus: A Theory of Mobile Processes. Cambridge University Press, 2001.
33. A. Schmitt and J.B. Stefani. The M-calculus: A Higher-Order Distributed Process Calculus. In Proceedings 30th Annual ACM Symposium on Principles of Programming Languages (POPL), 2003.
34. P. Sewell and J. Vitek. Secure Composition of Insecure Components. Journal of Computer Security, 2000. Invited submission for a CSFW00 special issue.
35. J.B. Stefani. A calculus of kells. In Vladimiro Sassone, editor, Proceedings International Workshop on Foundations of Global Computing, Electronic Notes in Theoretical Computer Science, volume 85(1). Elsevier, 2003.
36. B. Thomson. A Theory of Higher Order Communicating Systems. Information and Computation, Vol. 116, No 1, 1995.
37. Vasco T. Vasconcelos. A note on a typing system for the higher-order π-calculus. September 1993.
38. P. Wojciechowski and P. Sewell. Nomadic Pict: Language and Infrastructure. IEEE Concurrency, vol. 8, no 2, 2000.
39. N. Yoshida and M. Hennessy. Assigning types to processes. In 15th Annual IEEE Symposium on Logic in Computer Science (LICS), 2000.