On the computational strength of pure ambient calculi

Electronic Notes in Theoretical Computer Science

Volumn 96, Issue , 2004, Pages 29-49

  Maffeis, Sergio ^a   Phillips, Iain ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Ambient calculus; Counter machines; Decidability; Mobile ambients; Termination; Turing completeness

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; CONTEXT FREE GRAMMARS; MOBILE COMPUTING; MOBILE TELECOMMUNICATION SYSTEMS; SYNCHRONIZATION; THEOREM PROVING; TURING MACHINES;

AMBIENT CALCULUS; COUNTER MACHINES; MOBILE AMBIENTS; TERMINATION; TURING COMPLETENESS;

COMPUTATIONAL METHODS;

EID: 12444279412     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.04.020     Document Type: Conference Paper

References (24)

1. Boneva I, Talbot J.-M. When ambients cannot be opened. Proceedings of FoSSaCS 2003. Lecture Notes in Computer Science. 2620:2003;169-184
2. Bugliesi M, Castagna G, Crafa S. Boxed ambients. Proceedings of TACS'01. Lecture Notes in Computer Science. 2215:2001;38-63
3. Bugliesi M, Crafa S, Merro M, Sassone V. Communication interference in mobile boxed ambients. Proceedings of FSTTCS'02. Lecture Notes in Computer Science. 2556:2002;71-84
4. Busi N, Zavattaro G. On the expressiveness of movement in pure mobile ambients. Proceedings of F-WAN: Workshop on Foundations of Wide-area Network Computing, Malaga, July 2002. Electronic Notes in Theoretical Computer Science. 66:2002
5. Cardelli L, Gordon A. Mobile ambients. Proceedings FoSSaCS'98. Lecture Notes in Computer Science. 1378:1998;140-155. full version appears as [6]
6. Cardelli L, Gordon A. Mobile ambients. Theoretical Computer Science. 240:2000;177-213
7. Crafa S, Bugliesi M, Castagna G. Information flow security in boxed ambients. Proceedings of F-WAN: Workshop on Foundations of Wide-area Network Computing, Malaga, July 2002. Electronic Notes in Theoretical Computer Science. 66:2002
8. Dershowitz N, Manna Z. Proving termination with multiset orderings. Communications of the Association for Computing Machinery. 22:1979;465-476
9. Finkel A, Schnoebelen P. Well-structured transition systems everywhere! Theoretical Computer Science. 256:2001;63-92
10. Guan L, Yang Y, You J. Making ambients more robust. Proceedings of the International Conference on Software: Theory and Practice, Beijing, China, August 2000. 2000;377-384
11. Hirschkoff D, Lozes E, Sangiorgi D. Separability, expresssiveness, and decidability in the ambient logic. Proceedings of the Seventeenth Annual IEEE Symposium on Logic in Computer Science, LICS 2002. 2002;423-432
12. Kirby L, Paris J. Accessible independence results for Peano arithmetic. Bulletin of the London Mathematical Society. 14:1982;285-293
13. Levi F, Sangiorgi D. Controlling interference in ambients. Proceedings of the 27th Annual Symposium on Principles of Programming Languages, POPL '00. 2000;352-364 ACM
14. Levi F, Sangiorgi D. Mobile safe ambients. ACM Transactions on Programming Languages and Systems. 25:2003;1-69
15. Maffeis, S. and I. Phillips, On the computational strength of pure ambient calculi, Technical Report 2003/10, Department of Computing, Imperial College, London (2003)
16. Merro M, Hennessy M. Bisimulation congruences in safe ambients (extended abstract). Proceedings of the 29th Annual Symposium on Principles of Programming Languages, POPL'02. 2002;71-80 ACM
17. Merro M, Sassone V. Typing and subtyping mobility in boxed ambients. Proceedings of CONCUR'02. Lecture Notes in Computer Science. 2421:2002;304-320
18. Minsky M. Computation: finite and infinite machines. 1967;Prentice-Hall
19. Phillips, A., S. Eisenbach and D. Lister, From process algebra to Java code, in: Proceedings of the ECOOP workshop on Formal Techniques for Java-like programs, Malaga, Spain, 2002, Technical Report NIII-R0204, Computing Science Department, University of Nijmegen
20. Phillips I, Vigliotti M. On reduction semantics for the push and pull ambient calculus. Proceedings of IFIP International Conference on Theoretical Computer Science (TCS 2002), IFIP 17th World Computer Congress, August 2002, Montreal. 2002;550-562
21. Sangiorgi D. Extensionality and intensionality of the ambient logics. Proceedings of POPL'01. 2001;4-17 ACM
22. Shepherdson J, Sturgis J. Computability of recursive functions. Journal of the Association for Computing Machinery. 10:1963;217-255
23. Teller D, Zimmer P, Hirschkoff D. Using ambients to control resources. Proceedings of CONCUR 2002. Lecture Notes in Computer Science. 2421:2002;288-303
24. Zimmer P. On the expressiveness of pure mobile ambients. Proceedings of Express'00. Electronic Notes in Theoretical Computer Science. 39:2001;. URL http://www.elsevier.nl/locate/entcs/volume39.html