Invariant Synthesis for Programs Manipulating Lists with Unbounded Data
No abstract available.
Related papers
- Natural synthesis of provably-correct data-structure manipulations OOPSLA 2017
- Sound and Complete Invariant-Based Heap Encodings OOPSLA 2026
- Synthesis modulo recursive functions OOPSLA 2013
- Arithmetizing Shape Analysis CAV 2025
- Verifying safety properties of concurrent heap-manipulating programs TOPLAS 2010
- Cyclic program synthesis PLDI 2021
- Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs ESOP 2015
- Shape analysis with inductive recursion synthesis PLDI 2007