{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T06:46:08Z","timestamp":1770273968489,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540787907","type":"print"},{"value":"9783540787914","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78791-4_4","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T23:13:15Z","timestamp":1207091595000},"page":"53-68","source":"Crossref","is-referenced-by-count":18,"title":["IDE Dataflow Analysis in the Presence of Large Object-Oriented Libraries"],"prefix":"10.1007","author":[{"given":"Atanas","family":"Rountev","sequence":"first","affiliation":[]},{"given":"Mariana","family":"Sharp","sequence":"additional","affiliation":[]},{"given":"Guoqing","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","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":"4_CR2","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In: Program Flow Analysis: Theory and Applications, pp. 189\u2013234 (1981)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: POPL, pp. 49\u201361 (1995)","DOI":"10.1145\/199448.199462"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Reps, T., Sagiv, M., Horwitz, S.: Interprocedural dataflow analysis via graph reachability. Technical Report DIKU-TR94-14, U. Copenhagen (1994)","DOI":"10.1145\/199448.199462"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Rountev, A., Connell, B.H.: Object naming analysis for reverse-engineered sequence diagrams. In: ICSE, pp. 254\u2013263 (2005)","DOI":"10.1145\/1062455.1062510"},{"issue":"6","key":"4_CR6","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. TOPLAS\u00a023(6), 685\u2013746 (2001)","journal-title":"TOPLAS"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Tip, F., Palsberg, J.: Scalable propagation-based call graph construction algorithms. In: OOPSLA, pp. 281\u2013293 (2000)","DOI":"10.1145\/353171.353190"},{"key":"4_CR8","unstructured":"Heintze, N.: Set Based Program Analysis. PhD thesis, CMU (1992)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Callahan, D.: The program summary graph and flow-sensitive interprocedural data flow analysis. In: PLDI, pp. 47\u201356 (1988)","DOI":"10.1145\/960116.53995"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/77606.77608","volume":"12","author":"S. Horwitz","year":"1990","unstructured":"Horwitz, S., Reps, T., Binkley, D.: Interprocedural slicing using dependence graphs. TOPLAS\u00a012(1), 26\u201360 (1990)","journal-title":"TOPLAS"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Rountev, A., Kagan, S., Marlowe, T.: Interprocedural dataflow analysis in the presence of large libraries. Technical Report CISRC-TR01, Ohio State U (2006)","DOI":"10.1007\/11688839_2"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2000)"},{"key":"4_CR13","unstructured":"Sharp, M.: Static Analyses for Java in the Presence of Distributed Components and Large Libraries. PhD thesis, Ohio State University (2007)"},{"key":"4_CR14","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":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45937-5_13","volume-title":"Compiler Construction","author":"P. Cousot","year":"2002","unstructured":"Cousot, P., Cousot, R.: Modular static program analysis. In: Horspool, R.N. (ed.) CC 2002. LNCS, vol.\u00a02304, pp. 159\u2013178. Springer, Heidelberg (2002)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Yorsh, G., Yahav, E., Chandra, S.: Generating precise and concise procedure summaries. In: POPL (2008)","DOI":"10.1145\/1328438.1328467"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/11688839_2","volume-title":"Compiler Construction","author":"A. Rountev","year":"2006","unstructured":"Rountev, A., Kagan, S., Marlowe, T.: Interprocedural dataflow analysis in the presence of large libraries. In: Mycroft, A., Zeller, A. (eds.) CC 2006. LNCS, vol.\u00a03923, pp. 2\u201316. Springer, Heidelberg (2006)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Chatterjee, R., Ryder, B.G., Landi, W.: Relevant context inference. In: POPL, pp. 133\u2013146 (1999)","DOI":"10.1145\/292540.292554"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Choi, J., Gupta, M., Serrano, M., Sreedhar, V., Midkiff, S.: Escape analysis for Java. In: OOPSLA, pp. 1\u201319 (1999)","DOI":"10.1145\/320384.320386"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Whaley, J., Rinard, M.: Compositional pointer and escape analysis for Java programs. In: OOPSLA, pp. 187\u2013206 (1999)","DOI":"10.1145\/320384.320400"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Cheng, B., Hwu, W.: Modular interprocedural pointer analysis using access paths. In: PLDI, pp. 57\u201369 (2000)","DOI":"10.1145\/349299.349311"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Ruf, E.: Effective synchronization removal for Java. In: PLDI, pp. 208\u2013218 (2000)","DOI":"10.1145\/349299.349327"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-3-540-45099-3_10","volume-title":"Static Analysis","author":"J. Foster","year":"2000","unstructured":"Foster, J., F\u00e4hndrich, M., Aiken, A.: Polymorphic versus monomorphic flow-insensitive points-to analysis for C. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol.\u00a01824, pp. 175\u2013198. Springer, Heidelberg (2000)"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-47764-0_16","volume-title":"Static Analysis","author":"D. Liang","year":"2001","unstructured":"Liang, D., Harrold, M.J.: Efficient computation of parameterized pointer information for interprocedural analyses. In: Cousot, P. (ed.) SAS 2001. LNCS, vol.\u00a02126, pp. 279\u2013298. Springer, Heidelberg (2001)"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Triantafyllis, S., Bridges, M., Raman, E., Ottoni, G., August, D.: A framework for unrestricted whole-program optimization. In: PLDI, pp. 61\u201371 (2006)","DOI":"10.1145\/1133981.1133989"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-71229-9_12","volume-title":"Compiler Construction","author":"S. Cherem","year":"2007","unstructured":"Cherem, S., Rugina, R.: A practical effect and escape analysis for building lightweight method summaries. In: Krishnamurthi, S., Odersky, M. (eds.) CC 2007. LNCS, vol.\u00a04420, pp. 172\u2013186. Springer, Heidelberg (2007)"},{"key":"4_CR27","unstructured":"Chatterjee, R., Ryder, B.G.: Data-flow-based testing of object-oriented libraries. Technical Report DCS-TR-433, Rutgers University (2001)"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BFb0053045","volume-title":"ECOOP \u201992 European Conference on Object-Oriented Programming","author":"N. Oxh\u00f8j","year":"1992","unstructured":"Oxh\u00f8j, N., Palsberg, J., Schwartzbach, M.: Making Type Inference Practical. In: Lehrmann Madsen, O. (ed.) ECOOP 1992. LNCS, vol.\u00a0615, pp. 329\u2013349. Springer, Heidelberg (1992)"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Codish, M., Debray, S., Giacobazzi, R.: Compositional analysis of modular logic programs. In: POPL, pp. 451\u2013464 (1993)","DOI":"10.1145\/158511.158703"},{"issue":"2","key":"4_CR30","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. TOPLAS\u00a021(2), 370\u2013416 (1999)","journal-title":"TOPLAS"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Das, M.: Unification-based pointer analysis with directional assignments. In: PLDI, pp. 35\u201346 (2000)","DOI":"10.1145\/349299.349309"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Heintze, N., Tardieu, O.: Ultra-fast aliasing analysis using CLA. In: PLDI, pp. 254\u2013263 (2001)","DOI":"10.1145\/378795.378855"},{"key":"4_CR33","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":"4_CR34","doi-asserted-by":"crossref","unstructured":"Dwyer, M.: Modular flow analysis of concurrent software. In: ASE, pp. 264\u2013273 (1997)","DOI":"10.1109\/ASE.1997.632847"},{"key":"4_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/3-540-45574-4_15","volume-title":"Languages and Compilers for Parallel Computing","author":"S. Guyer","year":"2001","unstructured":"Guyer, S., Lin, C.: Optimizing the use of high performance software libraries. In: Midkiff, S.P., Moreira, J.E., Gupta, M., Chatterjee, S., Ferrante, J., Prins, J.F., Pugh, B., Tseng, C.-W. (eds.) LCPC 2000. LNCS, vol.\u00a02017, pp. 227\u2013243. Springer, Heidelberg (2001)"},{"key":"4_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/3-540-45306-7_11","volume-title":"Compiler Construction","author":"R. Rugina","year":"2001","unstructured":"Rugina, R., Rinard, M.: Design-driven compilation. In: Wilhelm, R. (ed.) CC 2001. LNCS, vol.\u00a02027, pp. 150\u2013164. Springer, Heidelberg (2001)"},{"issue":"7","key":"4_CR37","first-page":"442","volume":"22","author":"M.J. Harrold","year":"1996","unstructured":"Harrold, M.J., Rothermel, G.: Separate computation of alias information for reuse. TSE\u00a022(7), 442\u2013460 (1996)","journal-title":"TSE"},{"key":"4_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/3-540-48166-4_15","volume-title":"Software Engineering - ESEC\/FSE \u201999","author":"A. Rountev","year":"1999","unstructured":"Rountev, A., Ryder, B.G., Landi, W.: Data-flow analysis of program fragments. In: Nierstrasz, O., Lemoine, M. (eds.) ESEC 1999 and ESEC-FSE 1999. LNCS, vol.\u00a01687, pp. 235\u2013252. Springer, Heidelberg (1999)"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Sreedhar, V., Burke, M., Choi, J.: A framework for interprocedural optimization in the presence of dynamic class loading. In: PLDI, pp. 196\u2013207 (2000)","DOI":"10.1145\/349299.349326"},{"key":"4_CR40","doi-asserted-by":"crossref","unstructured":"Ghemawat, S., Randall, K., Scales, D.: Field analysis: Getting useful and low-cost interprocedural information. In: PLDI, pp. 334\u2013344 (2000)","DOI":"10.1145\/358438.349343"},{"key":"4_CR41","doi-asserted-by":"crossref","unstructured":"Vivien, F., Rinard, M.: Incrementalized pointer and escape analysis. In: PLDI, pp. 35\u201346 (2001)","DOI":"10.1145\/378795.378804"},{"issue":"6","key":"4_CR42","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. TOPLAS\u00a024(6), 625\u2013666 (2002)","journal-title":"TOPLAS"},{"issue":"6","key":"4_CR43","first-page":"372","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. TSE\u00a030(6), 372\u2013387 (2004)","journal-title":"TSE"},{"key":"4_CR44","unstructured":"Rountev, A.: Precise identification of side-effect-free methods in Java. In: ICSM, pp. 82\u201391 (2004)"},{"key":"4_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/978-3-540-31985-6_21","volume-title":"Compiler Construction","author":"J. Xue","year":"2005","unstructured":"Xue, J., Nguyen, P.H.: Completeness analysis for incomplete object-oriented programs. In: Bodik, R. (ed.) CC 2005. LNCS, vol.\u00a03443, pp. 271\u2013286. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78791-4_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:22:28Z","timestamp":1619522548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78791-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540787907","9783540787914"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78791-4_4","relation":{},"subject":[]}}