2026-09-19T21:10:47Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/81655 2023-07-11 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Hwu, Wen-Mei W. Kim, Hong-Seok 2015-09-25T20:19:44Z 2015-09-25T20:19:44Z 10000-01-01 2004 2004 Overall, the accuracy of the proposed context-sensitive analysis is equivalent to that achieved by exhaustively inlining all procedure calls with the exception for recursive calls. On the other hand, thanks to the simplification algorithms, the scalability of the proposed context-sensitive analysis is comparable to that achieved by context-insensitive analysis. Made available in DSpace on 2015-09-25T20:19:44Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3160902.pdf: 6508002 bytes, checksum: 38f774975a18c24cae60dad0b335ec2c (MD5) Previous issue date: 2004 Embargo set by: Seth Robbins for item 82936 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs U of I Only 121 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2004. http://hdl.handle.net/2142/81655 (MiAaPQ)AAI3160902 eng Computer Science Context -Sensitive Pointer Analysis Based on Procedural Summaries text Computer Science Computer Science University of Illinois at Urbana-Champaign Dissertation Ph.D.