{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:31:38Z","timestamp":1725492698484},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433637"},{"type":"electronic","value":"9783540459279"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45927-8_16","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T05:39:04Z","timestamp":1192772344000},"page":"213-227","source":"Crossref","is-referenced-by-count":4,"title":["A Modular, Extensible Proof Method for Small-Step Flow Analyses"],"prefix":"10.1007","author":[{"given":"Mitchell","family":"Wand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Galen B.","family":"Williamson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1006\/inco.1996.0024","volume":"125","author":"M. Abadi","year":"1996","unstructured":"M. Abadi and L. Cardelli. A theory of primitive objects: Untyped and first-order systems. Information and Computation, 125(2):78\u2013102, Mar. 1996.","journal-title":"Information and Computation"},{"key":"16_CR2","unstructured":"A. Aiken and N. Heintze. Constraint-based program analysis. In POPL\u201995 Tutorial, January 1995."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"P. D. Blasio, K. Fisher, and C. Talcott. Analysis for concurrent objects. In H. Bowman and J. Derrick, editors, Proc. 2nd IFIP Workshop on Formal Methods for Open Object-Based Distributed Systems (FMOODS), pages 73\u201388, Canterbury, UK, July 1997. Chapman and Hall, London.","DOI":"10.1007\/978-0-387-35261-9_6"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"C. Bodei, P. Degano, F. Nielson, and H. R. Nielson. Control flow analysis for the \u03c0-calculus. In Proceedings of CONCUR\u201998, pages 611\u2013638, Berlin, Heidelberg, and New York, 1998. Springer-Verlag.","DOI":"10.1007\/BFb0055617"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0019-9958(69)90065-5","volume":"14","author":"W. S. Brainerd","year":"1969","unstructured":"W. S. Brainerd. Tree generating regular systems. Information and Control, 14(2):217\u2013231, 1969.","journal-title":"Information and Control"},{"key":"16_CR6","unstructured":"C. Flanagan and M. Felleisen. Set-based analysis for full scheme and its use in softtyping. Technical Report COMP TR95-253, Department of Computer Science, Rice University, Oct. 1995."},{"key":"16_CR7","volume-title":"Foundations for Programming Languages","author":"J. C. Mitchell","year":"1996","unstructured":"J. C. Mitchell. Foundations for Programming Languages. MIT Press, Cambridge, MA, 1996."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"F. Nielson and H. R. Nielson. Infinitary control flow analysis: a collecting semantics for closure analysis. In Proceedings 24th Annual ACM Symposium on Principles of Programming Languages, pages 332\u2013345. ACM, Jan. 1997.","DOI":"10.1145\/263699.263745"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/200994.201001","volume":"17","author":"J. Palsberg","year":"1995","unstructured":"J. Palsberg. Closure analysis in constraint form. ACM Transactions on Programming Languages and Systems, 17(1):47\u201362, January 1995.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"P. Sestoft. Replacing function parameters by global variables. Master\u2019s thesis, DIKU, University of Copenhagen, Copenhagen, 1989.","DOI":"10.1145\/99370.99374"},{"key":"16_CR11","unstructured":"P. Sestoft. Analysis and efficient implementation of functional programs. PhD thesis, DIKU, University of Copenhagen, Copenhagen, 1991."},{"key":"16_CR12","unstructured":"O. Shivers. Control-Flow Analysis of Higher-Order Languages. PhD thesis, Carnegie-Mellon University, May 1991."}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45927-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T17:29:04Z","timestamp":1556904544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45927-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433637","9783540459279"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45927-8_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}