{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81587"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81587","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Analyses of Pointers, Induction Variables, and Container Objects for Dependence Testing","abstract":"The last analysis targets container objects that are provided by standard libraries. Object-oriented design plays an increasing role in performance-critical codes. When dealing with general-purpose programs, arrays share their preeminence with more general container components, such as lists, sets, and hash-tables. We provide a pointer analysis that accurately models containers, iterators, and container-element connections. The analysis is an extension of Sagiv, Reps and Wilhelm's shape analysis for destructive updating. The output of the analysis can be interpreted as alias relations, shape properties, or connectivity.","abstract_html":"The last analysis targets container objects that are provided by standard libraries. Object-oriented design plays an increasing role in performance-critical codes. When dealing with general-purpose programs, arrays share their preeminence with more general container components, such as lists, sets, and hash-tables. We provide a pointer analysis that accurately models containers, iterators, and container-element connections. The analysis is an extension of Sagiv, Reps and Wilhelm's shape analysis for destructive updating. The output of the analysis can be interpreted as alias relations, shape properties, or connectivity.","abstract_has_math":false,"creators":["Wu, Peng"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Padua, David A."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:19:20Z","date_published":"2015-09-25T20:19:20Z","updated_at":"2026-07-22T22:26:16Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3023234"],"render_values":[{"text":"(MiAaPQ)AAI3023234","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81587","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Padua, David A."]},{"key":"dc:creator","label":"Author","values":["Wu, Peng"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:19:20Z","10000-01-01","2001"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81587","(MiAaPQ)AAI3023234"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The last analysis targets container objects that are provided by standard libraries. Object-oriented design plays an increasing role in performance-critical codes. When dealing with general-purpose programs, arrays share their preeminence with more general container components, such as lists, sets, and hash-tables. We provide a pointer analysis that accurately models containers, iterators, and container-element connections. The analysis is an extension of Sagiv, Reps and Wilhelm's shape analysis for destructive updating. The output of the analysis can be interpreted as alias relations, shape properties, or connectivity.","Made available in DSpace on 2015-09-25T20:19:20Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3023234.pdf: 7436180 bytes, checksum: 5ea7e4a98dcb64434bd503b2cec4c278 (MD5) Previous issue date: 2001","Embargo set by: Seth Robbins for item 82868 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","143 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001."]},{"key":"dc:title","label":"Title","values":["Analyses of Pointers, Induction Variables, and Container Objects for Dependence Testing"]}]}],"canonical_facts":{"dc:contributor":["Padua, David A."],"dc:creator":["Wu, Peng"],"dc:date":["2015-09-25T20:19:20Z","10000-01-01","2001"],"dc:description":["The last analysis targets container objects that are provided by standard libraries. Object-oriented design plays an increasing role in performance-critical codes. When dealing with general-purpose programs, arrays share their preeminence with more general container components, such as lists, sets, and hash-tables. We provide a pointer analysis that accurately models containers, iterators, and container-element connections. The analysis is an extension of Sagiv, Reps and Wilhelm's shape analysis for destructive updating. The output of the analysis can be interpreted as alias relations, shape properties, or connectivity.","Made available in DSpace on 2015-09-25T20:19:20Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3023234.pdf: 7436180 bytes, checksum: 5ea7e4a98dcb64434bd503b2cec4c278 (MD5) Previous issue date: 2001","Embargo set by: Seth Robbins for item 82868 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","143 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001."],"dc:identifier":["http://hdl.handle.net/2142/81587","(MiAaPQ)AAI3023234"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Analyses of Pointers, Induction Variables, and Container Objects for Dependence Testing"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:16Z"}