{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:15:32Z","timestamp":1775873732847,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642030123","type":"print"},{"value":"9783642030130","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03013-0_6","type":"book-chapter","created":{"date-parts":[[2009,7,30]],"date-time":"2009-07-30T10:30:01Z","timestamp":1248949801000},"page":"98-122","source":"Crossref","is-referenced-by-count":73,"title":["Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis"],"prefix":"10.1007","author":[{"given":"Guoqing","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atanas","family":"Rountev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manu","family":"Sridharan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Das, M., Lerner, S., Seigle, M.: ESP: Path-sensitive program verification in polynomial time. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 57\u201368 (2002)","DOI":"10.1145\/512529.512538"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Fink, S., Yahav, E., Dor, N., Ramalingam, G., Geay, E.: Effective typestate verification in the presence of aliasing. In: ACM SIGSOFT International Symposium on Software Testing and Analysis, pp. 133\u2013144 (2006)","DOI":"10.1145\/1146238.1146254"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Naik, M., Aiken, A., Whaley, J.: Effective static race detection for Java. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 308\u2013319 (2006)","DOI":"10.1145\/1133981.1134018"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Voung, J.W., Jhala, R., Lerner, S.: RELAY: Static race detection on millions of lines of code. In: ACM SIGSOFT International Symposium on the Foundations of Software Engineering, pp. 205\u2013214 (2007)","DOI":"10.1145\/1287624.1287654"},{"issue":"1","key":"6_CR5","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. ACM Transactions on Programming Languages and Systems\u00a012(1), 26\u201360 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Sridharan, M., Bodik, R.: Refinement-based context-sensitive points-to analysis for Java. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 387\u2013400 (2006)","DOI":"10.1145\/1133981.1134027"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Zheng, X., Rugina, R.: Demand-driven alias analysis for C. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 197\u2013208 (2008)","DOI":"10.1145\/1328438.1328464"},{"issue":"11-12","key":"6_CR8","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/S0950-5849(98)00093-7","volume":"40","author":"T. Reps","year":"1998","unstructured":"Reps, T.: Program analysis via graph reachability. Information and Software Technology\u00a040(11-12), 701\u2013726 (1998)","journal-title":"Information and Software Technology"},{"key":"6_CR9","unstructured":"Sridharan, M. (2006), http:\/\/www.sable.mcgill.ca\/pipermail\/soot-list\/2006-January\/000477.html"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Kahlon, V.: Bootstrapping: A technique for scalable flow and context-sensitive pointer alias analysis. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 249\u2013259 (2008)","DOI":"10.1145\/1375581.1375613"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Lhot\u00e1k, O., Hendren, L.: Context-sensitive points-to analysis: Is it worth it? In: International Conference on Compiler Construction, pp. 47\u201364 (2006)","DOI":"10.1007\/11688839_5"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Xu, G., Rountev, A.: Merging equivalent contexts for scalable heap-cloning-based context-sensitive points-to analysis. In: ACM SIGSOFT International Symposium on Software Testing and Analysis, pp. 225\u2013235 (2008)","DOI":"10.1145\/1390630.1390658"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Kodumal, J., Aiken, A.: The set constraint\/CFL reachability connection in practice. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 207\u2013218 (2004)","DOI":"10.1145\/996841.996867"},{"key":"6_CR14","unstructured":"Soot Framework, http:\/\/www.sable.mcgill.ca\/soot"},{"key":"6_CR15","doi-asserted-by":"crossref","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: International Conference on Compiler Construction, pp. 18\u201334 (2000)","DOI":"10.1007\/3-540-46423-9_2"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Sridharan, M., Gopan, D., Shan, L., Bodik, R.: Demand-driven points-to analysis for Java. In: ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, pp. 59\u201376 (2005)","DOI":"10.1145\/1094811.1094817"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Chatterjee, R., Ryder, B.G., Landi, W.: Relevant context inference. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 133\u2013146 (1999)","DOI":"10.1145\/292540.292554"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Wilson, R., Lam, M.: Efficient context-sensitive pointer analysis for C programs. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 1\u201312 (1995)","DOI":"10.1145\/207110.207111"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Cheng, B., Hwu, W.: Modular interprocedural pointer analysis using access paths. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 57\u201369 (2000)","DOI":"10.1145\/349299.349311"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Whaley, J., Rinard, M.: Compositional pointer and escape analysis for Java programs. In: ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, pp. 187\u2013206 (1999)","DOI":"10.1145\/320384.320400"},{"key":"6_CR21","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 Computer Science\u00a0248, 29\u201398 (2000)","journal-title":"Theoretical Computer Science"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Rehof, J., F\u00e4hndrich, M.: Type-based flow analysis: From polymorphic subtyping to CFL-reachability. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 54\u201366 (2001)","DOI":"10.1145\/373243.360208"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Kodumal, J., Aiken, A.: Regularly annotated set constraints. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 331\u2013341 (2007)","DOI":"10.1145\/1250734.1250772"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Nystrom, E., Kim, H., Hwu, W.: Importance of heap specialization in pointer analysis. In: PASTE, pp. 43\u201348 (2004)","DOI":"10.1145\/996821.996836"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Lattner, C., Lenharth, A., Adve, V.: Making context-sensitive points-to analysis with heap cloning practical for the real world. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 278\u2013289 (2007)","DOI":"10.1145\/1250734.1250766"},{"key":"6_CR26","first-page":"189","volume-title":"Program Flow Analysis: Theory and Applications","author":"M. Sharir","year":"1981","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In: Muchnick, S., Jones, N. (eds.) Program Flow Analysis: Theory and Applications, pp. 189\u2013234. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"6_CR27","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":"6_CR28","doi-asserted-by":"crossref","unstructured":"Hind, M.: Pointer analysis: Haven\u2019t we solved this problem yet? In: PASTE, pp. 54\u201361 (2001)","DOI":"10.1145\/379605.379665"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 49\u201361 (1995)","DOI":"10.1145\/199448.199462"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Horwitz, S., Reps, T., Sagiv, M.: Demand interprocedural dataflow analysis. In: ACM SIGSOFT International Symposium on the Foundations of Software Engineering, pp. 104\u2013115 (1995)","DOI":"10.1145\/222124.222146"},{"key":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/3-540-57877-3_26","volume-title":"Compiler Construction","author":"T. Reps","year":"1994","unstructured":"Reps, T.: Solving demand versions of interprocedural analysis problems. In: Fritzson, P.A. (ed.) CC 1994. LNCS, vol.\u00a0786, pp. 389\u2013403. Springer, Heidelberg (1994)"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M., Rosay, G.: Speeding up slicing. In: ACM SIGSOFT International Symposium on the Foundations of Software Engineering, pp. 11\u201320 (1994)","DOI":"10.1145\/193173.195287"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Naik, M., Aiken, A.: Conditional must not aliasing for static race detection. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 327\u2013338 (2007)","DOI":"10.1145\/1190216.1190265"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Rountev, A., Chandra, S.: Off-line variable substitution for scaling points-to analysis. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 47\u201356 (2000)","DOI":"10.1145\/349299.349310"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Hardekopf, B., Lin, C.: The ant and the grasshopper: Fast and accurate pointer analysis for millions of lines of code. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 290\u2013299 (2007)","DOI":"10.1145\/1250734.1250767"},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"Berndl, M., Lhot\u00e1k, O., Qian, F., Hendren, L., Umanee, N.: Points-to analysis using BDDs. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 103\u2013114 (2003)","DOI":"10.1145\/780822.781144"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Lhot\u00e1k, O., Hendren, L.: Jedd: A BDD-based relational extension of Java. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 158\u2013169 (2004)","DOI":"10.1145\/996893.996861"},{"key":"6_CR38","doi-asserted-by":"crossref","unstructured":"Whaley, J., Lam, M.: Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 131\u2013144 (2004)","DOI":"10.1145\/996841.996859"},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Zhu, J., Calman, S.: Symbolic pointer analysis revisited. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 145\u2013157 (2004)","DOI":"10.1145\/996841.996860"},{"key":"6_CR40","unstructured":"Bravenboer, M., Smaragdakis, Y.: Doop framework for Java pointer analysis (2009), doop.program-analysis.org"}],"container-title":["Lecture Notes in Computer Science","ECOOP 2009 \u2013 Object-Oriented Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03013-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T15:52:12Z","timestamp":1558453932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03013-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642030123","9783642030130"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03013-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}