{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T06:49:35Z","timestamp":1778914175723,"version":"3.51.4"},"reference-count":39,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4794,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0304-3975(99)00232-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:42:30Z","timestamp":1027651350000},"page":"215-254","source":"Crossref","is-referenced-by-count":66,"title":["Types for access control"],"prefix":"10.1016","volume":"240","author":[{"given":"Rocco De","family":"Nicola","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GianLuigi","family":"Ferrari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rosario","family":"Pugliese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Betti","family":"Venneri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00232-7_BIB1","first-page":"611","article-title":"Secrecy by typing in cryptographic protocols","volume":"vol. 1281","author":"Abadi","year":"1997"},{"issue":"1","key":"10.1016\/S0304-3975(99)00232-7_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1998.2740","article-title":"A calculus for cryptographic protocols: the spi calculus","volume":"148","author":"Abadi","year":"1999","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(99)00232-7_BIB3","doi-asserted-by":"crossref","unstructured":"M. Abadi, R. Stata, A type system for Java Bytecode subroutines, Proc. ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1998, pp. 149\u2013160. ACM Trans. Programm. Languages Systems, to appear.","DOI":"10.1145\/268946.268959"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB4","first-page":"374","article-title":"An asynchronous model of locality, failure and process mobility","volume":"vol. 1282","author":"Amadio","year":"1997"},{"issue":"4","key":"10.1016\/S0304-3975(99)00232-7_BIB5","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/155183.155231","article-title":"Subtyping recursive types","volume":"15","author":"Amadio","year":"1993","journal-title":"ACM Trans. Programm. Languages Systems"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB6","first-page":"205","article-title":"Localities and failures","volume":"vol. 880","author":"Amadio","year":"1994"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB7","series-title":"The Java Programming Language","author":"Arnold","year":"1996"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB8","doi-asserted-by":"crossref","unstructured":"L. Bettini, R. De Nicola, G. Ferrari, R. Pugliese, Interactive mobile agents in X-KLAIM, Proc., IEEE 7th Internat. Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises, IEEE Computer Society Press, Silverspring, MD, 1998.","DOI":"10.1109\/ENABL.1998.725680"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB9","first-page":"611","article-title":"Control flow analysis for the \u03c0-calculus","volume":"vol. 1466","author":"Bodei","year":"1998"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB10","doi-asserted-by":"crossref","unstructured":"M. Boreale, D. Sangiorgi, Bisimulation in naming-passing calculi without matching, Proc. 13th IEEE Symp. on Logic in Computer Science (LICS \u201998), IEEE Computer Society Press, Silverspring, MD, 1998, pp. 165\u2013175.","DOI":"10.1109\/LICS.1998.705653"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB11","first-page":"239","article-title":"Typing the use of resources in a concurrent calculus","volume":"vol. 1345","author":"Boudol","year":"1997"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB12","first-page":"63","article-title":"Coinductive axiomatization of recursive type equality and subtyping","volume":"vol. 1210","author":"Brandt","year":"1997"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB13","first-page":"140","article-title":"Mobile ambients","volume":"vol. 1378","author":"Cardelli","year":"1998"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB14","doi-asserted-by":"crossref","unstructured":"L. Cardelli, A. Gordon, Types for mobile ambients, Proc. ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1999, pp. 79\u201392.","DOI":"10.1145\/292540.292550"},{"issue":"4","key":"10.1016\/S0304-3975(99)00232-7_BIB15","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/63334.63337","article-title":"Linda in context","volume":"32","author":"Carriero","year":"1989","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB16","doi-asserted-by":"crossref","unstructured":"N. Carriero, D. Gelernter, J. Leichter, Distributed data structures in Linda, Proc. ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1986, pp. 236\u2013242.","DOI":"10.1145\/512644.512666"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB17","first-page":"220","article-title":"Coordinating mobile agents via blackboards and access rights","volume":"vol. 1282","author":"De Nicola","year":"1997"},{"issue":"5","key":"10.1016\/S0304-3975(99)00232-7_BIB18","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1109\/32.685256","article-title":"KLAIM: a Kernel language for Agents interaction and mobility","volume":"24","author":"De Nicola","year":"1998","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0304-3975(99)00232-7_BIB19","doi-asserted-by":"crossref","unstructured":"R. De Nicola, R. Pugliese, A process algebra based on Linda, in: P. Ciancarini, C. Hankin (Eds.), COORDINATION\u201996, Proc. Lecture Notes in Computer Science, vol. 1061, Springer, Berlin, 1996, pp. 160\u2013178. (Theoret. Comput. Sci., to appear.)","DOI":"10.1007\/3-540-61052-9_45"},{"issue":"5","key":"10.1016\/S0304-3975(99)00232-7_BIB20","doi-asserted-by":"crossref","first-page":"1376","DOI":"10.1137\/S0097539794275860","article-title":"A filter model for concurrent \u03bb-calculi","volume":"27","author":"Dezani-Ciancaglini","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00232-7_BIB21","first-page":"406","article-title":"A calculus of mobile agents","volume":"vol. 1119","author":"Fournet","year":"1996"},{"issue":"1","key":"10.1016\/S0304-3975(99)00232-7_BIB22","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/2363.2433","article-title":"Generative communication in Linda","volume":"7","author":"Gelernter","year":"1985","journal-title":"ACM Trans. Programm. Languages Systems"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB23","unstructured":"D. Gelernter, N. Carriero, S. Chandran et al., Parallel programming in Linda, Proc. IEEE Internat. Conf. on Parallel Programming, IEEE Computer Society Press, Silverspring, MD, 1985, pp. 255\u2013263."},{"key":"10.1016\/S0304-3975(99)00232-7_BIB24","doi-asserted-by":"crossref","unstructured":"N. Heintz, J.G. Riecke, The SLam calculus: programming with secrecy and integrity, Proc. ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1998, pp. 365\u2013377.","DOI":"10.1145\/268946.268976"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB25","doi-asserted-by":"crossref","unstructured":"M. Hennessy, J. Riely, Resource access control in systems of mobile agents, Proc. Internat. Workshop on High-Level Concurrent Languages, Electronic Notes in Theoretical Computer Science, vol. 16, Elsevier, Amsterdam, 1998.","DOI":"10.1016\/S1571-0661(04)00141-0"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB26","doi-asserted-by":"crossref","unstructured":"N. Kobayashi, B. Pierce, D. Turner, Linearity and the \u03c0-calculus, Proc. ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1996.","DOI":"10.1145\/237721.237804"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB27","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1017\/S0960129500000657","article-title":"Efficient recursive subtyping","volume":"5","author":"Kozen","year":"1999","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB28","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes (Parts I and II)","volume":"100","author":"Milner","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(99)00232-7_BIB30","doi-asserted-by":"crossref","unstructured":"G. Necula, Proof-carrying code, Proc. ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1997, pp. 106\u2013119.","DOI":"10.1145\/263699.263712"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB31","doi-asserted-by":"crossref","unstructured":"U. Nestmann, B.C. Pierce, Decoding choice encodings, in: U. Montanari, V. Sassone (Eds.), CONCUR\u201996, Proc., Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996, pp. 179\u2013194.","DOI":"10.1007\/3-540-61604-7_55"},{"issue":"5","key":"10.1016\/S0304-3975(99)00232-7_BIB32","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1017\/S096012950007002X","article-title":"Typing and subtyping for mobile processes","volume":"6","author":"Pierce","year":"1996","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00232-7_BIB33","unstructured":"R. Pugliese, Semantic theories for asynchronous languages, Ph.D. Thesis VIII-96-6, Univ. di Roma \u201cLa Sapienza\u201d, Dip. Scienze dell'Informazione, 1996."},{"key":"10.1016\/S0304-3975(99)00232-7_BIB34","doi-asserted-by":"crossref","unstructured":"J. Riely, M. Hennessy, Trust and partial typing in open systems of mobile agents, Proc. ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1999.","DOI":"10.1145\/292540.292551"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB35","doi-asserted-by":"crossref","unstructured":"P. Sewell, Global\/local subtyping and capability inference for a distributed \u03c0-calculus, in: K.G. Larsen, S. Skyum, G. Winskel (Eds.), Internat. Colloquium on Automata, Languages and Programming (ICALP\u201998), Proc., Lecture Notes in Computer Science, vol. 1443, Springer, Berlin, 1998, pp. 695\u2013706.","DOI":"10.1007\/BFb0055094"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB36","unstructured":"R. Statman, Recursive types and the subject reduction theorem, Technical Report 94-164, Carnegie Mellon University, 1994."},{"key":"10.1016\/S0304-3975(99)00232-7_BIB37","doi-asserted-by":"crossref","unstructured":"J. Vitek, G. Castagna, Towards a calculus of secure mobile computations, Proc. Workshop on Internet Programming Languages, Chicago, 1998.","DOI":"10.1007\/3-540-47959-7_3"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB38","first-page":"607","article-title":"A typed-based approach to program security","volume":"vol. 1214","author":"Volpano","year":"1997"},{"key":"10.1016\/S0304-3975(99)00232-7_BIB39","doi-asserted-by":"crossref","unstructured":"D. Volpano, G. Smith, Secure information flow in a multi-threaded imperative language, Proc. ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1998, pp. 355\u2013364.","DOI":"10.1145\/268946.268975"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002327?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002327?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T16:43:57Z","timestamp":1733503437000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0304397599002327"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00232-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}