{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T18:54:11Z","timestamp":1771959251246,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540330509","type":"print"},{"value":"9783540330516","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11688839_2","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T07:41:48Z","timestamp":1143531708000},"page":"2-16","source":"Crossref","is-referenced-by-count":31,"title":["Interprocedural Dataflow Analysis in the Presence of Large Libraries"],"prefix":"10.1007","author":[{"given":"Atanas","family":"Rountev","sequence":"first","affiliation":[]},{"given":"Scott","family":"Kagan","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Marlowe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Callahan, D.: The program summary graph and flow-sensitive interprocedural data flow analysis. In: Conf. Programming Language Design and Implementation, pp. 47\u201356 (1988)","DOI":"10.1145\/960116.53995"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Chatterjee, R., Ryder, B.G., Landi, W.: Relevant context inference. In: Symp. Principles of Programming Languages, pp. 133\u2013146 (1999)","DOI":"10.1145\/292540.292554"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Cheng, B., Hwu, W.: Modular interprocedural pointer analysis using access paths. In: Conf. Programming Language Design and Implementation (2000)","DOI":"10.1145\/349299.349311"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Choi, J., Gupta, M., Serrano, M., Sreedhar, V., Midkiff, S.: Escape analysis for Java. In: Conf. Object-Oriented Programming Systems, Languages, and Applications, pp. 1\u201319 (1999)","DOI":"10.1145\/320384.320386"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Codish, M., Debray, S., Giacobazzi, R.: Compositional analysis of modular logic programs. In: Symp. Principles of Programming Languages, pp. 451\u2013464 (1993)","DOI":"10.1145\/158511.158703"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Das, M.: Unification-based pointer analysis with directional assignments. In: Conf. Programming Language Design and Implementation, pp. 35\u201346 (2000)","DOI":"10.1145\/349299.349309"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Dhamdhere, D., Rosen, B., Zadeck, K.: How to analyze large programs efficiently and informatively. In: Conf. Programming Language Design and Implementation, pp. 212\u2013223 (1992)","DOI":"10.1145\/143095.143135"},{"issue":"2","key":"2_CR8","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1145\/316686.316703","volume":"21","author":"C. Flanagan","year":"1999","unstructured":"Flanagan, C., Felleisen, M.: Componential set-based analysis. ACM Trans. Programming Languages and Systems\u00a021(2), 370\u2013416 (1999)","journal-title":"ACM Trans. Programming Languages and Systems"},{"issue":"6","key":"2_CR9","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/506315.506316","volume":"23","author":"D. Grove","year":"2001","unstructured":"Grove, D., Chambers, C.: A framework for call graph construction algorithms. ACM Trans. Programming Languages and Systems\u00a023(6), 685\u2013746 (2001)","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Grove, D., Torczon, L.: Interprocedural constant propagation: a study of jump function implementation. In: Conf. Programming Language Design and Implementation, pp. 90\u201399 (1993)","DOI":"10.1145\/155090.155099"},{"issue":"7","key":"2_CR11","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1109\/32.538603","volume":"22","author":"M.J. Harrold","year":"1996","unstructured":"Harrold, M.J., Rothermel, G.: Separate computation of alias information for reuse. IEEE Tran. Software Engineering\u00a022(7), 442\u2013460 (1996)","journal-title":"IEEE Tran. Software Engineering"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Heintze, N., Tardieu, O.: Ultra-fast aliasing analysis using CLA. In: Conf. Programming Language Design and Implementation, pp. 254\u2013263 (2001)","DOI":"10.1145\/378795.378855"},{"key":"2_CR13","unstructured":"Kuck, F.C.: Class analysis for extensible Java software. Master\u2019s thesis, Ohio State University (September 2004)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Lee, Y.-F., Ryder, B.G.: A comprehensive approach to parallel data flow analysis. In: Int. Conf. Supercomputing, pp. 236\u2013247 (1992)","DOI":"10.1145\/143369.143415"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-36579-6_12","volume-title":"Compiler Construction","author":"O. Lhot\u00e1k","year":"2003","unstructured":"Lhot\u00e1k, O., Hendren, L.: Scaling Java Points-to Analysis Using SPARK. In: Hedin, G. (ed.) CC 2003. LNCS, vol.\u00a02622, pp. 153\u2013169. Springer, Heidelberg (2003)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Marlowe, T.J., Ryder, B.G.: An efficient hybrid algorithm for incremental data flow analysis. In: Symp. Principles of Programming Languages, pp. 184\u2013196 (1990)","DOI":"10.1145\/96709.96728"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/B:AUSE.0000008666.56394.a1","volume":"11","author":"A. Milanova","year":"2004","unstructured":"Milanova, A., Rountev, A., Ryder, B.G.: Precise call graphs for C programs with function pointers. Int. J. Automated Software Engineering\u00a011(1), 7\u201326 (2004)","journal-title":"Int. J. Automated Software Engineering"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: Symp. Principles of Programming Languages, pp. 49\u201361 (1995)","DOI":"10.1145\/199448.199462"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Reps, T., Sagiv, M., Horwitz, S.: Interprocedural dataflow analysis via graph reachability. Technical Report TR 94-14, Datalogisk Institut, University of Copenhagen (April 1994)","DOI":"10.1145\/199448.199462"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/11424529_6","volume-title":"Component-Based Software Engineering","author":"A. Rountev","year":"2005","unstructured":"Rountev, A.: Component-Level Dataflow Analysis. In: Heineman, G.T., Crnkovi\u0107, I., Schmidt, H.W., Stafford, J.A., Szyperski, C.A., Wallnau, K. (eds.) CBSE 2005. LNCS, vol.\u00a03489, pp. 82\u201389. Springer, Heidelberg (2005)"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Rountev, A., Connell, B.H.: Object naming analysis for reverse-engineered sequence diagrams. In: Int. Conf. Software Engineering, pp. 254\u2013263 (2005)","DOI":"10.1145\/1062455.1062510"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Rountev, A., Kagan, S., Marlowe, T.: Interprocedural dataflow analysis in the presence of large libraries. Technical Report OSU-CISRC-1\/06-TR01 (January 2006)","DOI":"10.1007\/11688839_2"},{"issue":"6","key":"2_CR23","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/TSE.2004.20","volume":"30","author":"A. Rountev","year":"2004","unstructured":"Rountev, A., Milanova, A., Ryder, B.G.: Fragment class analysis for testing of polymorphism in Java software. IEEE Tran. Software Engineering\u00a030(6), 372\u2013387 (2004)","journal-title":"IEEE Tran. Software Engineering"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-45306-7_3","volume-title":"Compiler Construction","author":"A. Rountev","year":"2001","unstructured":"Rountev, A., Ryder, B.G.: Points-to and Side-Effect Analyses for Programs Built with Precompiled Libraries. In: Wilhelm, R. (ed.) CC 2001. LNCS, vol.\u00a02027, pp. 20\u201336. Springer, Heidelberg (2001)"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Ruf, E.: Effective synchronization removal for Java. In: Conf. Programming Language Design and Implementation, pp. 208\u2013218 (2000)","DOI":"10.1145\/349299.349327"},{"issue":"3","key":"2_CR26","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/27632.27649","volume":"18","author":"B.G. Ryder","year":"1986","unstructured":"Ryder, B.G., Paull, M.C.: Elimination algorithms for data flow analysis. ACM Computing Surveys\u00a018(3), 277\u2013316 (1986)","journal-title":"ACM Computing Surveys"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-3975(96)00072-2","volume":"167","author":"M. Sagiv","year":"1996","unstructured":"Sagiv, M., Reps, T., Horwitz, S.: Precise interprocedural dataflow analysis with applications to constant propagation. Theoretical Comp. Sci.\u00a0167, 131\u2013170 (1996)","journal-title":"Theoretical Comp. Sci."},{"key":"2_CR28","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In: Program Flow Analysis: Theory and Applications, pp. 189\u2013234 (1981)"},{"issue":"6","key":"2_CR29","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1145\/586088.586090","volume":"24","author":"F. Tip","year":"2002","unstructured":"Tip, F., Sweeney, P., Laffra, C., Eisma, A., Streeter, D.: Practical extraction techniques for Java. ACM Trans. Programming Languages and Systems\u00a024(6), 625\u2013666 (2002)","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-46423-9_2","volume-title":"Compiler Construction","author":"R. Vall\u00e9e-Rai","year":"2000","unstructured":"Vall\u00e9e-Rai, R., Gagnon, E., Hendren, L., Lam, P., Pominville, P., Sundaresan, V.: Optimizing Java bytecode using the Soot framework: Is it feasible? In: Watt, D.A. (ed.) CC 2000. LNCS, vol.\u00a01781, pp. 18\u201334. Springer, Heidelberg (2000)"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Whaley, J., Rinard, M.: Compositional pointer and escape analysis for Java programs. In: Conf. Object-Oriented Programming Systems, Languages, and Applications, pp. 187\u2013206 (1999)","DOI":"10.1145\/320384.320400"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11688839_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T17:46:46Z","timestamp":1683395206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11688839_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330509","9783540330516"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/11688839_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}