{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:20Z","timestamp":1761610340383,"version":"build-2065373602"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4958,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/s1571-0661(05)01155-2","type":"journal-article","created":{"date-parts":[[2005,4,8]],"date-time":"2005-04-08T09:19:45Z","timestamp":1112951985000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":17,"title":["Occurrence Counting Analysis for the \u03c0-calculus"],"prefix":"10.1016","volume":"39","author":[{"given":"J\u00e9r\u00f4me","family":"Feret","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)01155-2_bib1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","article-title":"The chemical abstract machine","volume":"96","author":"Berry","year":"1992","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)01155-2_bib2","series-title":"Proceedings of CONCUR'98 Lecture Notes in Gomputer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0055617","article-title":"Control flow analysis for the \u03c0-calculus","author":"Bodei","year":"1998"},{"issue":"4","key":"10.1016\/S1571-0661(05)01155-2_bib3","doi-asserted-by":"crossref","DOI":"10.1017\/S0956796800000496","article-title":"Abstract interpretation by dynamic partitioning","volume":"2","author":"Bourdoncle","year":"1992","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/S1571-0661(05)01155-2_bib4","series-title":"Foundations of Software Science and Computational Structures, volume 1378 of Lecture Notes in Computer Science","first-page":"140","article-title":"Mobile ambients","author":"Cardelli","year":"1998"},{"key":"10.1016\/S1571-0661(05)01155-2_bib5","series-title":"Proceedings of the Twelfth International Conference on Logic Programming","first-page":"17","article-title":"Interval linear constraint solving using the preconditioned interval gaus-seidel method","author":"Chiu","year":"1995"},{"key":"10.1016\/S1571-0661(05)01155-2_bib6","unstructured":"P. Cousot. M\u00e9thodes it\u00e9ratives de construction et d'approximation de points fixes d'op\u00e9rateurs monotones sur un treillis, analyse s\u00e9mantique des programmes PhD thesis. Universit\u00e9 Scientiflque et M\u00e9dicale de Grenoble, 1978."},{"key":"10.1016\/S1571-0661(05)01155-2_bib7","series-title":"Program, Flow Analysis: Theory and Applications","first-page":"303","article-title":"Semantic foundations of program analysis","author":"Cousot","year":"1981"},{"key":"10.1016\/S1571-0661(05)01155-2_bib8","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: a unifled lattice model for static analysis of programs by construction or approximation of flxpoints. In Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, pages 238\u2013252, Los Angeles, California, U.S.A., 1977.","DOI":"10.1145\/512950.512973"},{"key":"10.1016\/S1571-0661(05)01155-2_bib9","series-title":"Proceedings of the Sixth Conference on Principles of Programming Languages POPL'79","article-title":"Systematic design of program analysis frameworks","author":"Cousot","year":"1979"},{"issue":"4","key":"10.1016\/S1571-0661(05)01155-2_bib10","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","article-title":"Abstract interpretation frameworks","volume":"2","author":"Cousot","year":"1992","journal-title":"Journal of logic and computation"},{"key":"10.1016\/S1571-0661(05)01155-2_bib11","series-title":"Programming Language Implementation and Logic Programming, Proceedings of the Fourth International Symposium, PLILP'92, volume 631 of Lecture Notes in Computer Science","first-page":"269","article-title":"Comparing the Galois connection and widening-narrowing approaches to abstract interpretation","author":"Cousot","year":"1992"},{"key":"10.1016\/S1571-0661(05)01155-2_bib12","series-title":"Proceedings of the Fifth Conference on Principles of Programming Languages","article-title":"Automatic discovery of linear restraints among variables of a program","author":"Cousot","year":"1978"},{"author":"Feret","key":"10.1016\/S1571-0661(05)01155-2_bib13"},{"key":"10.1016\/S1571-0661(05)01155-2_bib14","series-title":"Seventh International Static Analysis Symposium (SAS'00), volume 1824 of LNCS","article-title":"Confidentiality analysis for mobiles systems","author":"Feret","year":"2000"},{"key":"10.1016\/S1571-0661(05)01155-2_bib15","series-title":"Proc. SAS'99, number 1694 in Lecture Notes in Computer Science","first-page":"134","article-title":"Abstract interpretation of mobile ambients","author":"Hansen","year":"1999"},{"key":"10.1016\/S1571-0661(05)01155-2_bib16","series-title":"Proof and Computation volume 139 of Computer and Systems Sciences","first-page":"173","article-title":"Rewrite proofs and computations","author":"Jouannaud","year":"1995"},{"key":"10.1016\/S1571-0661(05)01155-2_bib17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF00268497","article-title":"Affine relationships among variables of a program","author":"Karr","year":"1976","journal-title":"Acta Informatica"},{"key":"10.1016\/S1571-0661(05)01155-2_bib18","series-title":"Proceedings of the International Summer School on Logic and Algebra of Specification","article-title":"The polyadic \u03c0-calculus: a tutorial","author":"Milner","year":"1991"},{"key":"10.1016\/S1571-0661(05)01155-2_bib19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes","volume":"100","author":"Milner","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)01155-2_bib20","series-title":"Proc. POPL'00","first-page":"142","article-title":"Shape analysis for mobile ambients","author":"Nielson","year":"2000"},{"key":"10.1016\/S1571-0661(05)01155-2_bib21","unstructured":"D. N. Turner. The Polymorphic Pi-Calculus: Theory and Implementation. PhD thesis, Edinburgh University, 1995."},{"key":"10.1016\/S1571-0661(05)01155-2_bib22","series-title":"Proc. of the Fifth, LOMAPS Workshop on Analysis and Verification of High-Level Concurrent Languages, volume 1192 of Lecture Notes in Computer Science","first-page":"51","article-title":"Abstract interpretation of the \u03c0-calculus","author":"Venet","year":"1996"},{"key":"10.1016\/S1571-0661(05)01155-2_bib23","series-title":"Proceedings of the Fifth International Static Analysis Symposium SAS'98, volume 1503 of Lecture Notes in Computer Science","first-page":"152","article-title":"Automatic determination of communication topologies in mobile systems","author":"Venet","year":"1998"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105011552?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105011552?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:19Z","timestamp":1761609979000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105011552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000]]}},"alternative-id":["S1571066105011552"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)01155-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Occurrence Counting Analysis for the \u03c0-calculus","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)01155-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier Science B.V. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}