{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81750"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81750","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Architectural Support for Software Debugging","abstract":"We also present an incremental checking framework, called iChecker, that leverages iWatcher to provide an iChecker library for efficient, incremental, run-time consistency checks of mutable data structures in C programs. The basic idea of iChecker is to perform a consistency check with a local check (on the parts that need to be checked due to the modifications since the last consistency check) instead of with a global check. The evaluation using four case studies shows that iChecker reduces the checking overhead by 1.1-155 times (23.3 on average) over global checks for large data structures. The required code modifications for iChecker are 25-108 lines (including the global checkers), which are 10-56 lines more than the modifications for traditional global checks.","abstract_html":"We also present an incremental checking framework, called iChecker, that leverages iWatcher to provide an iChecker library for efficient, incremental, run-time consistency checks of mutable data structures in C programs. The basic idea of iChecker is to perform a consistency check with a local check (on the parts that need to be checked due to the modifications since the last consistency check) instead of with a global check. The evaluation using four case studies shows that iChecker reduces the checking overhead by 1.1-155 times (23.3 on average) over global checks for large data structures. The required code modifications for iChecker are 25-108 lines (including the global checkers), which are 10-56 lines more than the modifications for traditional global checks.","abstract_has_math":false,"creators":["Zhou, Pin"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Zhou, Yuanyuan"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:20:17Z","date_published":"2015-09-25T20:20:17Z","updated_at":"2026-07-22T22:26:16Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3243045"],"render_values":[{"text":"(MiAaPQ)AAI3243045","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81750","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Zhou, Yuanyuan"]},{"key":"dc:creator","label":"Author","values":["Zhou, Pin"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:20:17Z","10000-01-01","2006"]},{"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/81750","(MiAaPQ)AAI3243045"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["We also present an incremental checking framework, called iChecker, that leverages iWatcher to provide an iChecker library for efficient, incremental, run-time consistency checks of mutable data structures in C programs. The basic idea of iChecker is to perform a consistency check with a local check (on the parts that need to be checked due to the modifications since the last consistency check) instead of with a global check. The evaluation using four case studies shows that iChecker reduces the checking overhead by 1.1-155 times (23.3 on average) over global checks for large data structures. The required code modifications for iChecker are 25-108 lines (including the global checkers), which are 10-56 lines more than the modifications for traditional global checks.","Made available in DSpace on 2015-09-25T20:20:17Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3243045.pdf: 3928855 bytes, checksum: c0e3dcfd16016d36fec35a4d7e169df3 (MD5) Previous issue date: 2006","Embargo set by: Seth Robbins for item 83031 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","122 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006."]},{"key":"dc:title","label":"Title","values":["Architectural Support for Software Debugging"]}]}],"canonical_facts":{"dc:contributor":["Zhou, Yuanyuan"],"dc:creator":["Zhou, Pin"],"dc:date":["2015-09-25T20:20:17Z","10000-01-01","2006"],"dc:description":["We also present an incremental checking framework, called iChecker, that leverages iWatcher to provide an iChecker library for efficient, incremental, run-time consistency checks of mutable data structures in C programs. The basic idea of iChecker is to perform a consistency check with a local check (on the parts that need to be checked due to the modifications since the last consistency check) instead of with a global check. The evaluation using four case studies shows that iChecker reduces the checking overhead by 1.1-155 times (23.3 on average) over global checks for large data structures. The required code modifications for iChecker are 25-108 lines (including the global checkers), which are 10-56 lines more than the modifications for traditional global checks.","Made available in DSpace on 2015-09-25T20:20:17Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3243045.pdf: 3928855 bytes, checksum: c0e3dcfd16016d36fec35a4d7e169df3 (MD5) Previous issue date: 2006","Embargo set by: Seth Robbins for item 83031 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","122 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2006."],"dc:identifier":["http://hdl.handle.net/2142/81750","(MiAaPQ)AAI3243045"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Architectural Support for Software Debugging"],"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"}