{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:06:50Z","timestamp":1751983610515},"reference-count":33,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"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":7106,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/0304-3975(94)90055-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"93-125","source":"Crossref","is-referenced-by-count":37,"title":["Bottom-up abstract interpretation of logic programs"],"prefix":"10.1016","volume":"124","author":[{"given":"Michael","family":"Codish","sequence":"first","affiliation":[]},{"given":"Dennis","family":"Dams","sequence":"additional","affiliation":[]},{"given":"Eyal","family":"Yardeni","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90055-8_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/6012.15399","article-title":"Magic Sets and other strange ways to implement logic programs","author":"Bancilhon","year":"1986","journal-title":"Proc. 5th ACM SIGMOD-SIGACT Symp. on Principles of Database Systems"},{"key":"10.1016\/0304-3975(94)90055-8_BIB2","first-page":"95","article-title":"Modelling prolog control","author":"Barbuti","year":"1992","journal-title":"Proc. 19th ACM Symp. on the Principles of Programming Languages"},{"key":"10.1016\/0304-3975(94)90055-8_BIB3","series-title":"Tech. Report TR-20\/89","article-title":"A declarative approach to abstract interpretation of logic programs","author":"Barbuti","year":"1989"},{"key":"10.1016\/0304-3975(94)90055-8_BIB4","series-title":"Tech. Report TR 12\/91","article-title":"A general framework for semantics-based bottom-up abstract interpretation of logic programs","author":"Barbuti","year":"1991"},{"key":"10.1016\/0304-3975(94)90055-8_BIB5","doi-asserted-by":"crossref","DOI":"10.1145\/28659.28689","article-title":"On the power of magic","author":"Beeri","year":"1987","journal-title":"Proc. 6th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems"},{"key":"10.1016\/0304-3975(94)90055-8_BIB6","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","article-title":"A practical framework for the abstract interpretation of logic programs","volume":"10","author":"Bruynooghe","year":"1991","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(94)90055-8_BIB7","series-title":"Tech. report","article-title":"Query evaluation in recursive databases: bottom-up and top-down reconciled","author":"Bry","year":"1989"},{"key":"10.1016\/0304-3975(94)90055-8_BIB8","series-title":"Tech. Report CS90-10","article-title":"Abstract unification and a bottom-up analysis to detect aliasing in logic programs","author":"Codish","year":"1990"},{"key":"10.1016\/0304-3975(94)90055-8_BIB9","series-title":"Proc. 8th Internat. Conf. on Logic Programming","first-page":"331","article-title":"Suspension analysis for concurrent logic programs","author":"Codish","year":"1991"},{"key":"10.1016\/0304-3975(94)90055-8_BIB10","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":"Proc. 4th ACM Symp. on the Principles of Programming Languages"},{"key":"10.1016\/0304-3975(94)90055-8_BIB11","series-title":"Tech. Report","article-title":"Canonical computations of logic programs","author":"Debray","year":"1990"},{"key":"10.1016\/0304-3975(94)90055-8_BIB12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(90)90061-L","article-title":"Finite failures and partial computations in concurrent logic languages","volume":"75","author":"Falaschi","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90055-8_BIB13","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\/0304-3975(94)90055-8_BIB14","series-title":"Tech. Report TR-32\/89","article-title":"A model-theoretic reconstruction of the operational semantics of logic programs","author":"Falaschi","year":"1989"},{"key":"10.1016\/0304-3975(94)90055-8_BIB15","first-page":"197","article-title":"A finite presentation theorem for approximating logic programs","author":"Heintze","year":"1990","journal-title":"Proc. 17th ACM Symp. on the Principles of Programming Languages"},{"key":"10.1016\/0304-3975(94)90055-8_BIB16","series-title":"Proc. North Am. Conf. on Logic Programming","first-page":"506","article-title":"An algebraic framework for the abstract interpretation of logic programs","author":"Kemp","year":"1990"},{"key":"10.1016\/0304-3975(94)90055-8_BIB17","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0304-3975(94)90055-8_BIB18","series-title":"Proc. 5th Internat. Conf. Symp. on Logic Programming","article-title":"Bottom-up abstract interpretation of logic programs","author":"Marriott","year":"1988"},{"key":"10.1016\/0304-3975(94)90055-8_BIB19","series-title":"Proc. Inform. Process. 89","article-title":"Semantics-based dataflow analysis of logic programs","author":"Marriott","year":"1989"},{"key":"10.1016\/0304-3975(94)90055-8_BIB20","series-title":"Abstract Interpretation of Declarative Languages","first-page":"181","article-title":"Abstract interpretation of Prolog programs","author":"Mellish","year":"1987"},{"key":"10.1016\/0304-3975(94)90055-8_BIB21","series-title":"Category Theory and Computer Programming","first-page":"299","article-title":"Galois connections and computer science applications","volume":"Vol. 240","author":"Melton","year":"1986"},{"key":"10.1016\/0304-3975(94)90055-8_BIB22","series-title":"Proc. North American Conference on Logic Programming","article-title":"Determination of variable dependence information through abstract interpretation","author":"Muthukumar","year":"1989"},{"key":"10.1016\/0304-3975(94)90055-8_BIB23","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0890-5401(88)90041-7","article-title":"Strictness analysis and denotational abstract interpretation","volume":"76","author":"Nielson","year":"1988","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(94)90055-8_BIB24","series-title":"Programming Language Implementation and Logic Programming 91","first-page":"299","article-title":"Abstract interpretation: a kind of magic","author":"Nilsson","year":"1991"},{"key":"10.1016\/0304-3975(94)90055-8_BIB25","article-title":"Magic templates: a spellbinding approach to logic programs","author":"Ramakrishnan","year":"1988","journal-title":"Proc. 5th Internat. Conf. Symp. on Logic Programming"},{"key":"10.1016\/0304-3975(94)90055-8_BIB26","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0743-1066(91)90026-L","article-title":"Magic templates: a spellbinding approach to logic programs","volume":"11","author":"Ramakrishnan","year":"1991","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(94)90055-8_BIB27","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF03037407","article-title":"The Alexander method, a technique for the processing of recursive axioms in deductive databases","volume":"4","author":"Rohmer","year":"1986","journal-title":"New Generation Computing"},{"key":"10.1016\/0304-3975(94)90055-8_BIB28","series-title":"Proc. Symp. on Logic Programming","first-page":"234","article-title":"Compiling exploratory and goal-directed deduction into sloppy delta-iteration","author":"Schmidt","year":"1987"},{"key":"10.1016\/0304-3975(94)90055-8_BIB29","doi-asserted-by":"crossref","DOI":"10.1145\/73721.73737","article-title":"On the power of Alexander templates","author":"Seki","year":"1989","journal-title":"Proc. 8th ACM SIGACT-SIGMOD-SIGART Symp. on the Principles of Database Systems"},{"key":"10.1016\/0304-3975(94)90055-8_BIB30","series-title":"Tech. Report 12","article-title":"Semantic based analysis and transformation of logic programs","author":"S\u00f8ndergaard","year":"1990"},{"key":"10.1016\/0304-3975(94)90055-8_BIB31","unstructured":"J. Steiner, Personal communication."},{"key":"10.1016\/0304-3975(94)90055-8_BIB32","series-title":"Proc. 3rd Internat. Conf. on Logic Programming","article-title":"OLD resolution with tabulation","volume":"Vol. 225","author":"Tamaki","year":"1986"},{"key":"10.1016\/0304-3975(94)90055-8_BIB33","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0743-1066(91)80002-U","article-title":"A type system for logic programs","volume":"10","author":"Yardeni","year":"1991","journal-title":"J. Logic Programming"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900558?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900558?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:26:17Z","timestamp":1555129577000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594900558"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0304397594900558"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90055-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}