{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T03:45:37Z","timestamp":1780371937616,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540009047","type":"print"},{"value":"9783540365792","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36579-6_12","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T18:15:58Z","timestamp":1181240158000},"page":"153-169","source":"Crossref","is-referenced-by-count":195,"title":["Scaling Java Points-to Analysis Using Spark"],"prefix":"10.1007","author":[{"given":"Ond\u0159ej","family":"Lhot\u00e1k","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurie","family":"Hendren","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"12_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BFb0055513","volume-title":"Types in Compilation, Second International Workshop, TIC\u2019 98","author":"A. Aiken","year":"1998","unstructured":"A. Aiken, M. F\u00e4hndrich, J. S. Foster, and Z. Su. Atoolkit for constructing type-and constraintbased program analyses. In Types in Compilation, Second International Workshop, TIC\u2019 98, volume 1473 of LNCS, pages 78\u201396, 1998."},{"key":"12_CR2","unstructured":"L. O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, University of Copenhagen, May 1994. (DIKU report 94\/19)."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"D. F. Bacon and P. F. Sweeney. Fast static analysis ofC++virtual function calls. In Proceedings of the 1996 OOPSLA, pages 324\u2013341, 1996.","DOI":"10.1145\/236338.236371"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/358438.349309","volume":"35.5","author":"M. Das","year":"2000","unstructured":"M. Das. Unification-based pointer analysis with directional assignments. In Proceedings of PLDI\u201900, volume 35.5of ACM Sigplan Notices, pages 35\u201346, June 2000.","journal-title":"ACM Sigplan Notices"},{"key":"12_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-49538-X_5","volume-title":"ECOOP\u201995-Object-Oriented Programming, 9th European Conference","author":"J. Dean","year":"1995","unstructured":"J. Dean, D. Grove, and C. Chambers. Optimization of object-oriented programs using static class hierarchy analysis. In ECOOP\u201995-Object-Oriented Programming, 9th European Conference, volume 952 of LNCS, pages 77\u2013101, Aug. 1995."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"A. Diwan, K. S. McKinley, and J. E. B. Moss. Type-based alias analysis. In Proceedings of PLDI\u201998, pages 106\u2013117, 1998.","DOI":"10.1145\/277650.277670"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"M. Emami, R. Ghiya, and L. J. Hendren. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In Proceedings of PLDI\u201994, pages 242\u2013256, 1994.","DOI":"10.1145\/178243.178264"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"M. F\u00e4hndrich, J. S. Foster, Z. Su, and A. Aiken. Partial online cycle elimination in inclusion constraint graphs. In Proceedings of PLDI\u201998, pages 85\u201396, June 1998.","DOI":"10.1145\/277650.277667"},{"key":"12_CR9","unstructured":"N. Heintze. Analysis of large code bases: The compile-link-analyze model. http:\/\/cm.bell-labs.com\/cm\/cs\/who\/nch\/cla.ps , 1999."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"N. Heintze and O. Tardieu. Demand-driven pointer analysis. In Proceedings of PLDI\u201901, pages 24\u201334, 2001.","DOI":"10.1145\/378795.378802"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1145\/381694.378855","volume":"36.5","author":"N. Heintze","year":"2001","unstructured":"N. Heintze and O. Tardieu. Ultra-fast aliasing analysis using CLA:A million lines of C code in a second. In Proceedings of PLDI\u201901, volume 36.5 of ACM SIGPLAN Notices, pages 254\u2013263, June 2001.","journal-title":"ACM SIGPLAN Notices"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"M. Hind. Pointer analysis: Haven\u2019t we solved this problem yet? In Proceedings of PASTE\u201901, pages 54\u201361, June 2001.","DOI":"10.1145\/379605.379665"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"D. Liang, M. Pennings, and M. J. Harrold. Extending and evaluating flow-insensitive and context-insensitive points-to analyses for Java. In Proceedings of PASTE\u201901, pages 73\u201379, 2001.","DOI":"10.1145\/379605.379676"},{"key":"12_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-45306-7_23","volume-title":"Compiler Construction (CC 2001)","author":"P. Pominville","year":"2001","unstructured":"P. Pominville, F. Qian, R. Vall\u00e9e-Rai, L. Hendren, and C. Verbrugge. A framework for optimizing Java using attributes. In Compiler Construction (CC 2001), volume 2027 of LNCS, pages 334\u2013554, 2001."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"A. Rountev and S. Chandra. Off-line variable substitution for scaling points-to analysis. In Proceedings of PLDI\u201900, pages 47\u201356, Jun 2000.","DOI":"10.1145\/349299.349310"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"A. Rountev, A. Milanova, and B. G. Ryder. Points-to analysis for Java using annotated constraints. In Proceedings of the 2001 OOPSLA, pages 43\u201355, 2001.","DOI":"10.1145\/504282.504286"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"M. Shapiro and S. Horwitz. Fast and accurate flow-insensitive points-to analysis. In Conference Record of 24th POPL\u2019 97, pages 1\u201314, Jan. 1997.","DOI":"10.1145\/263699.263703"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"B. Steensgaard. Points-to analysis in almost linear time. In Conference Record of 23rd POPL\u201996, pages 32\u201341, Jan. 1996.","DOI":"10.1145\/237721.237727"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Z. Su, M. F\u00e4hndrich, and A. Aiken. Projection merging: reducing redundancies in inclusion constraint graphs. In Proceedings of the 27th POPL\u201900, pages 81\u201395, 2000.","DOI":"10.1145\/325694.325706"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"V. Sundaresan, L. Hendren, C. Razafimahefa, R. Vall\u00e9e-Rai, P. Lam, E. Gagnon, and C. Godin. Practical virtual method call resolution for Java. In Proceedings of the 2000 OOPSLA, pages 264\u2013280, 2000.","DOI":"10.1145\/353171.353189"},{"issue":"2","key":"12_CR21","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R. E. Tarjan","year":"1975","unstructured":"R. E. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the AC (JACM), 22(2):215\u2013225, 1975.","journal-title":"Journal of the AC (JACM)"},{"key":"12_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-46423-9_2","volume-title":"Compiler Construction (CC 2000)","author":"R. Vall\u00e9e-Rai","year":"2000","unstructured":"R. Vall\u00e9e-Rai, E. Gagnon, L. J. Hendren, P. Lam, P. Pominville, and V. Sundaresan. Optimizing Java bytecode using the Soot framework: Is it feasible? In Compiler Construction (CC 2000), volume 1781 of LNCS, pages 18\u201334, 2000."},{"key":"12_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/3-540-45789-5_15","volume-title":"Static Analysis 9th International Symposium, SAS 2002","author":"J. Whaley","year":"2002","unstructured":"J. Whaley and M. Lam. An efficient inclusion-based points-to analysis for strictly-typed languages. In Static Analysis 9th International Symposium, SAS 2002, volume 2477 of LNCS, pages 180\u2013195, 2002."}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36579-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T20:25:26Z","timestamp":1556483126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36579-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540009047","9783540365792"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-36579-6_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}