{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:36Z","timestamp":1763468016711},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157684"},{"type":"electronic","value":"9783642157691"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15769-1_25","type":"book-chapter","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T06:09:40Z","timestamp":1284358180000},"page":"407-421","source":"Crossref","is-referenced-by-count":12,"title":["Abstract Interpreters for Free"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Might","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"A functional correspondence between evaluators and abstract machines. ACM Press, New York (2003)"},{"issue":"1","key":"25_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.tcs.2005.06.008","volume":"342","author":"M. Ager","year":"2005","unstructured":"Ager, M., Danvy, O., Midtgaard, J.: A functional correspondence between monadic evaluators and abstract machines for languages with computational effects. Theoretical Computer Science 342(1),149\u2013172 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"25_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.ipl.2004.02.012","volume":"90","author":"M.S. Ager","year":"2004","unstructured":"Ager, M.S., Danvy, O., Midtgaard, J.: A functional correspondence between call-by-need evaluators and lazy abstract machines. Processing Letters\u00a090(5), 223\u2013232 (2004)","journal-title":"Processing Letters"},{"key":"25_CR4","first-page":"238","volume-title":"Conference Record of the Fourth ACM Symposium on Principles of Programming Languages","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, pp. 238\u2013252. ACM Press, New York (1977)"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/567752.567778","volume-title":"POPL 1979: Proceedings of the 6th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages","author":"P. Cousot","year":"1979","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: POPL 1979: Proceedings of the 6th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 269\u2013282. ACM Press, New York (1979)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Danvy, O., Millikin, K.: A rational deconstruction of landin\u2019s secd machine with the j operator. Logical Methods in Computer Science\u00a04(4) (November 2008)","DOI":"10.2168\/LMCS-4(4:12)2008"},{"issue":"8","key":"25_CR7","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1016\/j.scico.2007.10.007","volume":"74","author":"O. Danvy","year":"2009","unstructured":"Danvy, O., Millikin, K.: Refunctionalization at work. Science of Computer Programming\u00a074(8), 534\u2013549 (2009)","journal-title":"Science of Computer Programming"},{"key":"25_CR8","unstructured":"Midtgaard, J.: Transformation, Analysis, and Interpretation of Higher-Order Procedural Programs. PhD thesis, University of Aarhus (2007)"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-93900-9_22","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"M. Might","year":"2009","unstructured":"Might, M., Manolios, P.: A posteriori soundness for non-deterministic abstract interpretations. In: Jones, N.D., M\u00fcller-Olm, M. (eds.) VMCAI 2009. LNCS, vol.\u00a05403, pp. 260\u2013274. Springer, Heidelberg (2009)"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1159803.1159807","volume-title":"ICFP 2006: Proceedings of the Eleventh ACM SIGPLAN International Conference on Functional Programming","author":"M. Might","year":"2006","unstructured":"Might, M., Shivers, O.: Improving flow analyses via \u03b3cfa: Abstract garbage collection and counting. In: ICFP 2006: Proceedings of the Eleventh ACM SIGPLAN International Conference on Functional Programming, pp. 13\u201325. ACM, New York (2006)"},{"issue":"5-6","key":"25_CR11","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1017\/S0956796808006941","volume":"18","author":"M. Might","year":"2008","unstructured":"Might, M., Shivers, O.: Exploiting reachability and cardinality in higher-order flow analysis. Journal of Functional Programming, Special Double Issue\u00a018(5-6), 821\u2013864 (2008)","journal-title":"Journal of Functional Programming, Special Double Issue"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1145\/263699.263745","volume-title":"POPL 1997: Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"F. Nielson","year":"1997","unstructured":"Nielson, F., Nielson, H.R.: Infinitary control flow analysis: a collecting semantics for closure analysis. In: POPL 1997: Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 332\u2013345. ACM, New York (1997)"},{"key":"25_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F. Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis, Corrected\u00a0ed. Springer, Heidelberg (October 1999)"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1109\/ICIS.2009.145","volume-title":"ICIS 2009: Proceedings of the 2009 Eigth IEEE\/ACIS International Conference on Computer and Information Science","author":"J. Qian","year":"2009","unstructured":"Qian, J., Zhao, L., Cai, G., Gu, T.: Automatic construction of complete abstraction by abstract interpretation. In: ICIS 2009: Proceedings of the 2009 Eigth IEEE\/ACIS International Conference on Computer and Information Science, Washington, DC, USA, pp. 927\u2013932. IEEE Computer Society, Los Alamitos (2009)"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1145\/800194.805852","volume-title":"ACM 1972: Proceedings of the ACM Annual Conference","author":"J.C. Reynolds","year":"1972","unstructured":"Reynolds, J.C.: Definitional interpreters for higher-order programming languages. In: ACM 1972: Proceedings of the ACM Annual Conference, pp. 717\u2013740. ACM, New York (1972)"},{"key":"25_CR16","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/3-540-62503-8_4","volume-title":"Selected papers from the 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages","author":"D.A. Schmidt","year":"1997","unstructured":"Schmidt, D.A.: Abstract interpretation of small-step semantics. In: Selected papers from the 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages, London, UK, pp. 76\u201399. Springer, Heidelberg (1997)"},{"key":"25_CR17","unstructured":"Scott, D., Strachey, C.: Towards a formal semantics, pp. 197\u2013220 (1966)"},{"key":"25_CR18","series-title":".","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1145\/53990.54007","volume-title":"Proceedings of the ACM SIGPLAN 1988 Conference on Programming Language Design and Implementation","author":"O. Shivers","year":"1988","unstructured":"Shivers, O.: Control flow analysis in Scheme. In: Proceedings of the ACM SIGPLAN 1988 Conference on Programming Language Design and Implementation, vol.\u00a023, pp. 164\u2013174. ACM, New York (July 1988)"},{"key":"25_CR19","unstructured":"Shivers, O.\u00a0G.: Control-Flow Analysis of Higher-Order Languages. PhD thesis, Carnegie Mellon University (1991)"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/292540.292567","volume-title":"POPL 1999: Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"M. Wand","year":"1999","unstructured":"Wand, M., Siveroni, I.: Constraint systems for useless variable elimination. In: POPL 1999: Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 291\u2013302. ACM, New York (1999)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15769-1_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:17:35Z","timestamp":1619785055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15769-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157684","9783642157691"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15769-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}