{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:38Z","timestamp":1772163938360,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,10,1]],"date-time":"2007-10-01T00:00:00Z","timestamp":1191196800000},"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":[],"published-print":{"date-parts":[[2007,10]]},"DOI":"10.1145\/1291151.1291166","type":"proceedings-article","created":{"date-parts":[[2007,10,14]],"date-time":"2007-10-14T08:51:38Z","timestamp":1192351898000},"page":"85-96","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Relating complexity and precision in control flow analysis"],"prefix":"10.1145","author":[{"given":"David","family":"Van Horn","sequence":"first","affiliation":[{"name":"Brandeis University, Waltham, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harry G.","family":"Mairson","sequence":"additional","affiliation":[{"name":"Brandeis University, Waltham, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00279-7"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268971"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/258948.258951"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129502003845"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91622"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/3-540-62503-8_12","volume-title":"Selected papers from the 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages","author":"Fax\u00e9n Karl-Filip","year":"1997","unstructured":"Karl-Filip Fax\u00e9n . Polyvariance , polymorphism and flow analysis . In Selected papers from the 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages , pages 260 -- 278 . Springer-Verlag , 1997 . Karl-Filip Fax\u00e9n. Polyvariance, polymorphism and flow analysis. In Selected papers from the 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages, pages 260--278. Springer-Verlag, 1997."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/647163.717685"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0018355"},{"key":"e_1_3_2_1_9_1","first-page":"221","volume-title":"Logic Colloquium '88","author":"Girard Jean-Yves","year":"1989","unstructured":"Jean-Yves Girard . Geometry of interaction I: Interpretation of System F. In C. Bonotto, editor , Logic Colloquium '88 , pages 221 -- 260 . North Holland , 1989 . Jean-Yves Girard. Geometry of interaction I: Interpretation of System F. In C. Bonotto, editor, Logic Colloquium '88, pages 221--260. North Holland, 1989."},{"key":"e_1_3_2_1_10_1","volume-title":"Proofs and types","author":"Girard Jean-Yves","year":"1989","unstructured":"Jean-Yves Girard , Paul Taylor , and Yves Lafont . Proofs and types . Cambridge University Press , New York, NY, USA , 1989 . Jean-Yves Girard, Paul Taylor, and Yves Lafont. Proofs and types. Cambridge University Press, New York, NY, USA, 1989."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96714"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/182409.182495"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/647163.760061"},{"key":"e_1_3_2_1_14_1","first-page":"342","volume-title":"LICS '97: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science","author":"Heintze Nevin","unstructured":"Nevin Heintze and David McAllester . On the cubic bottleneck in subtyping and flow analysis . In LICS '97: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science , page 342 . IEEE Computer Society, 1997. Nevin Heintze and David McAllester. On the cubic bottleneck in subtyping and flow analysis. In LICS '97: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, page 342. IEEE Computer Society, 1997."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/258915.258939"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/99583.99602"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/646235.682702"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/990518.990519"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/212876.212896"},{"key":"e_1_3_2_1_20_1","first-page":"245","volume-title":"ESOP '00: Proceedings of the 9th European Symposium on Programming Languages and Systems","author":"Julia","year":"2000","unstructured":"Julia L. Lawall and Harry G. Mairson. Sharing continuations: Proofnets for languages with explicit control . In ESOP '00: Proceedings of the 9th European Symposium on Programming Languages and Systems , pages 245 -- 259 . Springer-Verlag , 2000 . Julia L. Lawall and Harry G. Mairson. Sharing continuations: Proofnets for languages with explicit control. In ESOP '00: Proceedings of the 9th European Symposium on Programming Languages and Systems, pages 245--259. Springer-Verlag, 2000."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/646840.708813"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944717"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796804005131"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96748"},{"key":"e_1_3_2_1_26_1","volume-title":"Axiom-sensitive normalization bounds for multiplicative linear logic","author":"Mairson Harry G.","year":"2006","unstructured":"Harry G. Mairson . Axiom-sensitive normalization bounds for multiplicative linear logic , 2006 . Unpublished manuscript. Harry G. Mairson. Axiom-sensitive normalization bounds for multiplicative linear logic, 2006. Unpublished manuscript."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90020-G"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Harry\n     G.\n  Mairson and Kazushige Terui. On the computational complexity of cut-elimination in linear logic\n  . In Carlo Blundo and Cosimo Laneve editors ICTCS volume \n  2841\n   of \n  Lecture Notes in Computer Science pages \n  23\n  --\n  36\n  . \n  Springer 2003\n  .  Harry G. Mairson and Kazushige Terui. On the computational complexity of cut-elimination in linear logic. In Carlo Blundo and Cosimo Laneve editors ICTCS volume 2841 of Lecture Notes in Computer Science pages 23--36. Springer 2003.","DOI":"10.1007\/978-3-540-45208-9_4"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/647166.717967"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1016850.1016871"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263745"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"Nielson Flemming","year":"1999","unstructured":"Flemming Nielson , Hanne R. Nielson , and Chris Hankin . Principles of Program Analysis . Springer-Verlag New York, Inc. , Secaucus, NJ, USA , 1999 . Flemming Nielson, Hanne R. Nielson, and Chris Hankin. Principles of Program Analysis. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 1999."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/200994.201001"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/210184.210187"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268963"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Michel\n      Parigot\n    .\n  Lambda-mu-calculus: An algorithmic interpretation of classical natural deduction\n  . In Andrei Voronkov editor LPAR volume \n  624\n   of \n  Lecture Notes in Computer Science pages \n  190\n  --\n  201\n  . \n  Springer 1992\n  .   Michel Parigot. Lambda-mu-calculus: An algorithmic interpretation of classical natural deduction. In Andrei Voronkov editor LPAR volume 624 of Lecture Notes in Computer Science pages 190--201. Springer 1992.","DOI":"10.1007\/BFb0013061"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/345099.345137"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/99370.99374"},{"key":"e_1_3_2_1_40_1","volume-title":"DIKU","author":"Sestoft Peter","year":"1988","unstructured":"Peter Sestoft . Replacing function parameters by global variables. Master's thesis , DIKU , University of Copenhagen , Denmark, Oct 1988 . Master's thesis no. 254. Peter Sestoft. Replacing function parameters by global variables. Master's thesis, DIKU, University of Copenhagen, Denmark, Oct 1988. Master's thesis no. 254."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/989393.989421"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90007-0"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/645868.668505"},{"key":"e_1_3_2_1_45_1","volume-title":"July","author":"Terui Kazushige","year":"2002","unstructured":"Kazushige Terui . On the complexity of cut-elimination in linear logic , July 2002 . Invited talk at LL2002 (LICS2002 affiliated workshop),. Copenhagen . Kazushige Terui. On the complexity of cut-elimination in linear logic, July 2002. Invited talk at LL2002 (LICS2002 affiliated workshop),. Copenhagen."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/271510.271523"}],"event":{"name":"ICFP07: ACM SIGPLAN International Conference on Functional Programming","location":"Freiburg Germany","acronym":"ICFP07","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 12th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1291151.1291166","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1291151.1291166","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:26Z","timestamp":1750243946000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1291151.1291166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10]]},"references-count":43,"alternative-id":["10.1145\/1291151.1291166","10.1145\/1291151"],"URL":"https:\/\/doi.org\/10.1145\/1291151.1291166","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1291220.1291166","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2007,10]]},"assertion":[{"value":"2007-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}