{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:16Z","timestamp":1725456016811},"publisher-location":"Berlin\/Heidelberg","reference-count":16,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354053010X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0024191","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T09:49:34Z","timestamp":1132393774000},"page":"293-306","source":"Crossref","is-referenced-by-count":10,"title":["Systematic semantic approximations of logic programs"],"prefix":"10.1007","author":[{"given":"Ulf","family":"Nilsson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","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":"20_CR2","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"},{"issue":"8","key":"20_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/872734.806926","volume":"12","author":"P. Cousot","year":"1977","unstructured":"P. Cousot and R. Cousot. Automatic Synthesis of Optimal Invariant Assertions: Mathematical Foundations. SIGPLAN Notices, 12(8):1\u201312, 1977.","journal-title":"SIGPLAN Notices"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. In Conf. Record of 6th ACM Symposium on POPL, pages 269\u2013282, San Antonio, Texas, 1979.","DOI":"10.1145\/567752.567778"},{"issue":"3","key":"20_CR5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0743-1066(88)90010-6","volume":"5","author":"S. Debray","year":"1988","unstructured":"S. Debray and D.S. Warren. Automatic Mode Inference for Logic Programs. J. of Logic Programming, 5(3):207\u2013230, 1988.","journal-title":"J. of Logic Programming"},{"key":"20_CR6","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":"20_CR7","unstructured":"T. Kanamori and T. Kawamura. Analyzing Success Patterns of Logic Programs by Abstract Hybrid Interpretation. Technical Report TR-279, ICOT, 1987."},{"key":"20_CR8","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":"20_CR9","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":"20_CR10","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":"20_CR11","series-title":"Research Report","volume-title":"Bottom-up Dataflow Analysis of Normal Logic Programs","author":"K. Marriott","year":"1989","unstructured":"K. Marriott and H. S\u00f8ndergaard. Bottom-up Dataflow Analysis of Normal Logic Programs. Research Report RC 14858, IBM T. J. Watson Research Center, Yorktown Heights, New York, 1989."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"U. Nilsson. A Systematic Approach to Abstract Interpretation of Logic Programs. Licentiate Thesis 196, Department of Computer and Information Science, Link\u00f6ping University, 1989.","DOI":"10.1007\/3-540-50820-1_41"},{"key":"20_CR13","first-page":"68","volume":"348","author":"U. Nilsson","year":"1989","unstructured":"U. Nilsson. Towards a Framework for the Abstract Interpretation of Logic Programs. In Proc. of PLILP '88, Orleans, France, pages 68\u201382. LNCS 348, Springer-Verlag, 1989.","journal-title":"LNCS"},{"key":"20_CR14","unstructured":"U. Nilsson and J. Ma\u0142uszy\u0144ski. Logic, Programming and Prolog. John Wiley & Sons, 1990."},{"key":"20_CR15","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"A. Tarski. A Lattice Theoretical Fixpoint Theorem and Its Applications. Pacific J. Math, 5:285\u2013309, 1955.","journal-title":"Pacific J. Math"},{"key":"20_CR16","unstructured":"W. Winsborough. Path-Dependent Reachability Analysis for Multiple Specialization. In Proc. of North American Conference on Logic Programming, Cleveland, pages 133\u2013153. MIT Press, 1989."}],"container-title":["Lecture Notes in Computer Science","Programming Language Implementation and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0024191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T14:06:48Z","timestamp":1683295608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354053010X"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0024191","relation":{},"subject":[]}}