Gradual Verification of Recursive Heap Data Structures
| Autor: | Jenna Wise, Joshua Sunshine, Jonathan Aldrich, Cameron Wong, Éric Tanter, Johannes Bader |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
Static checking
recursive predicates Programming language Computer science separation logic Assertion Separation logic computer.software_genre Data structure gradual verification implicit dynamic frames Safety Risk Reliability and Quality Engineering design process computer Software Heap (data structure) |
| DOI: | 10.5281/zenodo.4085932 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|