{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:43:11Z","timestamp":1780994591387,"version":"3.54.1"},"reference-count":185,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T00:00:00Z","timestamp":1338508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2012,6]]},"abstract":"<jats:p>We present a survey of control-flow analysis of functional programs, which has been the subject of extensive investigation throughout the past 30 years. Analyses of the control flow of functional programs have been formulated in multiple settings and have led to many different approximations, starting with the seminal works of Jones, Shivers, and Sestoft. In this article, we survey control-flow analysis of functional programs by structuring the multitude of formulations and approximations and comparing them.<\/jats:p>","DOI":"10.1145\/2187671.2187672","type":"journal-article","created":{"date-parts":[[2012,6,15]],"date-time":"2012-06-15T15:31:37Z","timestamp":1339774297000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":58,"title":["Control-flow analysis of functional programs"],"prefix":"10.1145","volume":"44","author":[{"given":"Jan","family":"Midtgaard","sequence":"first","affiliation":[{"name":"Aarhus University, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,6,14]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 9th European Conference on Object-Oriented Programming (ECOOP'95)","volume":"952","author":"Agesen O.","year":"1995"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(99)00007-6"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture, 427--447","author":"Aiken A."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/99583.99621"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science (LICS'92)","author":"Aiken A."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/165180.165188"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/390013.808479"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/155183.155231"},{"key":"e_1_2_1_9_1","volume-title":"BRICS, Department of Computer Science","author":"Amtoft T."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 9th European Symposium on Programming. Lecture Notes in Computer Science","volume":"1782","author":"Amtoft T."},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","volume-title":"Compiling with Continuations","author":"Appel A. W.","DOI":"10.1017\/CBO9780511609619"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75303"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/291891.291898"},{"key":"e_1_2_1_15_1","volume-title":"Actes WSA Workshop on Static Analysis. 126--134","author":"Ayers A. E.","year":"1992"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/258948.258951"},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Banerjee A. Heintze N. and \n      Riecke J. G\n  . \n  2001\n  . Design and correctness of program transformations based on control-flow analysis. In Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software (TACS'01) N. Kobayashi and B. C. Pierce Eds. Lecture Notes in Computer Science vol. \n  2215\n  . \n  Springer-Verlag Berlin 420--447.   Banerjee A. Heintze N. and Riecke J. G. 2001. Design and correctness of program transformations based on control-flow analysis. In Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software (TACS'01) N. Kobayashi and B. C. Pierce Eds. Lecture Notes in Computer Science vol. 2215. Springer-Verlag Berlin 420--447.","DOI":"10.1007\/3-540-45500-0_21"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129502003845"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(96)00040-8"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263753"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268949"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(91)90035-V"},{"key":"e_1_2_1_24_1","volume-title":"DIKU, Computer Science Department","author":"Bondorf A."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800000769"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 6th International Conference on Compiler Construction. 192--207","author":"Boucher D."},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","volume-title":"Efficient chaotic iteration strategies with widenings","author":"Bourdoncle F.","DOI":"10.1007\/BFb0039704"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.06.004"},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the 9th European Symposium on Programming. Lecture Notes in Computer Science","volume":"1782","author":"Cejtin H."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328460"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/182409.156786"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91668"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture. 496--519","author":"Consel C."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_2_1_35_1","volume-title":"IFIP Conference on Formal Description of Programming Concepts, E. J. Neuhold, Ed. 237--277","author":"Cousot P."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/2.4.511"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming (PLILP '92)","volume":"631","author":"Cousot P."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224199"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31987-0_3"},{"key":"e_1_2_1_40_1","volume-title":"BRICS Ph.D. School","author":"Damian D."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80955-1"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796803004702"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796802004379"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500001535"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/773184.773202"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349309"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/262004.262006"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96725"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263750"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/507635.507640"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349332"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/647163.717685"},{"key":"e_1_2_1_53_1","first-page":"260","article-title":"Polyvariance, polymorphism and flow analysis. In Selected Papers from the 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages","volume":"1192","author":"Fax\u00e9n K.-F.","year":"1997","journal-title":"Lecture Notes in Computer Science"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/316686.316703"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012936614361"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/258948.258954"},{"key":"e_1_2_1_58_1","volume-title":"Proceedings of the 3rd European Symposium on Programming, N. D. Jones, Ed. Lecture Notes in Computer Science","volume":"432","author":"Goldberg B."},{"key":"e_1_2_1_59_1","volume-title":"Proceedings of the 2nd Symposium on Programs as Data Objects (PADO'01)","volume":"2053","author":"Gustavsson J."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.5555\/860256.860264"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796898003025"},{"key":"e_1_2_1_62_1","doi-asserted-by":"crossref","unstructured":"Harrison III W. L. 1989. The interprocedural analysis and automatic parallelization of Scheme programs. LISP Symbol. Comput. 2 3\/4 179--396.  Harrison III W. L. 1989. The interprocedural analysis and automatic parallelization of Scheme programs. LISP Symbol. Comput. 2 3\/4 179--396.","DOI":"10.1007\/BF01808954"},{"key":"e_1_2_1_63_1","volume-title":"Proceedings of the 5th International Workshop on Languages and Compilers for Parallel Computing. Springer-Verlag, 512--537","author":"Harrison III, W. L."},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/182409.182495"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.5555\/647163.760061"},{"key":"e_1_2_1_67_1","volume-title":"Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, J. Mitchell, Ed. 42--51","author":"Heintze N."},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96729"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/258915.258939"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/258948.258963"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.5555\/788019.788876"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.5555\/645420.652514"},{"key":"e_1_2_1_74_1","unstructured":"Henglein F. Makholm H. and Niss H. 2005. Effect type systems and region-based memory management. In Advanced Topics in Types and Programming Languages B. Pierce Ed. The MIT Press Cambridge MA.  Henglein F. Makholm H. and Niss H. 2005. Effect type systems and region-based memory management. In Advanced Topics in Types and Programming Languages B. Pierce Ed. The MIT Press Cambridge MA."},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/379605.379665"},{"key":"e_1_2_1_76_1","unstructured":"Hudak P. 1987. A semantic model of reference counting and its abstraction. In Abstract Interpretation of Declarative Languages. Fellis Harwood 45--62.  Hudak P. 1987. A semantic model of reference counting and its abstraction. In Abstract Interpretation of Declarative Languages. Fellis Harwood 45--62."},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/103135.103139"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/2.4.483"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268973"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199536"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.5555\/647166.717979"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.5555\/860256.860267"},{"key":"e_1_2_1_83_1","volume-title":"Proceedings of the 6th European Symposium on Programming, H. R. Nielson, Ed. Lecture Notes in Computer Science","volume":"1058","author":"Jensen T. P."},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237728"},{"key":"e_1_2_1_85_1","volume-title":"Functional Programming Languages and Computer Architecture, J.-P","author":"Johnsson T."},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1145\/1115880.1115883"},{"key":"e_1_2_1_87_1","volume-title":"Flow analysis of lambda expressions. Tech. rep. PB-128","author":"Jones N. D."},{"key":"e_1_2_1_88_1","volume-title":"Proceedings of the 8th Colloquium on Automata, Languages and Programming., S. Even and O. Kariv, Eds. Lecture Notes in Computer Science","volume":"115","author":"Jones N. D.","year":"1981"},{"key":"e_1_2_1_89_1","unstructured":"Jones N. D. 1987. Flow analysis of lazy higher-order functional programs. In Abstract Interpretation of Declarative Languages. Ellis Harwood. 103--122.  Jones N. D. 1987. Flow analysis of lazy higher-order functional programs. In Abstract Interpretation of Declarative Languages. Ellis Harwood. 103--122."},{"key":"e_1_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.12.030"},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1145\/567752.567776"},{"key":"e_1_2_1_92_1","unstructured":"Jones N. D. and Muchnick S. S. 1981. Complexity of flow analysis inductive assertion synthesis and a language due to Dijkstra. In Program Flow Analysis: Theory and Applications. Prentice-Hall Upper Saddle River NJ. 380--393.  Jones N. D. and Muchnick S. S. 1981. Complexity of flow analysis inductive assertion synthesis and a language due to Dijkstra. In Program Flow Analysis: Theory and Applications. Prentice-Hall Upper Saddle River NJ. 380--393."},{"key":"e_1_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/582153.582161"},{"key":"e_1_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/512644.512672"},{"key":"e_1_2_1_95_1","unstructured":"Jones N. D. and Rosendahl M. 1997. Higher-order minimal function graphs. J. Funct. Logic Program. 2.  Jones N. D. and Rosendahl M. 1997. Higher-order minimal function graphs. J. Funct. Logic Program. 2."},{"key":"e_1_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1145\/512927.512945"},{"key":"e_1_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1145\/996841.996867"},{"key":"e_1_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1145\/12276.13333"},{"key":"e_1_2_1_99_1","unstructured":"Kranz D. A. 1988. Orbit: An optimizing compiler for Scheme. Ph.D. dissertation Computer Science Department Yale University New Haven CT. Res. rep. 632.   Kranz D. A. 1988. Orbit: An optimizing compiler for Scheme. Ph.D. dissertation Computer Science Department Yale University New Haven CT. Res. rep. 632."},{"key":"e_1_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/6.4.308"},{"key":"e_1_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00223-X"},{"key":"e_1_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.5555\/646840.708813"},{"key":"e_1_2_1_103_1","volume-title":"Proceedings of the 7th International Conference on Compiler Construction (CC'98)","volume":"1383","author":"Malacaria P."},{"key":"e_1_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00049-9"},{"key":"e_1_2_1_105_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111057"},{"key":"e_1_2_1_106_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-005-4876-5"},{"key":"e_1_2_1_107_1","volume-title":"Subcubic control flow analysis algorithms. Computer science res. rep. 125","author":"Midtgaard J."},{"key":"e_1_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69166-2_23"},{"key":"e_1_2_1_109_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596550.1596592"},{"key":"e_1_2_1_110_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11319-2_20"},{"key":"e_1_2_1_111_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111049"},{"key":"e_1_2_1_112_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159803.1159807"},{"key":"e_1_2_1_113_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806631"},{"key":"e_1_2_1_114_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90014-4"},{"key":"e_1_2_1_115_1","volume-title":"Proceedings of the 2nd International Symposium Static Analysis (SAS'95)","volume":"983","author":"Mohnen M.","year":"1995"},{"key":"e_1_2_1_117_1","first-page":"214","article-title":"Higher-order value flow graphs","volume":"5","author":"Mossin C.","year":"1998","journal-title":"Nordic J. Comput."},{"key":"e_1_2_1_118_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129502003857"},{"key":"e_1_2_1_119_1","doi-asserted-by":"crossref","unstructured":"Muylaert-Filho J. A. and Burn G. L. 1993. Continuation passing transformation and abstract interpretation. In Proceedings of the 1st Imperial College Department of Computing Workshop on Theory and Formal Methods G. L. Burn S. J. Gay and M. D. Ryan Eds. Workshops in Computing Series. Springer-Verlag 247--259.   Muylaert-Filho J. A. and Burn G. L. 1993. Continuation passing transformation and abstract interpretation. In Proceedings of the 1st Imperial College Department of Computing Workshop on Theory and Formal Methods G. L. Burn S. J. Gay and M. D. Ryan Eds. Workshops in Computing Series. Springer-Verlag 247--259.","DOI":"10.1007\/978-1-4471-3503-6_19"},{"key":"e_1_2_1_120_1","doi-asserted-by":"publisher","DOI":"10.1145\/1016850.1016871"},{"key":"e_1_2_1_121_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263745"},{"key":"e_1_2_1_122_1","volume-title":"Proceedings of the 8th European Symposium on Programming, S. D. Swierstra, Ed. Lecture Notes in Computer Science","volume":"1576","author":"Nielson F."},{"key":"e_1_2_1_123_1","doi-asserted-by":"crossref","unstructured":"Nielson F. Nielson H. R. and Hankin C. 1999. Principles of Program Analysis. Springer-Verlag Berlin.   Nielson F. Nielson H. R. and Hankin C. 1999. Principles of Program Analysis. Springer-Verlag Berlin.","DOI":"10.1007\/978-3-662-03811-6"},{"key":"e_1_2_1_124_1","volume-title":"Proceedings of the 7th International Conference on Compiler Construction. Lecture Notes in Computer Science","volume":"1383","author":"Nielson H. R."},{"key":"e_1_2_1_125_1","series-title":"Lecture Notes in Computer Science","volume-title":"Computing in Systems Described by Equations","author":"O'Donnell M."},{"key":"e_1_2_1_126_1","volume-title":"Proceedings of the European Conference on Object-Oriented Programming (ECOOP'92)","volume":"615","author":"Oxh\u00f8j N."},{"key":"e_1_2_1_127_1","volume-title":"Proceedings of the International Conference on Principles and Practice of Constraint Programming. G. Smolka, Ed. Lecture Notes in Computer Science","volume":"1330","author":"Pacholski L."},{"key":"e_1_2_1_128_1","doi-asserted-by":"publisher","DOI":"10.5555\/648222.751396"},{"key":"e_1_2_1_129_1","doi-asserted-by":"publisher","DOI":"10.1145\/200994.201001"},{"key":"e_1_2_1_130_1","doi-asserted-by":"publisher","DOI":"10.1145\/295656.295662"},{"key":"e_1_2_1_131_1","doi-asserted-by":"publisher","DOI":"10.1145\/379605.379635"},{"key":"e_1_2_1_132_1","doi-asserted-by":"publisher","DOI":"10.1145\/210184.210187"},{"key":"e_1_2_1_133_1","doi-asserted-by":"publisher","DOI":"10.1017\/S095679680100394X"},{"key":"e_1_2_1_134_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1058"},{"key":"e_1_2_1_135_1","doi-asserted-by":"publisher","DOI":"10.1145\/232706.232715"},{"key":"e_1_2_1_136_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796802004513"},{"key":"e_1_2_1_137_1","doi-asserted-by":"publisher","DOI":"10.1145\/143095.143125"},{"key":"e_1_2_1_138_1","volume-title":"Types and Programming Languages","author":"Pierce B. C."},{"key":"e_1_2_1_139_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"e_1_2_1_140_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-006-8611-7"},{"key":"e_1_2_1_141_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.360208"},{"key":"e_1_2_1_142_1","doi-asserted-by":"crossref","volume-title":"Concurrent Programming in ML","author":"Reppy J.","DOI":"10.1017\/CBO9780511574962"},{"key":"e_1_2_1_143_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159876.1159888"},{"key":"e_1_2_1_144_1","volume-title":"Information Processing 68","volume":"1","author":"Reynolds J. C.","year":"1969"},{"key":"e_1_2_1_145_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010027404223"},{"key":"e_1_2_1_146_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010075320153"},{"key":"e_1_2_1_148_1","doi-asserted-by":"publisher","DOI":"10.1145\/141471.141545"},{"key":"e_1_2_1_149_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80024-3"},{"key":"e_1_2_1_150_1","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178244"},{"key":"e_1_2_1_151_1","unstructured":"Saha B. Heintze N. and Oliva D. 1998. Subtransitive CFA using types. Res. rep. 1166 Department of Computer Science Yale University New Haven CT.  Saha B. Heintze N. and Oliva D. 1998. Subtransitive CFA using types. Res. rep. 1166 Department of Computer Science Yale University New Haven CT."},{"key":"e_1_2_1_152_1","doi-asserted-by":"publisher","DOI":"10.5555\/647163.717672"},{"key":"e_1_2_1_153_1","series-title":"Lecture Notes in Computer Science","volume-title":"Selected Papers from the 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages","author":"Schmidt D. A."},{"key":"e_1_2_1_154_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007734417713"},{"key":"e_1_2_1_155_1","doi-asserted-by":"publisher","DOI":"10.1016\/0096-0551(75)90015-6"},{"key":"e_1_2_1_156_1","doi-asserted-by":"publisher","DOI":"10.5555\/7349"},{"key":"e_1_2_1_158_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291165"},{"key":"e_1_2_1_159_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575467_19"},{"key":"e_1_2_1_160_1","doi-asserted-by":"publisher","DOI":"10.1145\/315891.315934"},{"key":"e_1_2_1_161_1","doi-asserted-by":"publisher","DOI":"10.1145\/232627.232635"},{"key":"e_1_2_1_163_1","doi-asserted-by":"publisher","DOI":"10.1145\/99370.99374"},{"key":"e_1_2_1_165_1","doi-asserted-by":"publisher","DOI":"10.1145\/182409.156783"},{"key":"e_1_2_1_166_1","unstructured":"Sharir M. and Pnueli A. 1981. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications Prentice-Hall Upper Saddle River NJ. 189--233.  Sharir M. and Pnueli A. 1981. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications Prentice-Hall Upper Saddle River NJ. 189--233."},{"key":"e_1_2_1_167_1","doi-asserted-by":"publisher","DOI":"10.1145\/53990.54007"},{"key":"e_1_2_1_169_1","doi-asserted-by":"publisher","DOI":"10.1145\/115865.115884"},{"key":"e_1_2_1_170_1","volume-title":"Flow-directed lightweight closure conversion. Tech. rep. 99-190R","author":"Siskind J. M."},{"key":"e_1_2_1_171_1","volume-title":"Proceedings of the 9th European Symposium on Programming. Lecture Notes in Computer Science","volume":"1782","author":"Smith S. F."},{"key":"e_1_2_1_172_1","doi-asserted-by":"publisher","DOI":"10.1145\/239912.239915"},{"key":"e_1_2_1_173_1","unstructured":"Steele  Jr. G. L. 1978. Rabbit: A compiler for Scheme. M.S. thesis Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge MA. Tech. rep. AI-TR-474.   Steele Jr. G. L. 1978. Rabbit: A compiler for Scheme. M.S. thesis Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge MA. Tech. rep. AI-TR-474."},{"key":"e_1_2_1_174_1","doi-asserted-by":"publisher","DOI":"10.5555\/647473.727458"},{"key":"e_1_2_1_175_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237727"},{"key":"e_1_2_1_176_1","unstructured":"Steensgaard B. and Marquard M. 1994. A polyvariant closure analysis with dynamic widening. Unpublished note. Available at ftp:\/\/ftp.research.microsoft.com\/pub\/analysts\/closure.ps.Z.  Steensgaard B. and Marquard M. 1994. A polyvariant closure analysis with dynamic widening. Unpublished note. Available at ftp:\/\/ftp.research.microsoft.com\/pub\/analysts\/closure.ps.Z."},{"key":"e_1_2_1_177_1","doi-asserted-by":"publisher","DOI":"10.1145\/182409.182497"},{"key":"e_1_2_1_178_1","volume-title":"Actes WSA'92 Workshop on Static Analysis. 313--321","author":"Tang Y. M."},{"key":"e_1_2_1_179_1","volume-title":"Proceedings of the International Symposium on Theoretical Aspects of Computer Software, M. Hagiya and J. C. Mitchell, Eds. Lecture Notes in Computer Science","volume":"789","author":"Tang Y. M."},{"key":"e_1_2_1_180_1","doi-asserted-by":"publisher","DOI":"10.1145\/154630.154644"},{"key":"e_1_2_1_181_1","volume-title":"Proceedings of the ACM SIGPLAN Workshop on Types in Compilation (TIC'97)","author":"Tolmach A.","year":"1997"},{"key":"e_1_2_1_182_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796898003086"},{"key":"e_1_2_1_183_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291166"},{"key":"e_1_2_1_184_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411243"},{"key":"e_1_2_1_185_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69166-2_17"},{"key":"e_1_2_1_186_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11957-6_30"},{"key":"e_1_2_1_187_1","doi-asserted-by":"publisher","DOI":"10.5555\/647171.718308"},{"key":"e_1_2_1_188_1","doi-asserted-by":"publisher","DOI":"10.5555\/647166.717859"},{"key":"e_1_2_1_189_1","doi-asserted-by":"publisher","DOI":"10.3233\/FI-1987-10202"},{"key":"e_1_2_1_190_1","unstructured":"Wand M. 2002. Analyses that distinguish different evaluation orders or unsoundness results in control-flow analysis. Unpublished manuscript. Available at ftp:\/\/ftp.ccs.neu.edu\/pub\/people\/wand\/papers\/order-sensitive-cfa.ps.  Wand M. 2002. Analyses that distinguish different evaluation orders or unsoundness results in control-flow analysis. Unpublished manuscript. Available at ftp:\/\/ftp.ccs.neu.edu\/pub\/people\/wand\/papers\/order-sensitive-cfa.ps."},{"key":"e_1_2_1_191_1","volume-title":"Proceedings of the 11th European Symposium on Programming Languages and Systems (ESOP'02)","volume":"2305","author":"Wand M."},{"key":"e_1_2_1_192_1","volume-title":"Higher-order extensions to PROLOG: Are they needed&quest","author":"Warren D. H. D."},{"key":"e_1_2_1_193_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159876.1159877"},{"key":"e_1_2_1_194_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796801004245"},{"key":"e_1_2_1_195_1","doi-asserted-by":"publisher","DOI":"10.1145\/271510.271523"},{"key":"e_1_2_1_196_1","unstructured":"Young J. and Hudak P. 1986. Finding fixpoints on function spaces. Tech. rep. res. rep. YALEEU\/DCS\/RR-505 Yale University New Haven CT.  Young J. and Hudak P. 1986. Finding fixpoints on function spaces. Tech. rep. res. rep. YALEEU\/DCS\/RR-505 Yale University New Haven CT."}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2187671.2187672","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2187671.2187672","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:33Z","timestamp":1750241193000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2187671.2187672"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":185,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["10.1145\/2187671.2187672"],"URL":"https:\/\/doi.org\/10.1145\/2187671.2187672","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6]]},"assertion":[{"value":"2007-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}