{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T06:53:19Z","timestamp":1773557599391,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[2005,10,14]],"date-time":"2005-10-14T00:00:00Z","timestamp":1129248000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1007\/s00236-005-0178-y","type":"journal-article","created":{"date-parts":[[2005,10,11]],"date-time":"2005-10-11T00:39:23Z","timestamp":1128991163000},"page":"227-290","source":"Crossref","is-referenced-by-count":21,"title":["safeDpi: a language for controlling mobile code"],"prefix":"10.1007","volume":"42","author":[{"given":"Matthew","family":"Hennessy","sequence":"first","affiliation":[]},{"given":"Julian","family":"Rathke","sequence":"additional","affiliation":[]},{"given":"Nobuko","family":"Yoshida","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,10,14]]},"reference":[{"key":"178_CR1","doi-asserted-by":"crossref","unstructured":"Boreale, M., Sangiorgi, D.: Bisimulation in name-passing calculi without matching. In Proceedings of 13th LICS Conf, IEEE Computer Society Press (1998)","DOI":"10.1109\/LICS.1998.705653"},{"key":"178_CR2","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Ghelli, G., Gordon, A.: Ambient groups and mobility types. In Proceedings of IFIP TCS 2000, vol. 1872 of Lecture Notes in Computer Science, Springer-Verlag (2000)","DOI":"10.1007\/3-540-44929-9_25"},{"key":"178_CR3","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Gordon, A.: Mobile ambients. In Proceedings of FoSSaCS '98, LNCS, Springer-Verlag (1998)","DOI":"10.1007\/BFb0053547"},{"key":"178_CR4","doi-asserted-by":"crossref","unstructured":"Castagna, G., Nardelli, F.Z.: The Seal calculus revisited: Contextual equivalences and bisimilarity. In Proceedings of FSTTCS, Lecture Notes in Computer Science (2002)","DOI":"10.1007\/3-540-36206-1_9"},{"key":"178_CR5","unstructured":"Castagna, G., Vitek, J., Zappa, F.: The Seal calculus. Available from ftp:\/\/ftp.di.ens.fr\/pub\/users\/castagna\/seal.ps.gz."},{"key":"178_CR6","doi-asserted-by":"crossref","unstructured":"Fournet, C., Gonthier, G., Levy, J.-J., Maranget, L., Remy, D.: A calculus of mobile agents. In Proceedings of CONCUR, vol. 1119 of Lecture notes in computer science, Springer-Verlag (1996)","DOI":"10.1007\/3-540-61604-7_67"},{"key":"178_CR7","unstructured":"Hennessy, M., Merro, M.: Bisimulation congruences in safe ambients. In Proceedings of POPL 02, ACM Press (2002)"},{"key":"178_CR8","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.tcs.2003.12.024","volume":"322","author":"M. Hennessy","year":"2003","unstructured":"Hennessy, M., Merro, M., Rathke, J.: Towards a behavioural theory of access and mobility control in distributed systems. Theoretical Computer Science 322, 615\u2013669 (2003)","journal-title":"Theoretical Computer Science"},{"key":"178_CR9","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1017\/S0960129504004281","volume":"14","author":"M. Hennessy","year":"2004","unstructured":"Hennessy, M., Rathke, J.: Typed behavioural equivalences for processes in the presence of subtyping. Mathematical Structures in Computer Science 14, 651\u2013684 (2004)","journal-title":"Mathematical Structures in Computer Science"},{"key":"178_CR10","doi-asserted-by":"crossref","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 173, 82\u2013120 (2002)","journal-title":"Information and Computation"},{"issue":"2","key":"178_CR11","doi-asserted-by":"crossref","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 152(2), 437\u2013486 (1995)","journal-title":"Theoretical Computer Science"},{"key":"178_CR12","doi-asserted-by":"crossref","unstructured":"Igarashi, A., Kobayashi, N.: Resource usage analysis. In Proceedings of ACM Symposium on Principles of Programming Languages (POPL'02), pp. 331\u2013342 (2002)","DOI":"10.1145\/503272.503303"},{"key":"178_CR13","doi-asserted-by":"crossref","unstructured":"Jeffrey, A., Rathke, J.: Contextual equivalence for higher-order \u03c0-calculus revisited. In Proceedings MFPS XIX, Montreal (2003)","DOI":"10.1016\/S1571-0661(03)50008-1"},{"key":"178_CR14","doi-asserted-by":"crossref","unstructured":"Lhoussaine, C.: Type inference for a distributed pi-calculus. In ESOP'02, vol. 2618 of LNCS, Springer-Verlag, pp. 253\u2013269 (2002)","DOI":"10.1007\/3-540-36575-3_18"},{"key":"178_CR15","doi-asserted-by":"crossref","unstructured":"Merro, M., Nardelli, F.Z.: Bisimulation proof techniques for mobile ambients. In Proceedings of 30th International Colloquium on Automata, Languages, and Programming (ICALP 2003), Eindhoven, Lecture Notes in Computer Science, Springer-Verlag, 2003","DOI":"10.1007\/3-540-45061-0_47"},{"key":"178_CR16","doi-asserted-by":"crossref","unstructured":"Merro, M., Sassone, V.: Typing and subtyping mobility in boxed ambients. In Proceedings CONCUR 02, vol. 1644 of Lecture Notes in Computer Science, Springer-Verlag (2002)","DOI":"10.1007\/3-540-45694-5_21"},{"key":"178_CR17","doi-asserted-by":"crossref","unstructured":"Morrisett, G., Crary, K., Glew, N., Walker, D.: Stack-based typed assembly language. In Types in Compilation, vol. 1473 of Lecture notes in Computer Science, Springer-Verlag, pp. 25\u201335 (1998)","DOI":"10.21236\/ADA358572"},{"key":"178_CR18","doi-asserted-by":"crossref","unstructured":"Necula, G.C.: Proof-carrying code. In Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Program- ming Languages (Paris, France), pp. 106\u2013119 (1997)","DOI":"10.1145\/263699.263712"},{"issue":"3","key":"178_CR19","doi-asserted-by":"crossref","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 47(3), 531\u2013584, (2000)","journal-title":"Journal of the ACM"},{"key":"178_CR20","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/B:JARS.0000021016.61054.3b","volume":"31","author":"J. Riely","year":"2003","unstructured":"Riely, J., Hennessy, M.: Trust and partial typing in open systems of mobile agents. Journal of Automated Reasoning 31, 335\u2013370 (2003)","journal-title":"Journal of Automated Reasoning"},{"key":"178_CR21","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus. Cambridge University Press (2001)"},{"key":"178_CR22","doi-asserted-by":"crossref","unstructured":"Schmitt, A., Stefani, J.-B.: The M-calculus: A higher-order distributed process calculus. In POPL2003 (2003)","DOI":"10.1145\/604131.604136"},{"key":"178_CR23","doi-asserted-by":"crossref","unstructured":"Walker, D.: A type system for expressive security properties. In the twenty seventh ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Boston, pp. 254\u2013267 (2000)","DOI":"10.1145\/325694.325728"},{"key":"178_CR24","doi-asserted-by":"crossref","unstructured":"Yoshida, N.: Channel dependent types for higher-order mobile processes. In Conference Record of POPL '04: The 24th ACM SIGPLAN-SIGACT Sym- posium on Principles of Programming Languages, Venice, Italy (2004)","DOI":"10.1145\/964001.964014"},{"key":"178_CR25","doi-asserted-by":"crossref","unstructured":"Yoshida, N., Hennessy, M.: Subtyping and locality in distributed higher order processes. In Proceedings of CONCUR, vol. 1664 of Lecture notes in computer science, Springer-Verlag (1999)","DOI":"10.1007\/3-540-48320-9_38"},{"key":"178_CR26","first-page":"82","volume":"172","author":"N. Yoshida","year":"2002","unstructured":"Yoshida, N., Hennessy, M.: Assigning types to processes. Information and Computation 172, 82\u2013120 (2002)","journal-title":"Information and Computation"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-005-0178-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-005-0178-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-005-0178-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T07:20:42Z","timestamp":1586503242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-005-0178-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,14]]},"references-count":26,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["178"],"URL":"https:\/\/doi.org\/10.1007\/s00236-005-0178-y","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,14]]}}}