{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T19:43:09Z","timestamp":1693856589432},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1007\/bf01178576","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T14:36:30Z","timestamp":1108650990000},"page":"103-129","source":"Crossref","is-referenced-by-count":23,"title":["Frameworks for abstract interpretation"],"prefix":"10.1007","volume":"30","author":[{"given":"Kim","family":"Marriott","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"Birkhoff, G.: Lattice theory, 3rd edn. (AMS Coll. Publ. XXV). Baltimore: American Mathematical Society"},{"key":"CR2","volume-title":"Qualitative reasoning about physical systems","year":"1985","unstructured":"Bobrow, D.G. (ed.): Qualitative reasoning about physical systems. Cambridge, MA: MIT, Press 1985"},{"key":"CR3","unstructured":"Bruynooghe, M., Janssens, G., Callebaut, A., Demoen, B.: Abstract interpretation: towards the global optimization of Prolog programs. Proceedings 1987 International Symposium Logic Programming, San Francisco, California, pp. 192?204 (1987)"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","volume":"7","author":"G. Burn","year":"1986","unstructured":"Burn, G., Hankin, C., Abramsky, S.: Strictness analysis for higher order functions. Sci. Comput. Program.7, 249?278 (1986).","journal-title":"Sci. Comput. Program."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of Fixpoints. Proceedings Fourth Annual. ACM Symposium Principles of Programming Languages, Los Angeles, California, pp. 238?252 (1977).","DOI":"10.1145\/512950.512973"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. Proceedings Sixth Annual ACM Symposium. Principles of Programming Languages, San Antonio, Texas. pp. 269?282 (1979)","DOI":"10.1145\/567752.567778"},{"key":"CR7","series-title":"Proceedings 1990 Australian Joint Conference Artificial Intelligence","first-page":"121","volume-title":"A general theory for abstraction","author":"R. Cremonini","year":"1990","unstructured":"Cremonini, R., Marriott, K., S\u00f8ndergaard, H.: A general theory for abstraction. Proceedings 1990 Australian Joint Conference Artificial Intelligence, pp. 121?134. Singapore: World Scientific Publishing 1990"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M. Emden van","year":"1976","unstructured":"Emden, M. van, Kowalski, R.: The semantics of logic as a programming language. J. ACM23, 733?742 (1976)","journal-title":"J. ACM"},{"key":"CR9","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-10843-2_10","volume-title":"Proceedings eighth International Colloquium Automata, Languages and Programming","author":"N.D. Jones","year":"1981","unstructured":"Jones, N.D.: Flow analysis of lambda expressions In: Even, S., Kariv, O. (eds.) Proceedings eighth International Colloquium Automata, Languages and Programming (Lect. Notes Comput. Sci., vol. 115, pp. 114?128) Berlin Heidelberg New York: Springer 1981"},{"key":"CR10","first-page":"103","volume-title":"Abstract interpretation of declarative languages","author":"N.D. Jones","year":"1987","unstructured":"Jones, N.D.: Flow analysis of lazy higher-order functional programs. In: Abramsky, S., Hankin, C. (eds.) Abstract interpretation of declarative languages, pp. 103?122. Chichester: Ellis Horwood 1987"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0743-1066(92)90031-W","volume":"13","author":"K. Marriott","year":"1992","unstructured":"Marriott, K., S\u00f8ndergaard, H.: Bottom-up dataflow analysis of normal logic programs. J. Logic Program.13, 181?204 (1992)","journal-title":"J. Logic Program."},{"key":"CR12","first-page":"601","volume-title":"Information processing 89","author":"K. Marriott","year":"1989","unstructured":"Marriott, K., S\u00f8ndergaard, H.: Semantics-based dataflow analysis of logic programs. In: Ritter, G. (ed.) Information processing 89, pp. 601?606. Amsterdam: North-Holland 1989"},{"key":"CR13","series-title":"Lect. Notes Comput. Sci.","first-page":"536","volume-title":"Programs as data objects","author":"A. Mycroft","year":"1986","unstructured":"Mycroft, A., Jones, N.: A relational framework for abstract interpretation. InPrograms as data objects (Lect. Notes Comput. Sci., vol. 154, pp. 536?547) Berlin Heidelberg New York: Springer 1986"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF00263194","volume":"18","author":"F. Nielson","year":"1982","unstructured":"Nielson, F.: A denotational framework for data flow analysis. Acta Inf.18, 265?287 (1982)","journal-title":"Acta Inf."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0890-5401(88)90041-7","volume":"76","author":"F. Nielson","year":"1988","unstructured":"Nielson, F.: Strictness analysis and denotational abstract interpretation. Inf. Comput.76, 29?92 (1988)","journal-title":"Inf. Comput."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0004-3702(81)90015-1","volume":"16","author":"D. Plaisted","year":"1981","unstructured":"Plaisted, D.: Theorem proving with abstraction. Artif. Intell.16, 47?108 (1981)","journal-title":"Artif. Intell."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(84)90119-1","volume":"34","author":"T. Sato","year":"1984","unstructured":"Sato, T., Tamaki, H.: Enumeration of success patterns in logic programs. Theor. Comput. Sci.34, 227?240 (1984)","journal-title":"Theor. Comput. Sci."},{"key":"CR18","volume-title":"Denotational Semantics: A Methodology for Language Development","author":"D. Schmidt","year":"1986","unstructured":"Schmidt, D.: Denotational Semantics: A Methodology for Language Development. Needham Heights: Allyn and Bacon 1986"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01178576.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01178576\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01178576","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T09:07:53Z","timestamp":1556615273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01178576"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["BF01178576"],"URL":"https:\/\/doi.org\/10.1007\/bf01178576","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}