{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:42Z","timestamp":1763467962401},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119569"},{"type":"electronic","value":"9783642119576"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11957-6_30","type":"book-chapter","created":{"date-parts":[[2010,3,7]],"date-time":"2010-03-07T19:55:38Z","timestamp":1267991738000},"page":"570-589","source":"Crossref","is-referenced-by-count":37,"title":["CFA2: A Context-Free Approach to Control-Flow Analysis"],"prefix":"10.1007","author":[{"given":"Dimitrios","family":"Vardoulakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olin","family":"Shivers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Shivers, O.: Control-Flow Analysis of Higher-Order Languages. PhD thesis, Carnegie-Mellon University (1991)"},{"key":"30_CR2","volume-title":"Program Flow Analysis, Theory and Application","author":"M. Sharir","year":"1981","unstructured":"Sharir, M., Pnueli, A.: Two Approaches to Interprocedural Data Flow Analysis. In: Program Flow Analysis, Theory and Application. Prentice Hall, Englewood Cliffs (1981)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Reps, T.W., Horwitz, S., Sagiv, S.: Precise Interprocedural Dataflow Analysis via Graph Reachability. In: Principles of Programming Languages, pp. 49\u201361 (1995)","DOI":"10.1145\/199448.199462"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S.: Subcubic Algorithms for Recursive State Machines. In: Principles of Programming Languages, pp. 159\u2013169 (2008)","DOI":"10.1145\/1328438.1328460"},{"issue":"4","key":"30_CR5","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1145\/1075382.1075387","volume":"27","author":"R. Alur","year":"2005","unstructured":"Alur, R., Benedikt, M., Etessami, K., Godefroid, P., Reps, T.W., Yannakakis, M.: Analysis of Recursive State Machines. Transactions on Programming Languages and Systems\u00a027(4), 786\u2013818 (2005)","journal-title":"Transactions on Programming Languages and Systems"},{"key":"30_CR6","unstructured":"Schwoon, S.: Model-Checking Pushdown Systems. PhD thesis, Technische Universit\u00e4t M\u00fcnchen (2002)"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Rehof, J., F\u00e4hndrich, M.: Type-Based Flow Analysis: From Polymorphic Subtyping to CFL-Reachability. In: Principles of Programming Languages, pp. 54\u201366 (2001)","DOI":"10.1145\/373243.360208"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Might, M., Shivers, O.: Improving Flow Analyses via \u0393CFA: Abstract Garbage Collection and Counting. In: International Conference on Functional Programming, pp. 13\u201325 (2006)","DOI":"10.1145\/1160074.1159807"},{"issue":"1","key":"30_CR9","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1145\/271510.271523","volume":"20","author":"A. Wright","year":"1998","unstructured":"Wright, A., Jagannathan, S.: Polymorphic Splitting: An Effective Polyvariant Flow Analysis. Trans. on Programming Languages and Systems\u00a020(1), 166\u2013207 (1998)","journal-title":"Trans. on Programming Languages and Systems"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Van Horn, D., Mairson, H.G.: Deciding k-CFA is complete for EXPTIME. In: International Conference on Functional Programming, pp. 275\u2013282 (2008)","DOI":"10.1145\/1411203.1411243"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Clinger, W.D., Hansen, L.T.: Lambda, the Ultimate Label or a Simple Optimizing Compiler for Scheme. In: LISP and Functional Programming, pp. 128\u2013139 (1994)","DOI":"10.1145\/182409.156786"},{"key":"30_CR12","unstructured":"Might, M.: Environment Analysis of Higher-Order Languages. PhD thesis, Georgia Institute of Technology (2007)"},{"key":"30_CR13","unstructured":"Steele, G.L.: Rabbit: A Compiler for Scheme. Master\u2019s thesis, MIT (1978)"},{"key":"30_CR14","unstructured":"Kranz, D.: ORBIT: An Optimizing Compiler for Scheme. PhD thesis, Yale University (1988)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Sabry, A., Felleisen, M.: Reasoning About Programs in Continuation-Passing Style. In: LISP and Functional Programming, pp. 288\u2013298 (1992)","DOI":"10.1145\/141471.141563"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Shivers, O.: Higher-Order Control-Flow Analysis in Retrospect: Lessons Learned, Lessons Abandoned. In: Best of PLDI, pp. 257\u2013269 (2004)","DOI":"10.1145\/989393.989421"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Vardoulakis, D., Shivers, O.: CFA2: a Context-Free Approach to Control-Flow Analysis. Technical Report NU-CCIS-10-01, Northeastern University (2010)","DOI":"10.1007\/978-3-642-11957-6_30"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Graph-Theoretic Methods in Database Theory. In: Principles of Database Systems, pp. 230\u2013242 (1990)","DOI":"10.1145\/298514.298576"},{"issue":"1-2","key":"30_CR19","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0304-3975(00)00049-9","volume":"248","author":"D. Melski","year":"2000","unstructured":"Melski, D., Reps, T.: Interconvertibility of a Class of Set Constraints and Context-Free-Language Reachability. Theoretical Comp. Sci.\u00a0248(1-2), 29\u201398 (2000)","journal-title":"Theoretical Comp. Sci."},{"key":"30_CR20","unstructured":"Heintze, N.: Set-based program analysis. PhD thesis, Carnegie-Mellon Univ. (1992)"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Sridharan, M., Bod\u00edk, R.: Refinement-based context-sensitive points-to analysis for java. In: Programming Language Design and Implementation, pp. 387\u2013400 (2006)","DOI":"10.1145\/1133255.1134027"},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"Hind, M.: Pointer analysis: haven\u2019t we solved this problem yet? In: Program Analysis For Software Tools and Engineering, pp. 54\u201361 (2001)","DOI":"10.1145\/379605.379665"},{"issue":"4","key":"30_CR23","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1145\/262004.262006","volume":"19","author":"S.K. Debray","year":"1997","unstructured":"Debray, S.K., Proebsting, T.A.: Interprocedural Control Flow Analysis of First-Order Programs with Tail-Call Optimization. Transactions on Programming Languages and Systems\u00a019(4), 568\u2013585 (1997)","journal-title":"Transactions on Programming Languages and Systems"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Midtgaard, J., Jensen, T.: Control-flow analysis of function calls and returns by abstract interpretation. In: International Conference on Functional Programming, pp. 287\u2013298 (2009)","DOI":"10.1145\/1596550.1596592"},{"key":"30_CR25","doi-asserted-by":"crossref","unstructured":"Kobayashi, N.: Types and higher-order recursion schemes for verification of higher-order programs. In: Principles of Programming Languages, pp. 416\u2013428 (2009)","DOI":"10.1145\/1594834.1480933"},{"key":"30_CR26","doi-asserted-by":"crossref","unstructured":"Agesen, O.: The Cartesian Product Algorithm: Simple and Precise Type Inference of Parametric Polymorphism. In: European Conference on Object-Oriented Programming, pp. 2\u201326 (1995)","DOI":"10.1007\/3-540-49538-X_2"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11957-6_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:45:47Z","timestamp":1606167947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11957-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119569","9783642119576"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11957-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}