Compositional Invariant Checking for Overlaid and Nested Linked Lists
Abstract elided by the publisher.
Related papers
- Maintaining Doubly-Linked List Invariants in Shape Analysis with Local Reasoning VMCAI 2007
- Verifying Reachability Invariants of Linked Structures POPL 1983
- Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs ESOP 2015
- Checking Cleanness in Linked Lists SAS 2000
- Compositional Shape Analysis with Shared Abduction and Biabductive Loop Acceleration ESOP 2025
- Verifying properties of well-founded linked lists POPL 2006
- A more pragmatic implementation of the lock-free, ordered, linked list PPoPP 2021
- From Fast Exponentiation to Square Matrices: An Adventure in Types ICFP 1999