{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:46Z","timestamp":1761611266656},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212980"},{"type":"electronic","value":"9783540247272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_18","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:06:41Z","timestamp":1280761601000},"page":"241-256","source":"Crossref","is-referenced-by-count":15,"title":["safeDpi: A Language for Controlling Mobile Code"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Hennessy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian","family":"Rathke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuko","family":"Yoshida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Boreale, M., Sangiorgi, D.: Bisimulation in name-passing calculi without matching. In: Proc. 13th LICS Conf. IEEE Computer Society Press, Los Alamitos (1998)","DOI":"10.1109\/LICS.1998.705653"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-44929-9_25","volume-title":"Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L., Ghelli, G., Gordon, A.: Ambient groups and mobility types. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol.\u00a01872, p. 333. Springer, Heidelberg (2000)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/BFb0053547","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Cardelli","year":"1998","unstructured":"Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol.\u00a01378, pp. 140\u2013155. Springer, Heidelberg (1998)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Castagna, G., Nardelli, F.Z.: The Seal calculus revisited: Contextual equivalences and bisimilarity. In: Proc. of FSTTCS. LNCS (2002)","DOI":"10.1007\/3-540-36206-1_9"},{"key":"18_CR5","unstructured":"Castagna, G., Vitek, J., Nardelli, F.Z.: The Seal calculus (2003), Available from ftp:\/\/ftp.di.ens.fr\/pub\/users\/castagna\/seal.ps.gz"},{"key":"18_CR6","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/3-540-61604-7_67","volume-title":"CONCUR '96: Concurrency Theory","author":"C\u00e9dric Fournet","year":"1996","unstructured":"Fournet, C., Gonthier, G., Levy, J.-J., Maranget, L., Remy, D.: A calculus of mobile agents. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119. Springer, Heidelberg (1996)"},{"key":"18_CR7","unstructured":"Hennessy, M., Merro, M.: Bisimulation congruences in safe ambients. In: Proc. POPL 2002, the 29th ACM Symposium on Principles of Programming Languages. ACM Press, New York (2002)"},{"key":"18_CR8","first-page":"282","volume-title":"Lecture Notes in Computer Science","author":"Matthew Hennessy","year":"2003","unstructured":"Hennessy, M., Merro, M., Rathke, J.: Towards a behavioural theory of access and mobility control in distributed systems. Technical Report 2002:01, COGS, University of Sussex (2002), Extended Abstract published in the Proc. of FoSSaCS (2003)"},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S1571-0661(04)00309-3","volume":"61","author":"Matthew Hennessy","year":"2002","unstructured":"Hennessy, M., Rathke, J.: Typed behavioural equivalences for processes in the presence of subtyping. In: Harland, J. (ed.) Proc. CATS 2002, Computing: Australasian Theory Symposium. Electronic Notes in Computer Science, vol.\u00a061, Elsevier Science Publishers, Amsterdam (2002), To appear in Mathematical Structures in Computer Science","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"18_CR10","unstructured":"Hennessy, M., Rathke, J., Yoshida, N.: The full version of this paper. Technical Report 2003:02, Department of Informatics, University of Sussex (2003), available from www.cogs.susx.ac.uk\/julianr\/"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1006\/inco.2001.3089","volume":"173","author":"M. Hennessy","year":"2002","unstructured":"Hennessy, M., Riely, J.: Resource access control in systems of mobile agents. Information and Computation\u00a0173, 82\u2013120 (2002)","journal-title":"Information and Computation"},{"issue":"2","key":"18_CR12","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","volume":"152","author":"K. Honda","year":"1995","unstructured":"Honda, K., Yoshida, N.: On reduction-based process semantics. Theoretical Computer Science\u00a0152(2), 437\u2013486 (1995)","journal-title":"Theoretical Computer Science"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Igarashi, A., Kobayashi, N.: Resource usage analysis. In: Proc. of POPL 2002, the 29th ACM Symposium on Principles of Programming Languages, pp. 331\u2013342 (2002)","DOI":"10.1145\/565816.503303"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/3-540-36575-3_18","volume-title":"Programming Languages and Systems","author":"C. Lhoussaine","year":"2003","unstructured":"Lhoussaine, C.: Type inference for a distributed pi-calculus. In: Degano, P. (ed.) ESOP 2003. LNCS, vol.\u00a02618, pp. 253\u2013268. Springer, Heidelberg (2003)"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Merro, M., Nardelli, F.Z.: Bisimulation proof techniques for mobile ambients. In: Proc. 30th International Colloquium on Automata, Languages, and Programming (ICALP 2003), Eindhoven. LNCS, Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-45061-0_47"},{"key":"18_CR16","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/3-540-45694-5_21","volume-title":"CONCUR 2002 \u2014 Concurrency Theory","author":"Massimo Merro","year":"2002","unstructured":"Merro, M., Sassone, V.: Typing and subtyping mobility in boxed ambients. In: Proc. CONCUR 2002. LNCS, vol.\u00a01644. Springer, Heidelberg (2002)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BFb0055511","volume-title":"Types in Compilation","author":"G. Morrisett","year":"1998","unstructured":"Morrisett, G., Crary, K., Glew, N., Walker, D.: Stack-based typed assembly language. In: Leroy, X., Ohori, A. (eds.) TIC 1998. LNCS, vol.\u00a01473, pp. 28\u201352. Springer, Heidelberg (1998)"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Necula, G.C.: Proof-carrying code. In: Proc. of POPL 1997, the 24th ACM Symposium on Principles of Programming Languages, Paris, pp. 106\u2013119 (1997)","DOI":"10.1145\/263699.263712"},{"issue":"3","key":"18_CR19","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1145\/337244.337261","volume":"47","author":"B. Pierce","year":"2000","unstructured":"Pierce, B., Sangiorgi, D.: Behavioral equivalence in the polymorphic pi-calculus. Journal of the ACM\u00a047(3), 531\u2013584 (2000)","journal-title":"Journal of the ACM"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Riely, J., Hennessy, M.: Trust and partial typing in open systems of mobile agents (extended abstract). In: Proc. of POPL 1999, the 26th ACM Symposium on Principles of Programming Languages, pp. 93\u2013104 (1999) (To appear in the Journal of Automated Reasoning)","DOI":"10.1145\/292540.292551"},{"key":"18_CR21","volume-title":"The \u03c0-calculus","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus. Cambridge University Press, Cambridge (2001)"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Walker, D.: A type system for expressive security properties. In: Proc. Popl 2000, the 27th ACM Symposium on Principles of Programming Languages, Boston, pp. 254\u2013267 (2000)","DOI":"10.1145\/325694.325728"},{"key":"18_CR23","first-page":"82","volume":"172","author":"N. Yoshida","year":"2002","unstructured":"Yoshida, N., Hennessy, M.: Assigning types to processes. Information and Computation\u00a0172, 82\u2013120 (2002)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24727-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:23:26Z","timestamp":1559359406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}