{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:27:12Z","timestamp":1725456432808},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634683"},{"type":"electronic","value":"9783540695769"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0032757","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:56:10Z","timestamp":1133420170000},"page":"367-378","source":"Crossref","is-referenced-by-count":1,"title":["Abstract interpretation: A theory of approximate computation"],"prefix":"10.1007","author":[{"given":"Kim","family":"Marriott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1093\/logcom\/1.1.5","volume":"1","author":"S. Abramsky","year":"1990","unstructured":"S. Abramsky. Abstract Interpretation, Logical Relations and Kan Extensions. Journal of Logic and Computation, 1(1): 5\u201340, 1990.","journal-title":"Journal of Logic and Computation"},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","volume":"7","author":"G. Burn","year":"1986","unstructured":"G. Burn, C. Hankin and S. Abramsky. Strictness analysis for higher order functions. Science of Computer Programming 7:249\u2013278, 1986.","journal-title":"Science of Computer Programming"},{"key":"28_CR3","unstructured":"Y. Caseau. Abstract interpretation of constraints on order-sorted domains. In Proc of the 1991 Int. Symp. on Logic Programming, pages 435\u2013452. MIT Press, 1991."},{"key":"28_CR4","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 Proc. Fourth Ann. ACM Symp. Principles of Programming Languages, pages 238\u2013252. Los Angeles, California, 1977.","DOI":"10.1145\/512950.512973"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Proc. Sixth Ann. ACM Symp. Principles of Programming Languages, pages 269\u2013282. San Antonio, Texas, 1979.","DOI":"10.1145\/567752.567778"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretation. In Proc. Ninetenth Ann. ACM Symp. Principles of Programming Languages, pages 83\u201394. Alberquerque, NM, 1992.","DOI":"10.1145\/143165.143184"},{"issue":"4","key":"28_CR7","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Abstract Interpretation Frameworks. Journal of Logic and Computation, 2(4):511\u2013547, 1992.","journal-title":"Journal of Logic and Computation"},{"key":"28_CR8","first-page":"417","volume-title":"International Symposium on Logic Programming","author":"M. Garcia de la Banda","year":"1995","unstructured":"M. Garcia de la Banda, K. Marriott, and P. Stuckey. Efficient analysis of logic programs with dynamic scheduling. International Symposium on Logic Programming, pages 417\u2013431. MIT Press. Portland, USA. Dec 1995."},{"key":"28_CR9","unstructured":"F. Giunchiglia and T. Walsh. Abstract theorem proving. Proc. Int. Joint Conf. Artificial Intelligence-89, pages 372\u2013377, Detroit, Michigan, 1989."},{"issue":"2","key":"28_CR10","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1006\/jcss.1995.1061","volume":"51","author":"R. Helm","year":"1995","unstructured":"R. Helm, K. Marriott and M. Odersky. Spatial query optimization: From Boolean constraints to range queries. Journal of Computer and System Science 51 (2): 197\u2013210, 1995.","journal-title":"Journal of Computer and System Science"},{"key":"28_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(80)90033-8","volume":"14","author":"R. E. Korf","year":"1980","unstructured":"R. E. Korf. Toward a model of representation changes. Artificial Intelligence 14:41\u201378, 1980.","journal-title":"Artificial Intelligence"},{"key":"28_CR12","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0004-3702(87)90051-8","volume":"33","author":"R. E. Korf","year":"1987","unstructured":"R. E. Korf. Planning as search: A quantitative approach. Artificial Intelligence 33: 65\u201388, 1987.","journal-title":"Artificial Intelligence"},{"key":"28_CR13","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BF01178576","volume":"30","author":"K. Marriott","year":"1993","unstructured":"K. Marriott. Frameworks for abstract interpretation. Acta Informatica 30, 103\u2013129, 1993.","journal-title":"Acta Informatica"},{"key":"28_CR14","first-page":"240","volume-title":"Proc. 21st ACM Symp. Principles of Programming Languages","author":"K. Marriott","year":"1994","unstructured":"K. Marriott, M. Garcia de la Banda and M. Hermenegildo. Analyzing logic programs with dynamic scheduling. Proc. 21st ACM Symp. Principles of Programming Languages, pages 240\u2013253. Portland, USA. ACM Press, 1994."},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"K. Marriott and H. S\u00f8ndergaard. Bottom-up dataflow analysis of normal logic programs. Journal of Logic Programming, pp. 181\u2013204, 1992.","DOI":"10.1016\/0743-1066(92)90031-W"},{"key":"28_CR16","first-page":"531","volume-title":"Logic Programming: Proc. 1990 North American Conf.","author":"K. Marriott","year":"1990","unstructured":"K. Marriott and H. S\u00f8ndergaard. Analysis of constraint logic programs. In S. Debray and M. Hermenegildo, editors, Logic Programming: Proc. 1990 North American Conf., pages 531\u2013547. Austin, USA. MIT Press, 1990."},{"issue":"3","key":"28_CR17","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1145\/177492.177650","volume":"16","author":"K. Marriott","year":"1994","unstructured":"K. Marriott, H. S\u00f8ndergaard and N. D. Jones. Denotational abstract interpretation of logic programs. ACM Trans. Programming Languages and Systems 16 (3): 607\u2013648, 1994.","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"28_CR18","first-page":"558","volume-title":"International Symposium on Logic Programming","author":"K. Marriott","year":"1994","unstructured":"K. Marriott and P. Stuckey. Approximating possible interaction between linear arithmetic constraints. International Symposium on Logic Programming, pages 558\u201371. MIT Press. Ithaca, USA. Nov. 1994."},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"A. Mycroft and N.D. Jones. A relational framework for abstract interpretation. In H. Ganzinger and N. D. Jones, editors, Programs as Data Objects (Lecture Notes in Computer Science 217), pages 536\u2013547. Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16446-4_9"},{"key":"28_CR20","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01939983","volume":"3","author":"P. Naur","year":"1963","unstructured":"P. Naur. The design of the Gier Algol compiler, part II. BIT 3: 145\u2013166, 1963.","journal-title":"BIT"},{"key":"28_CR21","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF00263194","volume":"18","author":"F. Nielson","year":"1982","unstructured":"F. Nielson. A denotational framework for data flow analysis. Acta Informatica 18, pp. 265\u2013287, 1982.","journal-title":"Acta Informatica"},{"issue":"1","key":"28_CR22","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0890-5401(88)90041-7","volume":"76","author":"F. Nielson","year":"1988","unstructured":"F. Nielson. Strictness analysis and denotational abstract interpretation. Information and Computation 76 (1): 29\u201392, 1988.","journal-title":"Information and Computation"},{"key":"28_CR23","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(89)90091-1","volume":"69","author":"F. Nielson","year":"1989","unstructured":"F. Nielson. Two level semantics and abstract interpretation. Theoretical Computer Science \u2014 Fund. Studies 69 117\u2013242, 1989.","journal-title":"Theoretical Computer Science \u2014 Fund. Studies"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"F. Nielson. Semantics-directed program analysis: A tool-maker's perspective. SAS'96, Springer-Verlag, LNCS 1145, pp. 2\u201321, 1996.","DOI":"10.1007\/3-540-61739-6_30"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"D. Plaisted. Abstraction mappings in mechanical theorem proving. W. Bibel and R. Kowalski, editors, Fifth Conf. on Automated Deduction, pages 264\u2013280, (Lecture Notes in Computer Science 87), Springer Verlag, 1980.","DOI":"10.1007\/3-540-10009-1_21"},{"key":"28_CR26","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0004-3702(81)90015-1","volume":"16","author":"D. Plaisted","year":"1981","unstructured":"D. Plaisted. Theorem proving with abstraction. Artificial Intelligence 16: 47\u2013108, 1981.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"28_CR27","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF03037324","volume":"2","author":"D. Plaisted","year":"1984","unstructured":"D. Plaisted. The occur-check problem in Prolog. New Generation Computing 2 (4) 309\u2013322, 1984.","journal-title":"New Generation Computing"},{"key":"28_CR28","unstructured":"J. C. Reynolds. Automatic computation of data set definitions. In A. Morrell, editor, Information Processing 68, pages 456\u2013461. North-Holland, 1969."},{"key":"28_CR29","doi-asserted-by":"crossref","unstructured":"J. C. Reynolds. On the relation between direct and continuation semantics. In J. Loeckx, editor, Proc. Second Int. Coll. Automata, Languages and Programming (Lecture Notes in Computer Science 14), pages 141\u2013156. Springer-Verlag, 1974.","DOI":"10.1007\/3-540-06841-4_57"},{"key":"28_CR30","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0004-3702(74)90026-5","volume":"5","author":"E. D. Sacerdoti","year":"1974","unstructured":"E. D. Sacerdoti. Planning in a hierarchy of abstraction spaces. Artificial Intelligence 5: 115\u2013135, 1974.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"28_CR31","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1145\/942578.807086","volume":"7","author":"M. Sintzoff","year":"1972","unstructured":"M. Sintzoff. Calculating Properties of Programs by Valuation on Specific Models. SIGPLAN Notices 7 (1): 203\u2013207, 1972. Proc. ACM Conf. Proving Assertions about Programs.","journal-title":"SIGPLAN Notices"},{"key":"28_CR32","unstructured":"D. Weld and J. de Kleer (editors), Readings in Qualitative Reasoning about Physical Systems, Morgan Kaufmann Publisher, 1990."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T15:29:11Z","timestamp":1554737351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032757"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634683","9783540695769"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/bfb0032757","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}