{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:12:10Z","timestamp":1794341530642,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540377566","type":"print"},{"value":"9783540377580","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11823230_7","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T09:46:30Z","timestamp":1155807990000},"page":"88-106","source":"Crossref","is-referenced-by-count":26,"title":["Existential Label Flow Inference Via CFL Reachability"],"prefix":"10.1007","author":[{"given":"Polyvios","family":"Pratikakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeffrey S.","family":"Foster","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Hicks","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Das, M.: Unification-based Pointer Analysis with Directional Assignments. In: The 2000 Conference on Programming Language Design and Implementation, Vancouver, BC, Canada, pp. 35\u201346 (2000)","DOI":"10.1145\/349299.349309"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1145\/44501.45065","volume":"10","author":"J.C. Mitchell","year":"1988","unstructured":"Mitchell, J.C., Plotkin, G.D.: Abstract types have existential type. ACM Transactions on Programming Languages and Systems\u00a010, 470\u2013502 (1988)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Xi, H., Pfenning, F.: Dependent Types in Practical Programming. In: The 26th Annual Symposium on Principles of Programming Languages, San Antonio, Texas, pp. 214\u2013227 (1999)","DOI":"10.1145\/292540.292560"},{"key":"7_CR4","unstructured":"Pratikakis, P., Foster, J.S., Hicks, M.: Context-Sensitive Correlation Analysis for Race Detection. In: The 2006 Conference on Programming Language Design and Implementation, Ottawa, Canada (to appear, 2006)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-49099-X_7","volume-title":"Programming Languages and Systems","author":"C. Flanagan","year":"1999","unstructured":"Flanagan, C., Abadi, M.: Types for Safe Locking. In: Swierstra, S.D. (ed.) ESOP 1999. LNCS, vol.\u00a01576, pp. 91\u2013108. Springer, Heidelberg (1999)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Minamide, Y., Morrisett, G., Harper, R.: Typed closure conversion. In: The 23rd Annual Symposium on Principles of Programming Languages, St. Petersburg Beach, Florida, pp. 271\u2013283 (1996)","DOI":"10.1145\/237721.237791"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"F\u00e4hndrich, M., Rehof, J., Das, M.: Scalable Context-Sensitive Flow Analysis using Instantiation Constraints. In: The 2000 Conference on Programming Language Design and Implementation, Vancouver, BC, Canada, pp. 253\u2013263 (2000)","DOI":"10.1145\/358438.349332"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Das, M., Liblit, B., F\u00e4hndrich, M., Rehof, J.: Estimating the Impact of Scalable Pointer Analysis on Optimization. In: Cousot, P. (ed.) Static Analysis, Eighth International Symposium, Paris, France, pp. 260\u2013278 (2001)","DOI":"10.1007\/3-540-47764-0_15"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Myers, A.C.: Practical Mostly-Static Information Flow Control. In: The 26th Annual Symposium on Principles of Programming Languages, San Antonio, Texas, pp. 228\u2013241 (1999)","DOI":"10.1145\/292540.292561"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Foster, J.S., Johnson, R., Kodumal, J., Aiken, A.: Flow-insensitive type qualifiers. ACM Transactions on Programming Languages and Systems (to appear)","DOI":"10.1145\/1186632.1186635"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Kodumal, J., Aiken, A.: The Set Constraint\/CFL Reachability Connection in Practice. In: The 2004 Conference on Programming Language Design and Implementation, Washington, DC, pp. 207\u2013218 (2004)","DOI":"10.1145\/996841.996867"},{"key":"7_CR12","unstructured":"Johnson, R., Wagner, D.: Finding User\/Kernel Bugs With Type Inference. In: The 13th Usenix Security Symposium, San Diego, CA (2004)"},{"key":"7_CR13","unstructured":"Mossin, C.: Flow Analysis of Typed Higher-Order Programs. PhD thesis, DIKU, Department of Computer Science, University of Copenhagen (1996)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Rehof, J., F\u00e4hndrich, M.: Type-Based Flow Analysis: From Polymorphic Subtyping to CFL-Reachability. In: The 28th Annual Symposium on Principles of Programming Languages, London, United Kingdom, pp. 54\u201366 (2001)","DOI":"10.1145\/373243.360208"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"F\u00e4hndrich, M., Rehof, J., Das, M.: From Polymorphic Subtyping to CFL Reachability: Context-Sensitive Flow Analysis Using Instantiation Constraints. Technical Report MS-TR-99-84, Microsoft Research (2000)","DOI":"10.1145\/349299.349332"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Felleisen, M.: Componential Set-Based Analysis. In: The 1997 Conference on Programming Language Design and Implementation, Las Vegas, Nevada, pp. 235\u2013248 (1997)","DOI":"10.1145\/258915.258937"},{"key":"7_CR17","unstructured":"F\u00e4hndrich, M., Aiken, A.: Making Set-Constraint Based Program Analyses Scale. In: First Workshop on Set Constraints at CP 1996, Available as CSD-TR-96-917, University of California at Berkeley (1996)"},{"key":"7_CR18","unstructured":"F\u00e4hndrich, M.: BANE: A Library for Scalable Constraint-Based Program Analysis. PhD thesis, University of California, Berkeley (1999)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"von Behren, R., Condit, J., Zhou, F., Necula, G.C., Brewer, E.: Capriccio: Scalable threads for internet services. In: ACM Symposium on Operating Systems Principles (2003)","DOI":"10.1145\/945445.945471"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Pratikakis, P., Hicks, M., Foster, J.S.: Existential Label Flow Inference via CFL Reachability. Technical Report CS-TR-4700, University of Maryland, Computer Science Department (2005)","DOI":"10.1007\/11823230_7"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/169701.169692","volume":"15","author":"F. Henglein","year":"1993","unstructured":"Henglein, F.: Type Inference with Polymorphic Recursion. ACM Transactions on Programming Languages and Systems\u00a015, 253\u2013289 (1993)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Botlan, D.L., R\u00e9my, D.: ML F \u2014Raising ML to the Power of System F. In: The Eighth International Conference on Functional Programming, Uppsala, Sweden, pp. 27\u201338 (2003)","DOI":"10.1145\/944746.944709"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1145\/186025.186031","volume":"16","author":"K. L\u00e4ufer","year":"1994","unstructured":"L\u00e4ufer, K., Odersky, M.: Polymorphic type inference and abstract data types. ACM Transactions on Programming Languages and Systems\u00a016, 1411\u20131430 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"R\u00e9my, D.: Programming objects with MLART: An extension to ML with abstract and record types. In: The International Symposium on Theoretical Aspects of Computer Science, Sendai, Japan, pp. 321\u2013346 (1994)","DOI":"10.1007\/3-540-57887-0_102"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Simonet, V.: An Extension of HM(X) with Bounded Existential and Universal Data Types. In: The Eighth International Conference on Functional Programming, Uppsala, Sweden, pp. 39\u201350 (2003)","DOI":"10.1145\/944705.944710"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1017\/S0956796800000113","volume":"1","author":"J.C. Mitchell","year":"1991","unstructured":"Mitchell, J.C.: Type inference with simple subtypes. Journal of Functional Programming\u00a01, 245\u2013285 (1991)","journal-title":"Journal of Functional Programming"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise Interprocedural Dataflow Analysis via Graph Reachability. In: The 22nd Annual Symposium on Principles of Programming Languages, San Francisco, California, pp. 49\u201361 (1995)","DOI":"10.1145\/199448.199462"},{"key":"7_CR28","volume-title":"Types and Programming Languages","author":"B.C. Pierce","year":"2002","unstructured":"Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)"},{"key":"7_CR29","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0168-0072(98)00047-5","volume":"98","author":"J.B. Wells","year":"1999","unstructured":"Wells, J.B.: Typability and type checking in System F are equivalent and undecidable. Ann. Pure Appl. Logic\u00a098, 111\u2013156 (1999)","journal-title":"Ann. Pure Appl. Logic"},{"key":"7_CR30","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/(SICI)1096-9942(199901\/03)5:1<35::AID-TAPO4>3.0.CO;2-4","volume":"5","author":"M. Odersky","year":"1999","unstructured":"Odersky, M., Sulzmann, M., Wehr, M.: Type inference with constrained types. Theory and Practice of Object Systems\u00a05, 35\u201355 (1999)","journal-title":"Theory and Practice of Object Systems"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11823230_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T09:28:56Z","timestamp":1627723736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11823230_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377566","9783540377580"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11823230_7","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11823230","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}