{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:06:53Z","timestamp":1751983613910},"reference-count":32,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":7688,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1992,7]]},"DOI":"10.1016\/0743-1066(92)90031-w","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:32Z","timestamp":1027640852000},"page":"181-204","source":"Crossref","is-referenced-by-count":19,"title":["Bottom-up dataflow analysis of normal logic programs"],"prefix":"10.1016","volume":"13","author":[{"given":"Kim","family":"Marriott","sequence":"first","affiliation":[]},{"given":"Harald","family":"S\u00f8ndergaard","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(92)90031-W_BIB1","series-title":"Abstract Interpretation of Declarative Languages","first-page":"9","article-title":"An Introduction to Abstract Interpretation","author":"Abramsky","year":"1987"},{"key":"10.1016\/0743-1066(92)90031-W_BIB2","series-title":"Technical Report 20\/89","article-title":"A Declarative Approach to Abstract Interpretation of Logic Programs","author":"Barbuti","year":"1989"},{"key":"10.1016\/0743-1066(92)90031-W_BIB3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","article-title":"A Framework for the Abstract Interpretation of Logic Programs","volume":"10","author":"Bruynooghe","year":"1991","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(92)90031-W_BIB4","first-page":"192","article-title":"Abstract Interpretation: Towards the Global Optimization of Prolog Programs","author":"Bruynooghe","year":"1987","journal-title":"Proceedings of the 1987 International Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(92)90031-W_BIB5","series-title":"Logic and Databases","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"key":"10.1016\/0743-1066(92)90031-W_BIB6","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","journal-title":"Proceedings of the Fourth Annual ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0743-1066(92)90031-W_BIB7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1145\/567752.567778","article-title":"Systematic Design of Program Analysis Frameworks","author":"Cousot","year":"1979","journal-title":"Proceedings of the Sixth Annual ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0743-1066(92)90031-W_BIB8","series-title":"Ph.D. Thesis","article-title":"Global Optimization of Logic Programs","author":"Debray","year":"1986"},{"key":"10.1016\/0743-1066(92)90031-W_BIB9","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","article-title":"Declarative Modeling of the Operational Behavior of Logic Languages","volume":"69","author":"Falaschi","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(92)90031-W_BIB10","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0743-1066(91)90014-G","article-title":"Bilattices and the Semantics of Logic Programming","volume":"11","author":"Fitting","year":"1991","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(92)90031-W_BIB11","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke-Kleene Semantics for Logic Programs","volume":"2","author":"Fitting","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(92)90031-W_BIB12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF03037136","article-title":"Specialisation of Prolog and FCP Programs Using Abstract Interpretation","volume":"6","author":"Gallagher","year":"1988","journal-title":"New Generation Comput."},{"key":"10.1016\/0743-1066(92)90031-W_BIB13","series-title":"Abstract Interpretation of Declarative Languages","first-page":"123","article-title":"A Semantics-Based Framework for the Abstract Interpretation of Prolog","author":"Jones","year":"1987"},{"key":"10.1016\/0743-1066(92)90031-W_BIB14","series-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/0743-1066(92)90031-W_BIB15","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","article-title":"Negation in Logic Programming","volume":"4","author":"Kunen","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(92)90031-W_BIB16","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0743-1066(92)90031-W_BIB17","series-title":"Computer Programming and Formal Systems","first-page":"33","article-title":"A Basis for a Mathematical Theory of Computation","author":"McCarthy","year":"1963"},{"key":"10.1016\/0743-1066(92)90031-W_BIB18","series-title":"Ph.D. Thesis","article-title":"Finding Explicit Representations for Subsets of the Herbrand Universe","author":"Marriott","year":"1988"},{"key":"10.1016\/0743-1066(92)90031-W_BIB19","unstructured":"Marriott, K., Frameworks for Abstract Interpretation, to appear in Acta Informatica."},{"key":"10.1016\/0743-1066(92)90031-W_BIB20","series-title":"Proceedings of the Fifth International Conference and Symposium on Logic Programming","first-page":"909","article-title":"Most Specific Logic Programs","author":"Marriott","year":"1988"},{"key":"10.1016\/0743-1066(92)90031-W_BIB21","series-title":"Proceedings of the Fifth International Conference and Symposium on Logic Programming","first-page":"733","article-title":"Bottom-Up Abstract Interpretation of Logic Programs","author":"Marriott","year":"1988"},{"key":"10.1016\/0743-1066(92)90031-W_BIB22","series-title":"Technical Report 88\/12","article-title":"On Describing Success Patterns of Logic Programs","author":"Marriott","year":"1988"},{"key":"10.1016\/0743-1066(92)90031-W_BIB23","series-title":"Information Processing 89","first-page":"601","article-title":"Semantics-Based Dataflow Analysis of Logic Programs","author":"Marriott","year":"1989"},{"key":"10.1016\/0743-1066(92)90031-W_BIB24","unstructured":"Marriott, K., S\u00f8ndergaard, H., and Jones, N.D., Denotational Abstract Interpretation of Logic Programs, submitted to ACM Trans. on Programming Languages and Systems."},{"key":"10.1016\/0743-1066(92)90031-W_BIB25","series-title":"Abstract Interpretation of Declarative Languages","first-page":"181","article-title":"Abstract Interpretation of Prolog Programs","author":"Mellish","year":"1987"},{"key":"10.1016\/0743-1066(92)90031-W_BIB26","series-title":"Proceedings of STACS 84","first-page":"274","article-title":"Logic Programs and Many-Valued Logic","volume":"166","author":"Mycroft","year":"1984"},{"key":"10.1016\/0743-1066(92)90031-W_BIB27","series-title":"Proceedings of the Second International Colloquium on Automata, Languages and Programming","first-page":"141","article-title":"On the Relation between Direct and Continuation Semantics","volume":"14","author":"Reynolds","year":"1974"},{"key":"10.1016\/0743-1066(92)90031-W_BIB28","first-page":"135","article-title":"Transformational Systems and the Algebraic Structure of Atomic Formulas","volume":"5","author":"Reynolds","year":"1969"},{"key":"10.1016\/0743-1066(92)90031-W_BIB29","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(84)90119-1","article-title":"Enumeration of Success Patterns in Logic Programs","volume":"34","author":"Sato","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(92)90031-W_BIB30","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"19","article-title":"Negation in Logic Programming","author":"Shepherdson","year":"1988"},{"key":"10.1016\/0743-1066(92)90031-W_BIB31","series-title":"Proceedings of the Third International Conference on Logic Programming","first-page":"84","article-title":"OLD Resolution with Tabulation","volume":"225","author":"Tamaki","year":"1986"},{"key":"10.1016\/0743-1066(92)90031-W_BIB32","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The Semantics of Logic as a Programming Language","volume":"23","author":"van Emden","year":"1976","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669290031W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669290031W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:56:55Z","timestamp":1555113415000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074310669290031W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":32,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["074310669290031W"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(92)90031-w","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}