{"id":{"repo_id":"msu","oai_identifier":"oai:d.lib.msu.edu:etd_53216"},"canonical_url":"https://search.ndltd.org/etd/msu/oai:d.lib.msu.edu:etd_53216","repository":{"repo_id":"msu","name":"Michigan State University","base_url":"https://d.lib.msu.edu/oai"},"display":{"title":"Reasoning about Hyperproperties through Symbolic Decision Procedures","abstract":"Thesis (Ph.D.)--Michigan State University. Computer Science - Doctor of Philosophy, 2026","abstract_html":"Thesis (Ph.D.)--Michigan State University. Computer Science - Doctor of Philosophy, 2026","abstract_has_math":false,"creators":["Hsu, Tzu-Han"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Bonakdarpour, Borzoo","Cheng, Betty H. C.","Jian, Ren","Yan, Qiben","Kulkarni, Sandeep"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2026,"date_issued":"2026","date_published":"2026","updated_at":"2026-11-18T18:59:44Z","subjects":["Computer science"],"languages":["eng"],"rights":["In Copyright"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:53216","local:Hsu_grad.msu_0128D_22250"],"render_values":[{"text":"etd:53216","href":null,"code":true},{"text":"local:Hsu_grad.msu_0128D_22250","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/doi:10.25335/khqj-3t97","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/doi:10.25335/khqj-3t97","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://d.lib.msu.edu/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Ad.lib.msu.edu%3Aetd_53216","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Bonakdarpour, Borzoo","Cheng, Betty H. C.","Jian, Ren","Yan, Qiben","Kulkarni, Sandeep"]},{"key":"dc:creator","label":"Author","values":["Hsu, Tzu-Han"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2026"]},{"key":"dc:relation","label":"Dc Relation","values":["Electronic Theses & Dissertations"]},{"key":"dc:type","label":"Dc Type","values":["text","Electronic dissertations"]}]},{"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"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:53216","local:Hsu_grad.msu_0128D_22250","https://doi.org/doi:10.25335/khqj-3t97"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (Ph.D.)--Michigan State University. Computer Science - Doctor of Philosophy, 2026","Hyperproperties express logical relations across multiple execution traces, enabling the specification of critical requirements such as privacy, security, causality, linearizability, robustness, conformance, and optimization. Despite their expressive power, reasoning about hyperproperties remains challenging due to the complexity introduced by trace quantification. This thesis addresses this challenge through novel symbolic techniques guided by modern decision procedures, focusing on temporal logics tailored for hyperproperties.A key contribution of this thesis is the development of the tool HyperQB, a bounded model checking framework that leverages solvers for the satisfiability of quantified Boolean formulas (QBF) to achieve scalable hyperproperty verification. To verify programs with infinite behaviors (e.g., loops), we reduce unbounded lassos to finite simulations, enabling effective analysis of infinite execution traces. We further extend the framework to support asynchronous hyperproperties, allowing reasoning about traces that may stutter or advance at different speeds. Beyond verification, this thesis develops automated synthesis techniques for hyperproperties, including privacy-preserving mappings and program repair. We also present two enforcement methods: a gray-box hyperautomatabased technique, and an approach using symbolic execution and syntax-guided synthesis that enables runtime enforcement for C programs. The applicability and efficiency of our techniques are demonstrated through extensive empirical evaluations and a diverse set of case studies, highlighting their practicality in real-world settings.","Description based on online resource. Title from PDF t.p. (Michigan State University Fedora Repository, viewed ).","Includes bibliographical references."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf","1 online resource (298 p.) : ill."]},{"key":"dc:title","label":"Title","values":["Reasoning about Hyperproperties through Symbolic Decision Procedures"]}]}],"canonical_facts":{"dc:contributor":["Bonakdarpour, Borzoo","Cheng, Betty H. C.","Jian, Ren","Yan, Qiben","Kulkarni, Sandeep"],"dc:creator":["Hsu, Tzu-Han"],"dc:date":["2026"],"dc:description":["Thesis (Ph.D.)--Michigan State University. Computer Science - Doctor of Philosophy, 2026","Hyperproperties express logical relations across multiple execution traces, enabling the specification of critical requirements such as privacy, security, causality, linearizability, robustness, conformance, and optimization. Despite their expressive power, reasoning about hyperproperties remains challenging due to the complexity introduced by trace quantification. This thesis addresses this challenge through novel symbolic techniques guided by modern decision procedures, focusing on temporal logics tailored for hyperproperties.A key contribution of this thesis is the development of the tool HyperQB, a bounded model checking framework that leverages solvers for the satisfiability of quantified Boolean formulas (QBF) to achieve scalable hyperproperty verification. To verify programs with infinite behaviors (e.g., loops), we reduce unbounded lassos to finite simulations, enabling effective analysis of infinite execution traces. We further extend the framework to support asynchronous hyperproperties, allowing reasoning about traces that may stutter or advance at different speeds. Beyond verification, this thesis develops automated synthesis techniques for hyperproperties, including privacy-preserving mappings and program repair. We also present two enforcement methods: a gray-box hyperautomatabased technique, and an approach using symbolic execution and syntax-guided synthesis that enables runtime enforcement for C programs. The applicability and efficiency of our techniques are demonstrated through extensive empirical evaluations and a diverse set of case studies, highlighting their practicality in real-world settings.","Description based on online resource. Title from PDF t.p. (Michigan State University Fedora Repository, viewed ).","Includes bibliographical references."],"dc:format":["application/pdf","1 online resource (298 p.) : ill."],"dc:identifier":["etd:53216","local:Hsu_grad.msu_0128D_22250","https://doi.org/doi:10.25335/khqj-3t97"],"dc:language":["eng"],"dc:relation":["Electronic Theses & Dissertations"],"dc:rights":["In Copyright"],"dc:subject":["Computer science"],"dc:title":["Reasoning about Hyperproperties through Symbolic Decision Procedures"],"dc:type":["text","Electronic dissertations"]},"updated_at":"2026-11-18T18:59:44Z"}