{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:32:03Z","timestamp":1720625523398},"reference-count":10,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,11,20]],"date-time":"2014-11-20T00:00:00Z","timestamp":1416441600000},"content-version":"vor","delay-in-days":4859,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1016\/s1571-0661(04)00235-x","type":"journal-article","created":{"date-parts":[[2004,2,5]],"date-time":"2004-02-05T10:34:35Z","timestamp":1075977275000},"page":"58-68","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Information Flow Security in Mobile Ambients1 1Partially supported by MURST Projects \u201cInterpretazione Astratta, Type Systems e Analisi Control-Flow\u201d, and \u201cCertificazione automatica di programmi mediante interpretazione astratta\u201d."],"prefix":"10.1016","volume":"54","author":[{"given":"Agostino","family":"Cortesi","sequence":"first","affiliation":[]},{"given":"Riccardo","family":"Focardi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00235-X_NEWBIB1","doi-asserted-by":"crossref","unstructured":"P. Degano, F. Levi, C. Bodei. Safe Ambients: Control Flow Analysis and Security. In proceedings of ASIAN'00, LNCS 1961, 2000, pages 199\u2013214.","DOI":"10.1007\/3-540-44464-5_15"},{"key":"10.1016\/S1571-0661(04)00235-X_NEWBIB2","doi-asserted-by":"crossref","unstructured":"C. Bodei, P. Degano, F. Nielson, and, H. R. Nielson. Static Analysis of Processes for No Read-Up and No-Write-Down. In In Proc. FoSSaCS'99, volume 1578 of Lecture Notes in Computer Science, pages 120\u2013134, Springer-Verlag, 1999.","DOI":"10.1007\/3-540-49019-1_9"},{"key":"10.1016\/S1571-0661(04)00235-X_NEWBIB3","doi-asserted-by":"crossref","unstructured":"M. Bugliesi and G. Castagna. \u201cSecure Safe Ambients\u201d. Proc. 28th ACM Symposium on Principles of Programming Languages (POPL'01), pp. 222\u2013235, London. 2001.","DOI":"10.1145\/360204.360223"},{"key":"10.1016\/S1571-0661(04)00235-X_NEWBIB4","doi-asserted-by":"crossref","unstructured":"L. Cardelli and A. Gordon. \u201cMobile Ambients\u201d. In Proc. FoSSaCS'98, volume 1378 of Lecture Notes in Computer Science, pages 140\u2013155, Springer-Verlag, 1998.","DOI":"10.1016\/S1571-0661(05)80699-1"},{"issue":"1","key":"10.1016\/S1571-0661(04)00235-X_NEWBIB5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.3233\/JCS-1994\/1995-3103","article-title":"\u201cA Classification of Security Properties for Process Algebras\u201d","volume":"3","author":"Focardi","year":"1995","journal-title":"Journal of Computer Security"},{"issue":"No. 9","key":"10.1016\/S1571-0661(04)00235-X_NEWBIB6","doi-asserted-by":"crossref","DOI":"10.1109\/32.629493","article-title":"\u201cThe Compositional Security Checker: A Tool for the Verification of Information Flow Security Properties","volume":"Vol. 23","author":"Focardi","year":"1997","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S1571-0661(04)00235-X_NEWBIB7","doi-asserted-by":"crossref","unstructured":"R. Focardi, R. Gorrieri, F. Martinelli, \u201cInformation Flow Analysis in a Discrete Time Process Algebra\u201d, in Proc. of 13th IEEE Computer Security Foundations Workshop (CSFW13), (P. Syverson ed), IEEE CS Press, 170\u2013184, 2000.","DOI":"10.1109\/CSFW.2000.856935"},{"key":"10.1016\/S1571-0661(04)00235-X_NEWBIB8","doi-asserted-by":"crossref","unstructured":"R. R. Hansen, J. G. Jensen, F. Nielson, and H. R. Nielson, Abstract Interpretation of Mobile Ambients. In Proc. Static Analysis Symposium SAS'99, volume 1694 of Lecture Notes in Computer Science, pages 134\u2013148, Springer-Verlag, 1999.","DOI":"10.1007\/3-540-48294-6_9"},{"key":"10.1016\/S1571-0661(04)00235-X_NEWBIB9","doi-asserted-by":"crossref","unstructured":"M. Hennessy, J. Riely. \u201cInformation Flow vs. Resource Access in the Asynchronous Pi-Calculus\u201d. ICALP 2000: 415\u2013427.","DOI":"10.1007\/3-540-45022-X_35"},{"key":"10.1016\/S1571-0661(04)00235-X_NEWBIB10","doi-asserted-by":"crossref","unstructured":"G. Smith, D.M. Volpano, \u201cSecure Information Flow in a Multi-Threaded Imperative Language\u201d. In Proc. of POPL 1998: 355\u2013364.","DOI":"10.1145\/268946.268975"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610400235X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610400235X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T12:29:26Z","timestamp":1585571366000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610400235X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":10,"alternative-id":["S157106610400235X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00235-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}