{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T07:26:51Z","timestamp":1748071611393,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665380"},{"type":"electronic","value":"9783540481669"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48166-4_13","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T00:59:20Z","timestamp":1186621160000},"page":"199-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Efficient Points-to Analysis for Whole-Program Analysis"],"prefix":"10.1007","author":[{"given":"Donglin","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mary Jean","family":"Harrold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,8,27]]},"reference":[{"key":"13_CR1","unstructured":"L.O. Andersen. Program analysis and specialization for the C programming language. Technical Report 94-19, University of Copenhagen, 1994."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"D. Atkinson and W. Griswold. Effective whole-program analysis in the presence of pointers. In Proceedings of the Sixth ACM SIGSOFT Symposium on the Foundation of Software Engineering, pages 46\u201355, November 1998.","DOI":"10.1145\/291252.288217"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"M. Burke, P. Carini, J. D. Choi, and M. Hind. Flow-insensitive interprocedrual alias analysis in the presence of pointers. In Language and Compilers for Parallel Computing: Proceedings of the 7th International Workshop, pages 234\u2013250, 1994.","DOI":"10.1007\/BFb0025882"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Ramkrishna Chatterjee, Barbara G. Ryder, and William A. Landi. Relevant context inference. In Proceedings of 26th ACM SIGACT\/SIGPLAN Symposium on Principles of Programming Languages, January 1999.","DOI":"10.1145\/292540.292554"},{"key":"13_CR5","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 SIGPLAN\u2019 94 Conference on Programming Language Design and Implementation, pages 242\u2013256, June 1994.","DOI":"10.1145\/773473.178264"},{"key":"13_CR6","unstructured":"Programming Languages Research Group. PROLANGS Analysis Framework. http:\/\/www.prolangs.rutgers.edu\/ , Rutgers University, 1998."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"M. J. Harrold and N. Ci. Reuse-driven interprocedural slicing. In The 20th Inter-national Conference on Software Engineering, pages 74\u201383, April 1998.","DOI":"10.1109\/ICSE.1998.671104"},{"issue":"7","key":"13_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1109\/32.538603","volume":"22","author":"M. J. Harrold","year":"1996","unstructured":"M. J. Harrold and G Rothermel. Separate computation of alias information for reuse. IEEE Transactions on Software Engineering, 22(7):107\u2013120, June 1996.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/174662.174663","volume":"16","author":"M. J. Harrold","year":"1994","unstructured":"M. J. Harrold and M. L. Soffa. Efficient computation of interprocedural definition-use chains. ACM Transactions on Programming Languages and Systems, 16(2):175\u2013204, March 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/77606.77608","volume":"12","author":"S. Horwitz","year":"1990","unstructured":"S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems, 12(1):26\u201360, January 1990.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"W. Landi and B. G. Ryder. A safe approximate algorithm for interprocedural pointer aliasing. In Proceedings of 1992 ACM Symposium on Programming Language Design and Implementation, pages 235\u2013248, June 1992.","DOI":"10.1145\/143103.143137"},{"key":"13_CR12","unstructured":"D. Liang and M. J. Harrold. Context-sensitive, procedure-specific points-to analysis. Technical Report OSU-CISRC-3\/99-TR05, The Ohio State University, March 1999."},{"key":"13_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0032731","volume-title":"Static Analysis 4th International Symposium, SAS\u2019 97","author":"M. Shapiro","year":"1997","unstructured":"M. Shapiro and S. Horwitz. The effects of the precision of pointer analysis. In Static Analysis 4th International Symposium, SAS\u2019 97, Lecture Notes in Computer Science Vol 1302, pages 16\u201334, September 1997."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"M. Shapiro and S. Horwitz. Fast and accurate flow-insensitive points-to analysis. In Conference Record of the 24th ACM Symposium on Principles of Programming Languages, pages 1\u201314, 1997.","DOI":"10.1145\/263699.263703"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"B. Steensgaard. Points-to analysis by type inference of programs with structures and unions. In Proc. of the Int. Conf. on Compiler Construction, pages 136\u2013150, 1996.","DOI":"10.1007\/3-540-61053-7_58"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"B. Steensgaard. Points-to analysis in almost linear time. In Conference Record of the 23rd ACM Symposium on Principles of Programming Languages, pages 32\u201341, 1996.","DOI":"10.1145\/237721.237727"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"R. P. Wilson and M. S. Lam. Efficient context-sensitive pointer analysis for C programs. In Proceedings of SIGPLAN\u2019 95 Conference on Programming Language Design and Implementation, pages 1\u201312, 1995.","DOI":"10.1145\/207110.207111"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"S. Zhang, B. G. Ryder, and W. Landi. Program decomposition for pointer analysis: A step toward practical analyses. In Proceedings of the Fourth ACM SIGSOFT Symposium on the Foundation of Software Engineering, pages 81\u201392, November 1996.","DOI":"10.1145\/250707.239112"}],"container-title":["Lecture Notes in Computer Science","Software Engineering \u2014 ESEC\/FSE \u201999"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48166-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T06:03:30Z","timestamp":1737353010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48166-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665380","9783540481669"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48166-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"27 August 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}