{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:48:43Z","timestamp":1778298523447,"version":"3.51.4"},"reference-count":14,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0167-6423(02)00131-4","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:44:35Z","timestamp":1048610675000},"page":"145-175","source":"Crossref","is-referenced-by-count":14,"title":["Abstract interpretation of mobile ambients"],"prefix":"10.1016","volume":"47","author":[{"given":"Flemming","family":"Nielson","sequence":"first","affiliation":[]},{"given":"Ren\u00e9 Rydhof","family":"Hansen","sequence":"additional","affiliation":[]},{"given":"Hanne Riis","family":"Nielson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6423(02)00131-4_BIB1","series-title":"Proc. Concurrency Theory, CONCUR\u201998","first-page":"84","article-title":"Control flow analysis for the \u03c0-calculus","volume":"Vol. 1466","author":"Bodei","year":"1998"},{"key":"10.1016\/S0167-6423(02)00131-4_BIB2","series-title":"Proc. FoSSaCS\u201999","first-page":"120","article-title":"Static analysis of processes for no read-up and no write-down","volume":"Vol. 1578","author":"Bodei","year":"1999"},{"key":"10.1016\/S0167-6423(02)00131-4_BIB3","series-title":"Proc. FoSSaCS\u201998, Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/BFb0053547","article-title":"Mobile ambients","author":"Cardelli","year":"1998"},{"key":"10.1016\/S0167-6423(02)00131-4_BIB4","series-title":"Conf. Rec. Annu. ACM Symp. on Principles of Programming Languages, POPL\u201999","first-page":"79","article-title":"Types for mobile ambients","author":"Cardeli","year":"1999"},{"key":"10.1016\/S0167-6423(02)00131-4_BIB5","series-title":"Conf. Rec. Annu. ACM Symp. on Principles of Programming Languages, POPL\u201997","first-page":"269","article-title":"Systematic design of program analysis frameworks","author":"Cousot","year":"1979"},{"key":"10.1016\/S0167-6423(02)00131-4_BIB6","series-title":"Inside Java 2 Platform Security","author":"Gong","year":"1999"},{"key":"10.1016\/S0167-6423(02)00131-4_BIB7","series-title":"Proc. Static Anal. Symp. SAS\u201999","first-page":"134","article-title":"Abstract interpretation of mobile ambients","volume":"Vol. 1694","author":"Hansen","year":"1999"},{"key":"10.1016\/S0167-6423(02)00131-4_BIB8","series-title":"Principles of Program Analysis","author":"Nielson","year":"1999"},{"key":"10.1016\/S0167-6423(02)00131-4_BIB9","series-title":"Proc. ESOP\u201901, Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45309-1_17","article-title":"Control-flow analysis in cubic time","author":"Nielson","year":"2001"},{"key":"10.1016\/S0167-6423(02)00131-4_BIB10","series-title":"Proc. Eur. Symp. on Programming, ESOP\u201900","first-page":"305","article-title":"A Kleene analysis of mobile ambients","volume":"Vol. 1782","author":"Nielson","year":"2000"},{"key":"10.1016\/S0167-6423(02)00131-4_BIB11","series-title":"Proc. Concurrency Theory, CONCUR\u201999, Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/3-540-48320-9_32","article-title":"Validating firewalls in mobile ambients","author":"Nielson","year":"1999"},{"key":"10.1016\/S0167-6423(02)00131-4_BIB12","series-title":"Conf. Rec. Annu. ACM Symp. on Principles of Programming Languages, POPL\u201900","first-page":"142","article-title":"Shape analysis for mobile ambients","author":"Riis Nielson","year":"2000"},{"key":"10.1016\/S0167-6423(02)00131-4_BIB13","doi-asserted-by":"crossref","unstructured":"A. Venet, Abstract interpretation of the \u03c0-calculus, in: Proc. Analysis and Verification of Multiple-Agent Languages, Lecture Notes in Computer Science, Vol. 1192, Springer, Berlin, 1197, pp. 51\u201375.","DOI":"10.1007\/3-540-62503-8_3"},{"key":"10.1016\/S0167-6423(02)00131-4_BIB14","series-title":"Proc. Static Analysis Symp., SAS\u201998","first-page":"152","article-title":"Automatic determination of communication topologies in mobile systems","volume":"Vol. 1503","author":"Venet","year":"1998"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642302001314?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642302001314?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T00:58:22Z","timestamp":1553907502000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642302001314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":14,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0167642302001314"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6423(02)00131-4","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}