{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:03:25Z","timestamp":1760043805734},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642032363"},{"type":"electronic","value":"9783642032370"}],"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-03237-0_15","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T05:24:37Z","timestamp":1249277077000},"page":"205-221","source":"Crossref","is-referenced-by-count":30,"title":["The Complexity of Andersen\u2019s Analysis in Practice"],"prefix":"10.1007","author":[{"given":"Manu","family":"Sridharan","sequence":"first","affiliation":[]},{"given":"Stephen J.","family":"Fink","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Andersen, L.O.: Program Analysis and Specialization for the C Programming Language. PhD thesis, University of Copenhagen, DIKU (1994)"},{"key":"15_CR2","unstructured":"Apache Ant, http:\/\/ant.apache.org"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Berndl, M., Lhot\u00e1k, O., Qian, F., Hendren, L., Umanee, N.: Points-to analysis using BDDs. In: Conference on Programming Language Design and Implementation (PLDI) (June 2003)","DOI":"10.1145\/781131.781144"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Blackburn, S.M., Garner, R., Hoffman, C., Khan, A.M., McKinley, K.S., Bentzur, R., Diwan, A., Feinberg, D., Frampton, D., Guyer, S.Z., Hirzel, M., Hosking, A., Jump, M., Lee, H., Moss, J.E.B., Phansalkar, A., Stefanovi\u0107, D., VanDrunen, T., von Dincklage, D., Wiedermann, B.: The DaCapo benchmarks: Java benchmarking development and analysis. In: Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) (2006)","DOI":"10.1145\/1167473.1167488"},{"key":"15_CR5","first-page":"159","volume-title":"POPL 2008: Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"S. Chaudhuri","year":"2008","unstructured":"Chaudhuri, S.: Subcubic algorithms for recursive state machines. In: POPL 2008: Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 159\u2013169. ACM, New York (2008)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"F\u00e4ndrich, M., Foster, J.S., Su, Z., Aiken, A.: Partial online cycle elimination in inclusion constraint graphs. In: Conference on Programming Language Design and Implementation (PLDI), Montreal, Canada (June 1998)","DOI":"10.1145\/277650.277667"},{"issue":"4","key":"15_CR7","first-page":"304","volume":"5","author":"C. Fecht","year":"1998","unstructured":"Fecht, C., Seidl, H.: Propagating differences: an efficient new fixpoint algorithm for distributive constraint systems. Nordic J. of Computing\u00a05(4), 304\u2013329 (1998)","journal-title":"Nordic J. of Computing"},{"key":"15_CR8","first-page":"395","volume-title":"ESEC-FSE 2007: Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering","author":"S.F. Goldsmith","year":"2007","unstructured":"Goldsmith, S.F., Aiken, A.S., Wilkerson, D.S.: Measuring empirical computational complexity. In: ESEC-FSE 2007: Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering, pp. 395\u2013404. ACM Press, New York (2007)"},{"key":"15_CR9","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: PLDI, pp. 290\u2013299 (2007)","DOI":"10.1145\/1250734.1250767"},{"issue":"5","key":"15_CR10","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1145\/258916.258939","volume":"32","author":"N. Heintze","year":"1997","unstructured":"Heintze, N., McAllester, D.: Linear-time subtransitive control flow analysis. SIGPLAN Not.\u00a032(5), 261\u2013272 (1997)","journal-title":"SIGPLAN Not."},{"key":"15_CR11","first-page":"342","volume-title":"LICS 1997: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science","author":"N. Heintze","year":"1997","unstructured":"Heintze, N., McAllester, D.: On the cubic bottleneck in subtyping and flow analysis. In: LICS 1997: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, Washington, DC, USA, 1997, p. 342. IEEE Computer Society, Los Alamitos (1997)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Heintze, N., Tardieu, O.: Demand-driven pointer analysis. In: Conference on Programming Language Design and Implementation (PLDI), Snowbird, Utah (June 2001)","DOI":"10.1145\/378795.378802"},{"key":"15_CR13","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: Conference on Programming Language Design and Implementation (PLDI), Snowbird, Utah (June 2001)","DOI":"10.1145\/378795.378855"},{"key":"15_CR14","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":"15_CR15","unstructured":"Lhot\u00e1k, O.: Spark: A flexible points-to analysis framework for Java. Master\u2019s thesis, McGill University (December 2002)"},{"key":"15_CR16","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":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/11688839_5","volume-title":"Compiler Construction","author":"O. Lhot\u00e1k","year":"2006","unstructured":"Lhot\u00e1k, O., Hendren, L.: Context-sensitive points-to analysis: Is it worth it? In: Mycroft, A., Zeller, A. (eds.) CC 2006. LNCS, vol.\u00a03923, pp. 47\u201364. Springer, Heidelberg (2006)"},{"issue":"1","key":"15_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044834.1044835","volume":"14","author":"A. Milanova","year":"2005","unstructured":"Milanova, A., Rountev, A., Ryder, B.G.: Parameterized object sensitivity for points-to analysis for java. ACM Trans. Softw. Eng. Methodol.\u00a014(1), 1\u201341 (2005)","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"15_CR19","unstructured":"Pearce, D.J.: Some directed graph algorithms and their application to pointer analysis. PhD thesis, Imperial College of Science, Technology and Medicine, University of London (2005)"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Pearce, D.J., Kelly, P.H.J., Hankin, C.: Online cycle detection and difference propagation for pointer analysis. In: Proceedings of the third international IEEE Workshop on Source Code Analysis and Manipulation (2003)","DOI":"10.1109\/SCAM.2003.1238026"},{"issue":"11-12","key":"15_CR21","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":"15_CR22","doi-asserted-by":"crossref","unstructured":"Rountev, A., Milanova, A., Ryder, B.G.: Points-to analysis for Java using annotated constraints. In: Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), Tampa Bay, Florida (October 2001)","DOI":"10.1145\/504282.504286"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Shivers, O.: Control flow analysis in scheme. In: Conference on Programming Language Design and Implementation (PLDI) (1988)","DOI":"10.1145\/53990.54007"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Sridharan, M., Bod\u00edk, R.: Refinement-based context-sensitive points-to analysis for Java. In: Conference on Programming Language Design and Implementation (PLDI) (2006)","DOI":"10.1145\/1133981.1134027"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Sridharan, M., Gopan, D., Shan, L., Bod\u00edk, R.: Demand-driven points-to analysis for Java. In: Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) (2005)","DOI":"10.1145\/1094811.1094817"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Steensgaard, B.: Points-to analysis in almost linear time. In: ACM Symposium on Principles of Programming Languages (POPL) (1996)","DOI":"10.1145\/237721.237727"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Su, Z., F\u00e4hndrich, M., Aiken, A.: Projection merging: Reducing redundancies in inclusion constraint graphs. In: ACM Symposium on Principles of Programming Languages (POPL), Boston, Massachusetts, January 2000, pp. 81\u201395 (2000)","DOI":"10.1145\/325694.325706"},{"key":"15_CR28","unstructured":"T.J. Watson Libraries for Analysis (WALA), http:\/\/wala.sf.net"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Whaley, J., Lam, M.S.: Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In: Conference on Programming Language Design and Implementation (PLDI) (2004)","DOI":"10.1145\/996841.996859"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Zhu, J., Calman, S.: Symbolic pointer analysis revisited. In: Conference on Programming Language Design and Implementation (PLDI) (2004)","DOI":"10.1145\/996841.996860"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03237-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T20:33:19Z","timestamp":1558470799000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03237-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642032363","9783642032370"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03237-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}