Abstract
In this paper, we propose a higher order safe ambients calculus. In this setting, we propose an extended labelled transition system and an extended labelled bisimulation for this calculus. We also give the reduction barbed congurence and prove the equivalence of extended labelled bisimulation and reduction barbed congruence for this calculus.
This work was supported by the National Natural Science Foundation of China under Grants No. 60873025, the Natural Science Foundation of Jiangsu Province of China under Grant No. BK2008389, the Foundation of Provincial Key Laboratory for Computer Information Processing Technology of Soochow University under Grant No. KJS0920, and the Aviation Science Fund of China under Grant No. 20085552023.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bugliesi, M., Castagna, G., Crafa, S.: Boxed ambients. In: Kobayashi, N., Babu, C. S. (eds.) TACS 2001. LNCS, vol. 2215. Springer, Heidelberg (2001)
Coppo, M., Dezani-Ciangcaglini, M.: A fully abstract model for higher-order ambients. In: Cortesi, A. (ed.) VMCAI 2002. LNCS, vol. 2294, pp. 255–271. Springer, Heidelberg (2002)
Cardelli, L., Gordon, A.: Mobile ambients. Theoretical Computer Science 240(1), 177–213 (2000); An extended abstract appeared in Proc. of FoSSaCS 1998
Levi, F., Sangiorgi, D.: Controlling interference in ambients. In: Proc. 27th Symposium on Principles of Programming Languages. ACM Press, New York (2000)
Levi, F., Sangiorgi, D.: Mobile safe ambients. ACM Transactions on Programming Languages and Systems 25(1), 1–69 (2003)
Merro, M., Hennessy, M.: A Bisimulation-based Semantic Theory of Safe Ambients. ACM Transactions on Programming Languages and Systems 28(2), 290–330 (2006)
Merro, M., Zappa Nardelli, F.: Bisimulation proof methods for mobile ambients. In: Baeten, J.C.M., et al. (eds.) ICALP 2003. LNCS, vol. 2719. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cao, Z. (2011). On the Operational Semantics of a Higher Order Safe Ambients Calculus. In: Zhou, Q. (eds) Theoretical and Mathematical Foundations of Computer Science. ICTMF 2011. Communications in Computer and Information Science, vol 164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24999-0_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-24999-0_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24998-3
Online ISBN: 978-3-642-24999-0
eBook Packages: Computer ScienceComputer Science (R0)