{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:59Z","timestamp":1761611159595,"version":"build-2065373602"},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5688,"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":[[1998]]},"DOI":"10.1016\/s1571-0661(05)80695-4","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:43Z","timestamp":1115393683000},"page":"150-169","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"special_numbering":"C","title":["Flow Logic and Operational Semantics"],"prefix":"10.1016","volume":"10","author":[{"given":"Flemming","family":"Nielson","sequence":"first","affiliation":[]},{"given":"Hanne","family":"Riis Nielson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1984","series-title":"The Lambda Calculus \u2014 Its Syntax and Semantics, volume 103 of Studies in logic and the foundation of mathematics","author":"Barendregt","key":"10.1016\/S1571-0661(05)80695-4_BIB1"},{"key":"10.1016\/S1571-0661(05)80695-4_BIB2","first-page":"238","article-title":"Abstract Interpretation a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints","author":"Cousot","year":"1977"},{"key":"10.1016\/S1571-0661(05)80695-4_BIB3","first-page":"83","article-title":"Inductive definitions, semantics and abstract interpretation","author":"Cousot","year":"1992"},{"key":"10.1016\/S1571-0661(05)80695-4_BIB4","first-page":"209","article-title":"The semantics of future and its use in program optimization","author":"Flanagan","year":"1998"},{"key":"10.1016\/S1571-0661(05)80695-4_BIB5","doi-asserted-by":"crossref","unstructured":"K. L. S. Gasser, F. Nielson, and H. R. Nielson. Systematic realisation of control flow analyses for CML. In Proceedings of ICFP'97, pages 38\u201451. ACM Press, 1997.","DOI":"10.1145\/258948.258954"},{"key":"10.1016\/S1571-0661(05)80695-4_BIB6","doi-asserted-by":"crossref","unstructured":"N. Heintze. Set-based analysis of ML programs. In Proc. LFP'94, pages 306\u2014317, 1994.","DOI":"10.1145\/182409.182495"},{"key":"10.1016\/S1571-0661(05)80695-4_BIB7","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-61580-6_11","article-title":"What not to do when writing an interpreter for specialisation","author":"Jones","year":"1996","journal-title":"In Partial Evaluation"},{"year":"1989","series-title":"Communication and Concurrency","author":"Milner","key":"10.1016\/S1571-0661(05)80695-4_BIB8"},{"key":"10.1016\/S1571-0661(05)80695-4_BIB9","doi-asserted-by":"crossref","DOI":"10.1145\/263699.263745","article-title":"Infinitary Control Flow Analysis a Collecting Semantics for Closure Analysis","author":"Nielson","year":"1997","journal-title":"In Proc. POPL '97"},{"key":"10.1016\/S1571-0661(05)80695-4_BIB10","doi-asserted-by":"crossref","unstructured":"F. Nielson H. R. Nielson and C. L. Hankin. Principles of Program Analysis Flows and Effects To appear in 1999.","DOI":"10.1007\/978-3-662-03811-6"},{"key":"10.1016\/S1571-0661(05)80695-4_BIB11","article-title":"Flow logics for constraint based analysis","author":"Nielson","year":"1998","journal-title":"In Proc. CC'98, to appear in Springer Lecture Notes in Computer Science"},{"issue":"1","key":"10.1016\/S1571-0661(05)80695-4_BIB12","first-page":"47","volume":"17","author":"Palsberg","year":"1995","journal-title":"Closure analysis in constraint form ACM TOPLAS"},{"year":"1981","series-title":"A structural approach to operational semantics Technical Report FN-19","author":"Plotkin","key":"10.1016\/S1571-0661(05)80695-4_BIB13"},{"key":"10.1016\/S1571-0661(05)80695-4_BIB14","series-title":"PhD thesis Department of Computer Science, University of Copenhagen Denmark","article-title":"Analysis and efficient implementation of functional programs","author":"Sestoft","year":"1991"},{"key":"10.1016\/S1571-0661(05)80695-4_BIB15","doi-asserted-by":"crossref","unstructured":"O. Shivers. Control flow analysis in Scheme. In Proc. PLDI'88, pages 164\u2014174. ACM Sigplan Notices 7(1), 1988.","DOI":"10.1145\/960116.54007"},{"issue":"9","key":"10.1016\/S1571-0661(05)80695-4_BIB16","doi-asserted-by":"crossref","DOI":"10.1145\/115866.115884","article-title":"The semantics of Scheme control-flow analysis In Partial Evaluation and Semantics-Based Programs Manipulation","volume":"26","author":"Shivers","year":"1991","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/S1571-0661(05)80695-4_BIB17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice-theoretical fixpoint theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105806954?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105806954?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:09:18Z","timestamp":1761610158000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105806954"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":17,"alternative-id":["S1571066105806954"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80695-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Flow Logic and Operational Semantics","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)80695-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2004 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}