{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:27:47Z","timestamp":1757629667628,"version":"3.44.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9329,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100008394","name":"Natur og Univers, Det Frie Forskningsr\u00e5d","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008394","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1988,1]]},"DOI":"10.1016\/0890-5401(88)90041-7","type":"journal-article","created":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T19:24:20Z","timestamp":1101929060000},"page":"29-92","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":20,"title":["Strictness analysis and denotational abstract interpretation"],"prefix":"10.1016","volume":"76","author":[{"given":"Flemming","family":"Nielson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"year":"1985","series-title":"Strictness analysis via logical relations","author":"Abramsky","key":"10.1016\/0890-5401(88)90041-7_BIB1"},{"year":"1975","author":"Arbib","key":"10.1016\/0890-5401(88)90041-7_BIB2"},{"key":"10.1016\/0890-5401(88)90041-7_BIB3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0167-6423(83)90022-9","article-title":"A structured approach to static semantics correctness","volume":"3","author":"Barbuti","year":"1983","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0890-5401(88)90041-7_BIB4_1","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","article-title":"Strictness analysis for higher order functions","volume":"7","author":"Burn","year":"1986","journal-title":"Sci. Comput. Programming"},{"article-title":"Strictness analysis for higher order functions","year":"1985","author":"Burn","key":"10.1016\/0890-5401(88)90041-7_BIB4_2"},{"key":"10.1016\/0890-5401(88)90041-7_BIB5","series-title":"Conf. Record, 4th ACM Symposium on Principles of Programming Languages","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\/0890-5401(88)90041-7_BIB6","series-title":"Conf. Record, 6th ACM Symposium on Principles of Programming Languages","article-title":"Systematic design of program analysis frameworks","author":"Cousot","year":"1979"},{"year":"1979","author":"Gordon","key":"10.1016\/0890-5401(88)90041-7_BIB7"},{"year":"1960","author":"Halmos","key":"10.1016\/0890-5401(88)90041-7_BIB8"},{"key":"10.1016\/0890-5401(88)90041-7_BIB9","series-title":"Proceedings, \u2018Programs as Data Objects,\u2019","article-title":"Strictness detection in non-flat domains","volume":"Vol. 217","author":"Hughes","year":"1986"},{"key":"10.1016\/0890-5401(88)90041-7_BIB10","series-title":"Program Flow Analysis: Theory and Applications","article-title":"Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra","author":"Jones","year":"1981"},{"key":"10.1016\/0890-5401(88)90041-7_BIB11","series-title":"Conf. Record, 13th ACM Symposium on Principles of Programming Languages","article-title":"Data flow analysis of applicative programs using minimal function graphs","author":"Jones","year":"1986"},{"year":"1971","author":"MacLane","key":"10.1016\/0890-5401(88)90041-7_BIB12"},{"key":"10.1016\/0890-5401(88)90041-7_BIB13","first-page":"53","article-title":"Chain-complete posets and directed sets with applications","volume":"6","author":"Markowsky","year":"1976"},{"key":"10.1016\/0890-5401(88)90041-7_BIB14","series-title":"Proceedings, \u2018Programs as Data Objects,\u2019","article-title":"Strictness computation using generalized \u03bb-expressions","volume":"Vol. 217","author":"Maurer","year":"1986"},{"year":"1976","author":"Milne","key":"10.1016\/0890-5401(88)90041-7_BIB15"},{"journal-title":"SIS-Semantics Implementation System: Reference Manual and User Guide","year":"1979","author":"Mosses","key":"10.1016\/0890-5401(88)90041-7_BIB16"},{"article-title":"Abstract Interpretation and Optimizing Transformations for Applicative Programs","year":"1981","author":"Mycroft","key":"10.1016\/0890-5401(88)90041-7_BIB17"},{"key":"10.1016\/0890-5401(88)90041-7_BIB18","series-title":"Proceedings, \u2018Programs as Data Objects,\u2019","article-title":"A relational framework for abstract interpretation","volume":"Vol. 217","author":"Mycroft","year":"1986"},{"key":"10.1016\/0890-5401(88)90041-7_BIB19","series-title":"Proceedings, 10th ICALP","article-title":"Strong abstract interpretation using power domains","volume":"Vol. 154","author":"Mycroft","year":"1983"},{"key":"10.1016\/0890-5401(88)90041-7_BIB20","doi-asserted-by":"crossref","DOI":"10.1007\/BF00263194","article-title":"A denotational framework for data flow analysis","volume":"18","author":"Nielson","year":"1982","journal-title":"Acta Inform."},{"article-title":"Abstract Interpretation Using Domain Theory","year":"1984","author":"Nielson","key":"10.1016\/0890-5401(88)90041-7_BIB21"},{"key":"10.1016\/0890-5401(88)90041-7_BIB22","series-title":"Proceedings, STACS 1986","article-title":"Abstract interpretation of denotational definitions","volume":"Vol. 210","author":"Nielson","year":"1986"},{"key":"10.1016\/0890-5401(88)90041-7_BIB23","series-title":"Proceedings, \u2018Programs as Data Objects,\u2019","article-title":"Expected forms of data flow analyses","volume":"Vol. 217","author":"Nielson","year":"1986"},{"year":"1986","author":"Nielson","key":"10.1016\/0890-5401(88)90041-7_BIB24"},{"key":"10.1016\/0890-5401(88)90041-7_BIB25","series-title":"Proceedings, 14th POPL, ACM","article-title":"Strictness analysis and denotational abstract interpretation (extended abstract)","author":"Nielson","year":"1987"},{"key":"10.1016\/0890-5401(88)90041-7_BIB26","article-title":"Lambda-definability and logical relations","author":"Plotkin","year":"1973","journal-title":"Edinburgh AI memo"},{"key":"10.1016\/0890-5401(88)90041-7_BIB27","series-title":"Proceedings, 2nd ICALP","article-title":"On the relation between direct and continuation semantics","volume":"Vol. 14","author":"Reynolds","year":"1974"},{"year":"1977","author":"Stoy","key":"10.1016\/0890-5401(88)90041-7_BIB28"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540188900417?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540188900417?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T15:10:09Z","timestamp":1757517009000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540188900417"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,1]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,1]]}},"alternative-id":["0890540188900417"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(88)90041-7","relation":{},"ISSN":["0890-5401"],"issn-type":[{"type":"print","value":"0890-5401"}],"subject":[],"published":{"date-parts":[[1988,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Strictness analysis and denotational abstract interpretation","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0890-5401(88)90041-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}