Automatic Termination Proofs for Programs with Shape-Shifting Heaps
No abstract available.
Related papers
- Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs ESOP 2015
- 2LS: Memory Safety and Non-termination - (Competition Contribution) TACAS 2018
- Automatic cyclic termination proofs for recursive procedures in separation logic CPP 2017
- Recursive proofs for inductive tree data-structures POPL 2012
- Arithmetizing Shape Analysis CAV 2025
- Thread-modular shape analysis PLDI 2007
- Dynamic shape analysis via degree metrics ISMM 2009
- Termination proofs for systems code PLDI 2006