{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/124461"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/124461","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Predictable verification using intrinsic definitions","abstract":"We propose a novel mechanism of defining data structures using intrinsic definitions that avoids recursion and instead utilizes monadic maps satisfying local conditions. We show that intrinsic definitions are a powerful mechanism that can capture a variety of data structures naturally. We show that they also enable a predictable verification methodology that allows engineers to write ghost code to update monadic maps and perform verification using reduction to decidable logics. We evaluate our methodology using Boogie and prove a suite of data structure manipulating programs correct.","abstract_html":"We propose a novel mechanism of defining data structures using intrinsic definitions that avoids recursion and instead utilizes monadic maps satisfying local conditions. We show that intrinsic definitions are a powerful mechanism that can capture a variety of data structures naturally. We show that they also enable a predictable verification methodology that allows engineers to write ghost code to update monadic maps and perform verification using reduction to decidable logics. We evaluate our methodology using Boogie and prove a suite of data structure manipulating programs correct.","abstract_has_math":false,"creators":["Rivera, Cody Jackson"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Parthasarathy, Madhusudan"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2024,"date_issued":"2024-05-02","date_published":"2024-05-02","updated_at":"2026-07-22T22:25:00Z","subjects":["Software Verification","Automated Reasoning","Predictable Verification","Intrinsic Definitions","Verification Of Linked Data Structures","Decidability","Ghost-code Annotations"],"languages":["eng","en"],"rights":["Copyright 2024 Cody Rivera"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2142/124461","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Parthasarathy, Madhusudan"]},{"key":"dc:creator","label":"Author","values":["Rivera, Cody Jackson"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2024-05-02","2024-05"]},{"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":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"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":["Software Verification","Automated Reasoning","Predictable Verification","Intrinsic Definitions","Verification Of Linked Data Structures","Decidability","Ghost-code Annotations"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng","en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2024 Cody Rivera"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://hdl.handle.net/2142/124461"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["We propose a novel mechanism of defining data structures using intrinsic definitions that avoids recursion and instead utilizes monadic maps satisfying local conditions. We show that intrinsic definitions are a powerful mechanism that can capture a variety of data structures naturally. We show that they also enable a predictable verification methodology that allows engineers to write ghost code to update monadic maps and perform verification using reduction to decidable logics. We evaluate our methodology using Boogie and prove a suite of data structure manipulating programs correct.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-09-16 without embargo terms","The student, Cody Rivera, accepted the attached license on 2024-05-02 at 08:59.","The student, Cody Rivera, submitted this Thesis for approval on 2024-05-02 at 09:07.","This Thesis was approved for publication on 2024-05-02 at 11:42.","DSpace SAF Submission Ingestion Package generated from Vireo submission #20753 on 2024-09-16 at 00:37:52"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Predictable verification using intrinsic definitions"]}]}],"canonical_facts":{"dc:contributor":["Parthasarathy, Madhusudan"],"dc:creator":["Rivera, Cody Jackson"],"dc:date":["2024-05-02","2024-05"],"dc:description":["We propose a novel mechanism of defining data structures using intrinsic definitions that avoids recursion and instead utilizes monadic maps satisfying local conditions. We show that intrinsic definitions are a powerful mechanism that can capture a variety of data structures naturally. We show that they also enable a predictable verification methodology that allows engineers to write ghost code to update monadic maps and perform verification using reduction to decidable logics. We evaluate our methodology using Boogie and prove a suite of data structure manipulating programs correct.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-09-16 without embargo terms","The student, Cody Rivera, accepted the attached license on 2024-05-02 at 08:59.","The student, Cody Rivera, submitted this Thesis for approval on 2024-05-02 at 09:07.","This Thesis was approved for publication on 2024-05-02 at 11:42.","DSpace SAF Submission Ingestion Package generated from Vireo submission #20753 on 2024-09-16 at 00:37:52"],"dc:format":["application/pdf"],"dc:identifier":["https://hdl.handle.net/2142/124461"],"dc:language":["eng","en"],"dc:rights":["Copyright 2024 Cody Rivera"],"dc:subject":["Software Verification","Automated Reasoning","Predictable Verification","Intrinsic Definitions","Verification Of Linked Data Structures","Decidability","Ghost-code Annotations"],"dc:title":["Predictable verification using intrinsic definitions"],"dc:type":["Text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:00Z"}