2026-09-18T18:23:10Z https://www.ideals.illinois.edu/oai-pmh

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

Hwu, Wen-Mei W. Cheng, Ben-Chung 2015-09-25T20:21:16Z 2015-09-25T20:21:16Z 10000-01-01 2000 2000 The core of this dissertation is a new modular interprocedural pointer analysis algorithm which significantly improves the feasibility of static memory disambiguation. The proposed algorithm can handle much larger C programs with realistic language features. Due to its modular feature, the amounts of time and memory requirements are greatly reduced. The dissertation also evaluates the effectiveness of the proposed algorithm on the complete SPECcint92 and SPECcint95 benchmark suites. Significant performance improvements are observed from these pointer-intensive programs. Made available in DSpace on 2015-09-25T20:21:16Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9971049.pdf: 6624618 bytes, checksum: 001b3394e56f97d26406c76b8dc7b24d (MD5) Previous issue date: 2000 Embargo set by: Seth Robbins for item 83259 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 148 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000. http://hdl.handle.net/2142/81978 (MiAaPQ)AAI9971049 eng Computer Science Compile -Time Memory Disambiguation for C Programs text Computer Science Computer Science University of Illinois at Urbana-Champaign Dissertation Ph.D.