Generating Representation Invariants of Structurally Complex Data
Abstract elided by the publisher.
Related papers
- Builtin Types Viewed as Inductive Families ESOP 2023
- A HAT Trick: Automatically Verifying Representation Invariants using Symbolic Finite Automata PLDI 2024
- Go with the flow: compositional abstractions for concurrent data structures POPL 2018
- Beyond the elementary representations of program invariants over algebraic data types PLDI 2021
- TiML: a functional language for practical complexity analysis with invariants OOPSLA 2017
- Type-based data structure verification PLDI 2009
- A relational framework for higher-order shape analysis ICFP 2014
- Rooting for Efficiency: Mechanised Reasoning about Array-Based Trees in Separation Logic CPP 2024