On reduction semantics for the Push and Pull Aambient Calculus

IFIP Advances in Information and Communication Technology

Volumn 96, Issue , 2002, Pages 550-563

  Phillips, Iain ^a   Vigliotti, Maria Grazia ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER HARDWARE DESCRIPTION LANGUAGES; DIFFERENTIATION (CALCULUS); SEMANTICS;

AMBIENT CALCULUS; COMPUTATIONAL POWER; EQUATIONAL THEORY; MOBILE AMBIENTS; OPERATIONAL SEMANTICS; PI CALCULUS; REDUCTION SEMANTICS; SECURITY ISSUES;

CALCULATIONS;

EID: 84891063065     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: None     Document Type: Article

References (15)

1. T. Amtoft, A.J. Kfoury, and S.M. Pericas-Geertsen. What are polymorphically-typed ambients? In Proceedings of ESOP'OJ, volume 2028 of Lectures Notes in Computer Science, pages 206-220. Springer-Verlag, 2001.
2. L. Cardelli, G. Ghelli, and A.D. Gordon. Mobility types for Mobile Ambients. In Proceedings of JCALP'99, volume 1644 of Lectures Notes in Computer Science, pages 230-239. Springer-Verlag, 1999.
3. L. Cardelli and A.D. Gordon. Mobile ambients. In Proceedings of FoSSaCS'98, volume 1378 of Lectures Notes in Computer Science, pages 140-155. Springer-Verlag, 1998. Also Theoretical Computer Science, 240(1), 177-213,2000
4. L. Cardelli and A.D. Gordon. Types for Mobile Ambients. In Proceedings of POPL '99, pages 79-92. ACM, January 1999.
5. C. Fournet and G. Gonthier. A hierarchy of equivalences for asynchronous calculi. In Proceedings of ICALP'98, volume 1443 of Lectures Notes in Computer Science, pages 844-855. Springer-Verlag, 1998.
6. A.D. Gordon and L. Cardelli. Technical annex. Available at: www.adg.com/, 1998.
7. A.D. Gordon and L. Cardelli. Equational Properties of mobile ambients. In Proceedings of FoSSaCS'99, volume 1578 of Lectures Notes in Computer Science, pages 212-226. Springer-Verlag, 1999.
8. K. Honda and M. Tokoro. An object calculus for asynchronous communication. In Proceedings of ECOOP '91, volume 512 of Lectures Notes in Computer Science, pages 133-147. Springer-Verlag, 1991.
9. K. Honda and N. Yoshida. On the reduction-based process semantics. Theoretical Computer Science, 151:437-486, 1995.
10. F. Levi and D. Sangiorgi. Controlling Interference for Ambients. In Proceedings of POPL'OO, pages 352-364. ACM, 2000. Extended version available at: wwwsop.inria.fr/meije/personnel/Davide.Sangiorgi.
11. M. Merro and M. Hennessy. Bisimulation congruences in Safe Ambients. In Proceedings of POPL'02. ACM, 2002. To appear.
12. R. Milner and D. Sangiorgi. Barbed Bisimulation. In Proceedings of ICALP, volume 623 of Lectures Notes in Computer Science, pages 685-695. Springer-Verlag, 1992.
13. H.R. Nielson and F. Nielson. Validating firewalls in mobile ambients. In Proceedings of CONCUR'99, volume 1664 of Lectures Notes in Computer Science, pages 463-477. Springer-Verlag, 1999.
14. D. Sangiorgi. Expressing mobility in Process Algebra: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh, 1993.
15. M.G. Vigliotti. Transition Systems for the Ambient Calculus. Master's thesis, Imperial College, 1999.