{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:01Z","timestamp":1725663961701},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578772"},{"type":"electronic","value":"9783540483717"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57877-3_13","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:35:08Z","timestamp":1330263308000},"page":"188-202","source":"Crossref","is-referenced-by-count":6,"title":["A suite of analysis tools based on a general purpose abstract interpreter"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Cheatham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiming","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Stefanescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"13_CR1","unstructured":"Thomas Cheatham, Haiming Gao, and Dan Stefanescu The Harvard Abstract Interpreter Technical Report, Harvard University, April 1993."},{"key":"13_CR2","unstructured":"Thomas Cheatham, Jr., Amr Fahmy and Dan Stefanescu BSP-L \u2014 A Programming Language for the Bulk Synchronous Processing Model, Center for Research in Computing Technology, Harvard University, December 1993"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Patrick Cousot and Radhia Couspt Abstract interpretation: a unified lattice model for static analysis of programs by construction of approximate fixpoints, Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, pages 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Neil Jones and Alan Mycroft Data Flow Analysis of Applicative Programs Using Minimal Functions Graphs: Abridged Version, Conference Record of the Thirteenth ACM Symposium on Principles of Programming Languages, pages 296\u2013306, 1986.","DOI":"10.1145\/512644.512672"},{"key":"13_CR5","unstructured":"Mike Karr and Steve Rosen Dynamic Crossreference Analysis, lecture notes, 1992."},{"key":"13_CR6","unstructured":"Jens Palsberg and Michael I. Schwartzbach Safety Analysis versus Type Inference, Information and Computation, to appear."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Olin Shivers Control Flow Analysis in Scheme ACM SIGPLAN '88 Conference on Programming Language Design and Implementation, Atlanta GA, June 22\u201324, 1988.","DOI":"10.1145\/53990.54007"},{"key":"13_CR8","unstructured":"Olin Shivers Control-Flow Analysis of Higher Order Languages or Taming Lambda, Technical Report CMU-CS-91-145, Carnegie Mellon University, May 1991."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Peter Sestoft Replacing Function Parameters by Global Variables, FPCA'89, pages 39\u201353, 1989.","DOI":"10.1145\/99370.99374"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Dan Stefanescu and Yuli Zhou An Equational Framework for the Abstract Analysis of Functional Programs, Proceedings of ACM Conference on Lisp and Functional Programming, Orlando, 1994.","DOI":"10.1145\/182409.182497"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Mitchell Wand and Paul Steckler Selective and Lightweight Closure Conversion, ACM Symposium on Principles of Programming Languages, Portland, 1994.","DOI":"10.1145\/174675.178044"},{"key":"13_CR12","unstructured":"Atty Kanamori and Daniel Weise An Empirical Study of an Abstract Interpretation of Scheme Programs Technical Report CSL-TR-92-521, Computer Systems Laboratory, Stanford University, April 1992."},{"issue":"No.3","key":"13_CR13","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1145\/151640.151643","volume":"1","author":"M. Hall","year":"1992","unstructured":"Mary Hall and Ken Kennedy, Efficient Call Graph Analysis, ACM Letters on Programming Languages and Systems, Vol. 1, No. 3, Sept. 1992, pp 227\u2013242.","journal-title":"ACM Letters on Programming Languages and Systems"},{"issue":"8","key":"13_CR14","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L. G. Valiant","year":"1990","unstructured":"L. G. Valiant A Bridging Model for Parallel Computation Communications of the ACM, 33(8):103\u2013111, 1990","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57877-3_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:03Z","timestamp":1605647703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57877-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578772","9783540483717"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-57877-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}