Gradual verification of recursive heap data structures

7Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Current static verification techniques do not provide good support for incrementality, making it difficult for developers to focus on specifying and verifying the properties and components that are most important. Dynamic verification approaches support incrementality, but cannot provide static guarantees. To bridge this gap, prior work proposed gradual verification, which supports incrementality by allowing every assertion to be complete, partial, or omitted, and provides sound verification that smoothly scales from dynamic to static checking. The prior approach to gradual verification, however, was limited to programs without recursive data structures. This paper extends gradual verification to programs that manipulate recursive, mutable data structures on the heap. We address several technical challenges, such as semantically connecting iso-and equi-recursive interpretations of abstract predicates, and supporting gradual verification of heap ownership. This work thus lays the foundation for future tools that work on realistic programs and support verification within an engineering process in which cost-benefit trade-offs can be made.

Cite

CITATION STYLE

APA

Wise, J., Bader, J., Wong, C., Aldrich, J., Tanter, É., & Sunshine, J. (2020). Gradual verification of recursive heap data structures. Proceedings of the ACM on Programming Languages, 4(OOPSLA). https://doi.org/10.1145/3428296

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free