{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:10:11Z","timestamp":1763467811446},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540656999"},{"type":"electronic","value":"9783540490999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49099-x_3","type":"book-chapter","created":{"date-parts":[[2007,6,24]],"date-time":"2007-06-24T17:03:21Z","timestamp":1182704601000},"page":"20-39","source":"Crossref","is-referenced-by-count":9,"title":["Interprocedural Control Flow Analysis"],"prefix":"10.1007","author":[{"given":"Flemming","family":"Nielson","sequence":"first","affiliation":[]},{"given":"Hanne Riis","family":"Nielson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,28]]},"reference":[{"key":"3_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BFb0024192","volume-title":"Proc. PLILP\u2019 90","author":"F. Bourdoncle","year":"1990","unstructured":"F. Bourdoncle. Interprocedural abstract interpretation of block structured languages with nested procedures, aliasing and recursivity. In Proc. PLILP\u2019 90, volume 456 of Lecture Notes in Computer Science, pages 307\u2013323. Springer, 1990."},{"key":"3_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/BFb0039704","volume-title":"Proc. Formal Methods in Programming and Their Applications","author":"F. Bourdoncle","year":"1993","unstructured":"F. Bourdoncle. Efficient chaotic iteration strategies with widenings. In Proc. Formal Methods in Programming and Their Applications, volume 735 of Lecture Notes in Computer Science, pages 128\u2013141. Springer, 1993."},{"key":"3_CR3","unstructured":"P. Cousot and R. Cousot. Static determination of dynamic properties of recursive procedures. In E. J. Neuhold, editor, Formal Description of Programming Concepts. North Holland, 1978."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. In Proc. POPL\u2019 79, pages 269\u2013282, 1979.","DOI":"10.1145\/567752.567778"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"A. Deutsch. On Determining Lifetime and Aliasing of Dynamically Allocated Data in Higher Order Functional Specifications. In Proc. POPL\u2019 90, pages 157\u2013169. ACM Press, 1990.","DOI":"10.1145\/96709.96725"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"K. L. S. Gasser, F. Nielson, and H. R. Nielson. Systematic realisation of control flow analyses for CML. In Proc. ICFP\u2019 97, pages 38\u201351. ACM Press, 1997.","DOI":"10.1145\/258948.258954"},{"key":"3_CR7","unstructured":"M. S. Hecht. Flow Analysis of Computer Programs. North Holland, 1977."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"N. Heintze. Set-based analysis of ML programs. In Proc. LFP\u2019 94, pages 306\u2013317, 1994.","DOI":"10.1145\/182409.182495"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar. An engine for logic program analysis. In Proc. LICS\u2019 92, pages 318\u2013328, 1992.","DOI":"10.1109\/LICS.1992.185544"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"S. Jagannathan and S. Weeks. Analyzing Stores and References in a Parallel Symbolic Language. In Proc. LFP\u2019 94, pages 294\u2013305, 1994.","DOI":"10.1145\/182409.182493"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"S. Jagannathan and S. Weeks. A unified treatment of flow analysis in higher-order languages. In Proc. POPL\u2019 95. ACM Press, 1995.","DOI":"10.1145\/199448.199536"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"N. D. Jones and S. S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Proc. POPL\u2019 82, pages 66\u201374. ACM Press, 1982.","DOI":"10.1145\/582153.582161"},{"key":"3_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/3-540-55984-1_13","volume-title":"Proc. CC\u2019 92","author":"J. Knoop","year":"1992","unstructured":"J. Knoop and B. Steffen. The interprocedural coincidence theorem. In Proc. CC\u2019 92, volume 641 of Lecture Notes in Computer Science, pages 125\u2013140. Springer, 1992."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"W. Landi and B. G. Ryder. Pointer-Induced Aliasing: A Problem Classification. In Proc. POPL\u2019 91, pages 93\u2013103. ACM Press, 1991.","DOI":"10.1145\/99583.99599"},{"key":"3_CR15","unstructured":"R. Milner, M. Tofte, and R. Harper. The definition of Standard ML. MIT Press, 1990."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"F. Nielson and H. R. Nielson. Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis. In Proc. POPL\u2019 97. ACM Press, 1997.","DOI":"10.1145\/263699.263745"},{"key":"3_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BFb0026426","volume-title":"Proc. CC\u2019 98","author":"H. R. Nielson","year":"1998","unstructured":"H. R. Nielson and F. Nielson. Flow logics for constraint based analysis. In Proc. CC\u2019 98, volume 1383 of Lecture Notes in Computer Science, pages 109\u2013127. Springer, 1998."},{"key":"3_CR18","series-title":"Lect Notes Comput Sci","first-page":"255","volume-title":"Proc. CAAP\u2019 94","author":"J. Palsberg","year":"1994","unstructured":"J. Palsberg. Global program analysis in constraint form. In Proc. CAAP\u2019 94, volume 787 of Lecture Notes in Computer Science, pages 255\u2013265. Springer, 1994."},{"issue":"1","key":"3_CR19","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 TOPLAS, 17(1):47\u201362, 1995.","journal-title":"ACM TOPLAS"},{"key":"3_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/3-540-61739-6_45","volume-title":"Proc. SAS\u2019 96","author":"H. D. Pande","year":"1996","unstructured":"H. D. Pande and B. G. Ryder. Data-flow-based virtual function resolution. In Proc. SAS\u2019 96, volume 1145 of Lecture Notes in Computer Science, pages 238\u2013254. Springer, 1996"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"E. Ruf. Context-insensitive alias analysis reconsidered. In Proc. PLDI\u2019 95, pages 13\u201322. ACM Press, 1995.","DOI":"10.1145\/207110.207112"},{"key":"3_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1007\/3-540-59293-8_226","volume-title":"Proc. TAPSOFT\u2019 95","author":"M. Sagiv","year":"1995","unstructured":"M. Sagiv, T. Reps, and S. Horwitz. Precise interprocedural dataflow analysis with applications to constant propagation. In Proc. TAPSOFT\u2019 95, volume 915 of Lecture Notes in Computer Science, pages 651\u2013665, 1995."},{"key":"3_CR23","unstructured":"M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S. S. Muchnick and N. D. Jones, editors, Program Flow Analysis. Prentice Hall International, 1981."},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"O. Shivers. Control flow analysis in Scheme. In Proc. PLDI\u2019 88, volume 7(1) of ACM SIGPLAN Notices, pages 164\u2013174. ACM Press, 1988.","DOI":"10.1145\/53990.54007"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"O. Shivers. The semantics of Scheme control-flow analysis. In Proc. PEPM\u2019 91, volume 26 (9) of ACM SIGPLAN Notices. ACM Press, 1991.","DOI":"10.1145\/115865.115884"},{"key":"3_CR26","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math., 5:285\u2013309, 1955.","journal-title":"Pacific J. Math."},{"key":"3_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/3-540-55984-1_22","volume-title":"Proc. CC\u2019 92","author":"J. Vitek","year":"1992","unstructured":"J. Vitek, R. N. Horspool, and J. S. Uhl. Compile-Time Analysis of Object-Oriented Programs. In Proc. CC\u2019 92, volume 641 of Lecture Notes in Computer Science, pages 236\u2013250. Springer, 1992."}],"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-49099-X_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T05:32:45Z","timestamp":1556515965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49099-X_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540656999","9783540490999"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-49099-x_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}