{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:24:30Z","timestamp":1726406670802},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544449"},{"type":"electronic","value":"9783540383628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54444-5_107","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:50:09Z","timestamp":1330210209000},"page":"299-309","source":"Crossref","is-referenced-by-count":0,"title":["Abstract interpretation: A kind of magic"],"prefix":"10.1007","author":[{"given":"Ulf","family":"Nilsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"F. Bancilhon et al. Magic Sets and Other Strange Ways to Implement Logic Programs. In Proc. of 5th ACM Symposium on Principles of Database Systems, pages 1\u201315, 1986.","DOI":"10.1145\/6012.15399"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"C. Beeri and R. Ramakrishnan. On the Power of Magic. In Proc of 6th Symposium on Principles of Database Systems, pages 269\u2013283, 1987.","DOI":"10.1145\/28659.28689"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"M. Bruynooghe. A Practical Framework for the Abstract Interpretation of Logic Programs. To appear in J. Logic Programming, 1990.","DOI":"10.1016\/0743-1066(91)80001-T"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"F. Bry. Query Evaluation in Recursive Databases: Bottom-up and Top-down Reconciled. Data and Knowledge Engineering, 1990. To appear.","DOI":"10.1016\/0169-023X(90)90017-8"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs By Construction or Approximation of Fixpoints. In Conf. Record of Fourth ACM Symposium on POPL, pages 238\u2013252, Los Angeles, 1977.","DOI":"10.1145\/512950.512973"},{"key":"25_CR6","unstructured":"P. Cousot. Semantic Foundations of Program Analysis. In S. Muchnick and N.D. Jones, editors, Program Flow Analysis, pages 303\u2013342. Prentice Hall, 1981."},{"issue":"4","key":"25_CR7","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M. Emden van","year":"1976","unstructured":"M. van Emden and R. Kowalski. The Semantics of Predicate Logic as a Programming Language. J. of ACM, 23(4):733\u2013742, 1976.","journal-title":"J. of ACM"},{"issue":"4","key":"25_CR8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","volume":"2","author":"M. Fitting","year":"1985","unstructured":"M. Fitting. A Kripke-Kleene Semantics for Logic Programs. J. of Logic Programming, 2(4):295\u2013312, 1985.","journal-title":"J. of Logic Programming"},{"key":"25_CR9","unstructured":"N.D. Jones and H. S\u00f8ndergaard. A Semantics-Based Framework for the Abstract Interpretation of Prolog. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, pages 123\u2013142. Ellis Horwood, 1987."},{"key":"25_CR10","unstructured":"T. Kanamori. Abstract Interpretation Based On Alexander Templates. Technical Report TR-549, ICOT, 1990."},{"key":"25_CR11","unstructured":"T. Kanamori and T. Kawamura. Analyzing Success Patterns of Logic Programs by Abstract Hybrid Interpretation. Technical Report TR-279, ICOT, 1987."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second edition, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"25_CR13","unstructured":"C. Mellish. Abstract Interpretation of Prolog Programs. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, pages 181\u2013198. Ellis Horwood, 1987."},{"key":"25_CR14","unstructured":"C. Mellish. Using Specialisation to Reconstruct Two Mode Inference Systems, 1990."},{"key":"25_CR15","unstructured":"K. Marriott and H. S\u00f8ndergaard. Bottom-up Abstract Interpretation of Logic Programs. In Proc. of Fifth International Conf\/Symposium on Logic Programming, Seattle, pages 733\u2013748. MIT Press, 1988."},{"key":"25_CR16","unstructured":"K. Marriott and H. S\u00f8ndergaard. Semantics-Based Dataflow Analysis of Logic Programs. In G. Ritter, editor, Information Processing 89, pages 601\u2013605. North-Holland, 1989."},{"key":"25_CR17","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BFb0024191","volume":"456","author":"U. Nilsson","year":"1990","unstructured":"U. Nilsson. Systematic Semantic Approximations of Logic Programs. In Programming Language Implementation and Logic Programming 90, Lecture Notes in Computer Science 456, pages 293\u2013306. Springer-Verlag, 1990.","journal-title":"Lecture Notes in Computer Science"},{"key":"25_CR18","unstructured":"U. Nilsson and J. Ma\u0142uszy\u0144ski. Logic, Programming and Prolog, John Wiley & Sons, 1990."},{"key":"25_CR19","unstructured":"R. Ramakrishnan. Magic Templates: A Spellbounding Approach to Logic Programming. In Proc. of Fifth International Conf\/Symposium on Logic Programming, Seattle, pages 140\u2013159. MIT Press, 1988."},{"issue":"3","key":"25_CR20","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF03037407","volume":"4","author":"J. Rohmer","year":"1986","unstructured":"J. Rohmer, R. Lescoeur, and J.-M. Kerisit. The Alexander Method\u2014A Technique For the Processing of Recursive Axioms in Deductive Databases. New Generation Computing, 4(3):273\u2013285, 1986.","journal-title":"New Generation Computing"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"H. Tamaki and T. Sato. OLD Resolution with Tabulation. In E Shapiro, editor, Proc. of Third International Conf. on Logic Programming, London, Lecture Notes in Computer Science 225, pages 84\u201398. Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16492-8_66"}],"container-title":["Lecture Notes in Computer Science","Programming Language Implementation and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54444-5_107.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T03:49:13Z","timestamp":1640922553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54444-5_107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544449","9783540383628"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-54444-5_107","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}