Predictable verification using intrinsic definitions
Rivera, Cody Jackson
Loading…
Permalink
https://hdl.handle.net/2142/124461
Description
Title
Predictable verification using intrinsic definitions
Author(s)
Rivera, Cody Jackson
Issue Date
2024-05-02
Director of Research (if dissertation) or Advisor (if thesis)
Parthasarathy, Madhusudan
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
M.S.
Degree Level
Thesis
Keyword(s)
Software Verification
Automated Reasoning
Predictable Verification
Intrinsic Definitions
Verification of Linked Data Structures
Decidability
Ghost-Code Annotations
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.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
