{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:34:47Z","timestamp":1725492887448},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540661306"},{"type":"electronic","value":"9783540487494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48749-2_5","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T12:22:57Z","timestamp":1192796577000},"page":"95-115","source":"Crossref","is-referenced-by-count":10,"title":["Type-Safe Execution of Mobile Agents in Anonymous Networks"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Hennessy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Riely","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"M. Abadi and A.D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, To appear. Available as Compaq SRC Research Report 149 (1998)."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"B. Bershad, B. Savage, P. Pardyak, E. Sirer, D. Becker, M. Fiuczynski, C. Chambers, and S. Eggers. Extensibility, safety and performance in the SPIN operating system. In Symposium on Operating Systems Principles, pages 267\u2013284, 1997.","DOI":"10.1145\/224057.224077"},{"key":"5_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/BFb0053547","volume-title":"Foundations of Software Science and Computational Structures","author":"L. Cardelli","year":"1998","unstructured":"L. Cardelli and A.D. Gordon. Mobile ambients. In Foundations of Software Science and Computational Structures, volume 1378 of Lecture Notes in Computer Science, pages 140\u2013155. Berlin: Springer-Verlag, 1998."},{"key":"5_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Secure Internet Programming: Security Issues for Distributed and Mobile Objects","author":"R. DeNicola","year":"1999","unstructured":"R. DeNicola, G. Ferrari, and R. Pugliese. Types as specifications of access policies. In J. Vitek and C. Jensen, editors, Secure Internet Programming: Security Issues for Distributed and Mobile Objects, Lecture Notes in Computer Science. Springer-Verlag, 1999."},{"key":"5_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/3-540-61604-7_67","volume-title":"CONCUR: Proceedings of the International Conference on Concurrency Theory","author":"C. Fournet","year":"1996","unstructured":"C. Fournet, G. Gonthier, J.J. Levy, L. Marganget, and D. Remy. A calculus of mobile agents. In U. Montanari and V. Sassone, editors, CONCUR: Proceedings of the International Conference on Concurrency Theory, volume 1119 of Lecture Notes in Computer Science, pages 406\u2013421, Pisa, August 1996. Berlin: Springer-Verlag."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"M. Hennessy and J. Riely. Resource access control in systems of mobile agents. In U. Nestmann and B. Pierce, editors, 3rd International Workshop on High-Level Concurrent Languages (HLCL\u201998), volume 16(3) of Electronic Notes in Theoretical Computer Science, Nice, September 1998. Elsevier. Available from http:\/\/www.elsevier.nl\/locate\/entcs . Full version available as Sussex CSTR 98\/02, 1998. Available from http:\/\/www.cogs.susx.ac.uk\/ .","DOI":"10.1016\/S1571-0661(04)00141-0"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"X. Leroy and F. Rouaix. Security properties of typed applets. In Conference Record of the ACM Symposium on Principles of Programming Languages, San Diego, January 1998. ACM Press.","DOI":"10.1145\/268946.268979"},{"key":"5_CR8","series-title":"Technical Report","volume-title":"The polyadic \u03c0-calculus: a tutorial","author":"R. Milner","year":"1991","unstructured":"R. Milner. The polyadic \u03c0-calculus: a tutorial. Technical Report ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, UK, October 1991. Also in Logic and Algebra of Specification, ed. F. L. Bauer, W. Brauer and H. Schwichtenberg, Springer-Verlag, 1993."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"G. Necula. Proof-carrying code. In Conference Record of the ACM Symposium on Principles of Programming Languages, Paris, January 1997. ACM Press.","DOI":"10.1145\/263699.263712"},{"issue":"5","key":"5_CR10","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1017\/S096012950007002X","volume":"6","author":"B. Pierce","year":"1996","unstructured":"B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 6(5):409\u2013454, 1996. Extended abstract in LICS\u2019 93.","journal-title":"Mathematical Structures in Computer Science"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"J. Riely and M. Hennessy. A typed language for distributed mobile processes. In Conference Record of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, January 1998. ACM Press.","DOI":"10.1145\/268946.268978"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"J. Riely and M. Hennessy. Trust and partial typing in open systems of mobile agents. In Conference Record of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Antonio, January 1999. ACM Press. Full version available as Sussex CSTR 98\/04, 1998. Available from http:\/\/www.cogs.susx.ac.uk\/ .","DOI":"10.1145\/292540.292551"},{"key":"5_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the International Colloquium on Automata, Languages and Programming","author":"P. Sewell","year":"1998","unstructured":"P. Sewell. Global\/local subtyping and capability inference for a distributed \u03c0-calculus. In Proceedings of the International Colloquium on Automata, Languages and Programming, volume 1433 of Lecture Notes in Computer Science. Berlin: Springer-Verlag, July 1998."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"R. Stata and M. Abadi. A type system for Java bytecode subroutines. In Conference Record of the ACM Symposium on Principles of Programming Languages, San Diego, January 1998. ACM Press.","DOI":"10.1145\/268946.268959"}],"container-title":["Lecture Notes in Computer Science","Secure Internet Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48749-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T08:09:26Z","timestamp":1587974966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48749-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540661306","9783540487494"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48749-2_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}