Making components move: A separation of concerns approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2852, Issue , 2003, Pages 487-507

  Pattinson, Dirk ^a   Wirsing, Martin ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; COMPUTATION THEORY; FORMAL METHODS; TOPOLOGY;

ALGEBRAIC THEORIES; COMPUTATIONAL ASPECTS; DISTRIBUTED COMPUTATIONS; DISTRIBUTED STRUCTURES; MOBILE SYSTEMS; PERFECT MATCHES; SEPARATION OF CONCERNS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0142152369     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39656-7_21     Document Type: Article

References (18)

1. F. Arbab. Abstract behaviour types: A foundation model for components and their composition. This Volume.
2. L. Caires and L. Cardelli. A spatial logic for concurrency (part i). In N. Kobayashi and B. Pierce, editors, Proc. TACS 2001, volume 2215 of lecture Notes in Computer Science, pages 1-37. Springer, 2001.
3. L. Caires and L. Cardelli. A spatial logic for concurrency (part i). In L. Brim, P. Janc̀ar, M. Kr̀etìnskỳ, and A. Kuc̀era, editors, Proc. CONCUR 2002, volume 2421 of Lecture Notes in Computer Science. Springer, 2002.
4. L. Cardelli and A. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In Proc. POPL 2000, pages 365-377. ACM, 2000.
5. L. Cardelli and A. Gordon. Mobile ambients. Theor. Comp. Sci., 240(1):177-213, 2000.
6. D. Gabbay and A. Pitts. A new approach to abstract syntax involving binders. In 14th IEEE Symposium on Logic in Computer Science (LICS 1999), pages 214-224. IEEE Computer Society, 1999.
7. M. Hennessy and R. Milner. Algebraic Laws for Non-determinism and Concurrency. Journal of the ACM, 32:137-161, 1985.
8. R. Milner. Communicating and Mobile Systems: the π-Calculus. Cambridge University Press, 1999.
9. U. Montanari and V. Sassone. Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae, 16(2): 171-199, 1992.
10. R. De Nicola, G. Ferrari, and R. Pugliese. Klaim: a kernel language for agents interaction and mobility. IEEE Trans. Software Engineering, 24(5):315-330, 1998.
11. O. Nierstrasz and F. Achermann. A calculus for modelling software components. This Volume.
12. J. Parrow and B. Victor. The fusion calculus: Expressiveness and symmetry in mobile processes. In Thirteenth Annual Symposium on Logic in Computer Science (LICS 1998), pages 176-185. IEEE, IEEE Computer Society, 1998.
13. D. Sangiorgi. From π-calculus to Higher-Order π-calculus - and back. In M.-C. Gaudel and J.-P. Jouannaud, editors, Proc. TAPSOFT 93, volume 668 of Lect. Notes in Comp. Sci., pages 151-166, 1993.
14. D. Sangiorgi. Extensionality and intensionality of the ambient logics. In Proc. POPL 2001, pages 4-13. ACM, 2001.
15. D. Sangiorgi. Separability, expressiveness, and decidability in the ambient logic. In 17th IEEE Symposium on Logic in Computer Science (LICS 2002). IEEE Computer Society, 2002.
16. Davide Sangiorgi and David Walker. The π-calculus: a Theory of Mobile Processes. Cambridge University Press, 2001.
17. J. Vitek and G. Castagna. Seal: A framework for secure mobile computation. Internet Programming, 1999.
18. P. Wojciechowski and P. Sewell. Nomadic pict: Language and infrastructure design for mobile agents. IEEE Concurrency, 8(2):42-52, 2000.