{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T20:13:34Z","timestamp":1784232814473,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540227915","type":"print"},{"value":"9783540278641","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27864-1_14","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T12:35:37Z","timestamp":1284640537000},"page":"165-180","source":"Crossref","is-referenced-by-count":54,"title":["Bottom-Up and Top-Down Context-Sensitive Summary-Based Pointer Analysis"],"prefix":"10.1007","author":[{"given":"Erik M.","family":"Nystrom","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hong-Seok","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wen-mei W.","family":"Hwu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Andersen, L.O.: Program analysis and specialization for the C programming language. Ph.D thesis, DIKU, Unversity of Copenhagen (1994)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Chatterjee, R., Ryder, B.G., Landi, W.A.: Relevant context inference. In: POPL (1999)","DOI":"10.1145\/292540.292554"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Cheng, B.-C., Hwu, W.W.: Modular interprocedural pointer analysis using access paths: design, implementation, and evaluation. In: PLDI (2000)","DOI":"10.1145\/349299.349311"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Choi, J.-D., Gupta, M., Serrano, M.J., Sreedhar, V.C., Midkiff, S.P.: Stack allocation and synchronization optimizations for java using escape analysis. TOPLAS (2003)","DOI":"10.1145\/945885.945892"},{"key":"14_CR5","unstructured":"Clarke, E., Grunmberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. Journal of the ACM (1997)"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Das, M.: Unification-based pointer analysis with directional assignments. In: PLDI (2000)","DOI":"10.1145\/349299.349309"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-47764-0_15","volume-title":"Static Analysis","author":"M. Das","year":"2001","unstructured":"Das, M., Liblit, B., F\u00e4hndrich, M., Rehof, J.: Estimating the impact of scalable pointer analysis on optimization. In: Cousot, P. (ed.) SAS 2001. LNCS, vol.\u00a02126, p. 260. Springer, Heidelberg (2001)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Emami, M., Ghiya, R., Hendren, L.J.: Context-sensitive interprocedural pointsto analysis in the presence of function pointers. In: PLDI (1994)","DOI":"10.1145\/178243.178264"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"F\u00e4hndrich, M., Foster, J.S., Su, Z., Aiken, A.: Partial online cycle elimination in inclusion constraint graphs. In: PLDI (1998)","DOI":"10.1145\/277650.277667"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"F\u00e4hndrich, M., Rehof, J., Das, M.: Scalable context-sensitive flow analysis using instantiation constraints. In: PLDI (2000)","DOI":"10.1145\/349299.349332"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Felleisen, M.: Componential set-based analysis. In: PLDI (1997)","DOI":"10.1145\/258915.258937"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-45099-3_10","volume-title":"Static Analysis","author":"J.S. Foster","year":"2000","unstructured":"Foster, J.S., F\u00e4hndrich, M., Aiken, A.: Polymorphic versus monomorphic flowinsensitive points-to analysis for C. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol.\u00a01824, pp. 175\u2013199. Springer, Heidelberg (2000)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44898-5_12","volume-title":"Static Analysis","author":"S.Z. Guyer","year":"2003","unstructured":"Guyer, S.Z., Lin, C.: Client-driven pointer analysis. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, Springer, Heidelberg (2003)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Heintze, N., Tardieu, O.: Ultra-fast aliasing analysis using CLA: a million lines of C code in a second. In: PLDI (2001)","DOI":"10.1145\/378795.378855"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Hind, M.: Pointer analysis: Haven\u2019t we solved this problem yet?. In: PASTE (2001)","DOI":"10.1145\/379605.379665"},{"issue":"4","key":"14_CR16","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1145\/325478.325519","volume":"21","author":"M. Hind","year":"1999","unstructured":"Hind, M., Burke, M., Carini, P., Choi, J.-D.: Interprocedural pointer alias analysis. TOPLAS\u00a021(4), 848\u2013894 (1999)","journal-title":"TOPLAS"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An nlogn algorithm for minimizing the states of a finite automaton. The Theory of Machines and Computations, 189\u2013196 (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Kim, H.-S., Nystrom, E.M., Hwu, W.W.: Bottom-up and top-down contextsensitive summary-based pointer analysis. Technical report, IMPACT research group, University of Illinois (2004)","DOI":"10.1007\/978-3-540-27864-1_14"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Landi, W., Ryder, B.G.: A safe approximation algorithm for interprocedural pointer aliasing. In: PLDI (1992)","DOI":"10.1145\/143095.143137"},{"key":"14_CR20","unstructured":"Lattner, C., Adve, V.: Data structure analysis: a fast and scalable contextsensitive heap analysis. Technical report, CS Dept., University of Illinois (2003)"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Liang, D., Harrold, M.J.: Efficient points-to analysis for whole-program analysis. In: FSE (1999)","DOI":"10.1007\/3-540-48166-4_13"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-48294-6_21","volume-title":"Static Analysis","author":"D.A. McAllester","year":"1999","unstructured":"McAllester, D.A.: On the complexity analysis of static analysis. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol.\u00a01694, p. 312. Springer, Heidelberg (1999)"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Rehof, J.: Minimal typings in atomic subtyping. In: POPL (1997)","DOI":"10.1145\/263699.263738"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: POPL (1995)","DOI":"10.1145\/199448.199462"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Ruf, E.: Context-insensitive alias analysis reconsidered. In: PLDI (1995)","DOI":"10.1145\/207110.207112"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Steensgaard, B.: Points-to analysis in almost linear time. In: POPL (1996)","DOI":"10.1145\/237721.237727"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Wilson, R.P., Lam, M.S.: Efficient context-sensitive pointer analysis for C programs. In: PLDI (1995)","DOI":"10.1145\/207110.207111"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27864-1_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:24:39Z","timestamp":1605741879000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27864-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540227915","9783540278641"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27864-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}