{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:13:19Z","timestamp":1775873599945,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642370502","type":"print"},{"value":"9783642370519","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37051-9_4","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T19:35:47Z","timestamp":1361216147000},"page":"61-81","source":"Crossref","is-referenced-by-count":56,"title":["An Incremental Points-to Analysis with CFL-Reachability"],"prefix":"10.1007","author":[{"given":"Yi","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Shang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinwei","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingling","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Acharya, M., Robinson, B.: Practical change impact analysis based on static program slicing for industrial software systems. In: ICSE 2011 (2011)","DOI":"10.1145\/1985793.1985898"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Bodden, E., Sewe, A., Sinschek, J., Oueslati, H., Mezini, M.: Taming reflection: Aiding static analysis in the presence of reflection and custom class loaders. In: ICSE 2011 (2011)","DOI":"10.1145\/1985793.1985827"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Burke, M.G.: An interval-based approach to exhaustive and incremental interprocedural data-flow analysis. ACM Trans. Program. Lang. Syst.\u00a012(3) (1990)","DOI":"10.1145\/78969.78963"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Burke, M.G., Ryder, B.G.: A critical analysis of incremental iterative data flow analysis algorithms. IEEE Trans. Software Eng.\u00a016(7) (1990)","DOI":"10.1109\/32.56098"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Carroll, M.D., Ryder, B.G.: Incremental data flow analysis via dominator and attribute updates. In: POPL 1988 (1988)","DOI":"10.1145\/73560.73584"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Ceccarelli, M., Cerulo, L., Canfora, G., Di Penta, M.: An eclectic approach for change impact analysis. In: ICSE 2010 (2010)","DOI":"10.1145\/1810295.1810320"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S.: Subcubic algorithms for recursive state machines. In: POPL 2008 (2008)","DOI":"10.1145\/1328438.1328460"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Goeritzer, R.: Using impact analysis in industry. In: ICSE 2011 (2011)","DOI":"10.1145\/1985793.1986027"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Hardekopf, B., Lin, C.: Flow-sensitive pointer analysis for millions of lines of code. In: CGO 2011 (2011)","DOI":"10.1109\/CGO.2011.5764696"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Hardekopf, B., Lin, C.: Semi-sparse flow-sensitive pointer analysis. In: POPL 2009 (2009)","DOI":"10.1145\/1594834.1480911"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Heintze, N., Tardieu, O.: Demand-driven pointer analysis. In: PLDI 2011 (2001)","DOI":"10.1145\/378795.378802"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Kahlon, V.: Bootstrapping: a technique for scalable flow and context-sensitive pointer alias analysis. In: PLDI 2008 (2008)","DOI":"10.1145\/1375581.1375613"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/11547662_16","volume-title":"Static Analysis","author":"J. Kodumal","year":"2005","unstructured":"Kodumal, J., Aiken, A.: Banshee: A Scalable Constraint-Based Analysis Toolkit. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol.\u00a03672, pp. 218\u2013234. Springer, Heidelberg (2005)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Kodumal, J., Aiken, A.: The set constraint\/CFL reachability connection in practice. In: PLDI 2004 (2004)","DOI":"10.1145\/996841.996867"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Landi, W., Ryder, B.G.: A safe approximate algorithm for interprocedural aliasing. In: PLDI 1992 (1992)","DOI":"10.1145\/143095.143137"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Lehnert, S.: A taxonomy for software change impact analysis. In: IWPSE-EVOL 2011 (2011)","DOI":"10.1145\/2024445.2024454"},{"key":"4_CR17","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_CR18","doi-asserted-by":"crossref","unstructured":"Marlowe, T.J., Ryder, B.G.: An efficient hybrid algorithm for incremental data flow analysis. In: POPL 1990 (1990)","DOI":"10.1145\/96709.96728"},{"key":"4_CR19","unstructured":"Nguyen, P.H., Xue, J.: Interprocedural side-effect analysis and optimisation in the presence of dynamic class loading. In: ACSC 2005 (2005)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Pollock, L.L., Soffa, M.L.: An incremental version of iterative data flow analysis. IEEE Trans. Software Eng.\u00a015(12) (1989)","DOI":"10.1109\/32.58766"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Ren, X., Shah, F., Tip, F., Ryder, B.G., Chesley, O.: Chianti: a tool for change impact analysis of Java programs. In: OOPSLA 2004 (2004)","DOI":"10.1145\/1028976.1029012"},{"key":"4_CR22","unstructured":"Reps, T.: Program analysis via graph reachability. In: ILPS 1997 (1997)"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: POPL 1995 (1995)","DOI":"10.1145\/199448.199462"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Saha, D., Ramakrishnan, C.: Incremental and demand-driven points-to analysis using logic programming. In: PPDP 2005 (2005)","DOI":"10.1145\/1069774.1069785"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Shang, L., Lu, Y., Xue, J.: Fast and precise points-to analysis with incremental CFL-reachability summarisation: preliminary experience. In: ASE 2012 (2012)","DOI":"10.1145\/2351676.2351720"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Shang, L., Xie, X., Xue, J.: On-demand dynamic summary-based points-to analysis. In: CGO 2012 (2012)","DOI":"10.1145\/2259016.2259050"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Sridharan, M., Bod\u00edk, R.: Refinement-based context-sensitive points-to analysis for Java. In: PLDI 2006 (2006)","DOI":"10.1145\/1133981.1134027"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Sridharan, M., Gopan, D., Shan, L., Bod\u00edk, R.: Demand-driven points-to analysis for Java. In: OOPSLA 2005 (2005)","DOI":"10.1145\/1094811.1094817"},{"key":"4_CR29","unstructured":"Sui, Y., Li, Y., Xue, J.: Query-directed adaptive heap cloning for optimizing compilers. In: CGO 2013 (2013)"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Sui, Y., Ye, D., Xue, J.: Static memory leak detection using full-sparse value-flow analysis. In: ISSTA 2012 (2012)","DOI":"10.1145\/2338965.2336784"},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-25318-8_14","volume-title":"Programming Languages and Systems","author":"Y. Sui","year":"2011","unstructured":"Sui, Y., Ye, S., Xue, J., Yew, P.-C.: SPAS: Scalable Path-Sensitive Pointer Analysis on Full-Sparse SSA. In: Yang, H. (ed.) APLAS 2011. LNCS, vol.\u00a07078, pp. 155\u2013171. Springer, Heidelberg (2011)"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Vall\u00e9e-Rai, R., Co, P., Gagnon, E., Hendren, L., Lam, P., Sundaresan, V.: Soot: a java bytecode optimization framework. In: CASCON 2010 (2010)","DOI":"10.1145\/1925805.1925818"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Whaley, J., Lam, M.S.: Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In: PLDI 2004 (2004)","DOI":"10.1145\/996841.996859"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Wilson, R.P., Lam, M.S.: Efficient context-sensitive pointer analysis for C programs. In: PLDI 1995 (1995)","DOI":"10.1145\/207110.207111"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Xiao, X., Zhang, C.: Geometric encoding: forging the high performance context sensitive points-to analysis for Java. In: ISSTA 2011 (2011)","DOI":"10.1145\/2001420.2001443"},{"key":"4_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-03013-0_6","volume-title":"ECOOP 2009 \u2013 Object-Oriented Programming","author":"G. Xu","year":"2009","unstructured":"Xu, G., Rountev, A., Sridharan, M.: Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis. In: Drossopoulou, S. (ed.) ECOOP 2009. LNCS, vol.\u00a05653, pp. 98\u2013122. Springer, Heidelberg (2009)"},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"Yan, D., Xu, G., Rountev, A.: Demand-driven context-sensitive alias analysis for Java. In: ISSTA 2011 (2011)","DOI":"10.1145\/2001420.2001440"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Graph-theoretic methods in database theory. In: PODS 1990 (1990)","DOI":"10.1145\/298514.298576"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Yu, H., Xue, J., Huo, W., Feng, X., Zhang, Z.: Level by level: making flow- and context-sensitive pointer analysis scalable for millions of lines of code. In: CGO 2010 (2010)","DOI":"10.1145\/1772954.1772985"},{"key":"4_CR40","doi-asserted-by":"crossref","unstructured":"Yur, J.-S., Ryder, B.G., Landi, W.: An incremental flow- and context-sensitive pointer aliasing analysis. In: ICSE 1999(1999)","DOI":"10.1145\/302405.302676"},{"key":"4_CR41","doi-asserted-by":"crossref","unstructured":"Zheng, X., Rugina, R.: Demand-driven alias analysis for C. In: POPL 2008 (2008)","DOI":"10.1145\/1328438.1328464"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37051-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T21:09:06Z","timestamp":1562706546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37051-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370502","9783642370519"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37051-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}