Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists
Abstract elided by the publisher.
Related papers
- Fragment Abstraction for Concurrent Shape Analysis ESOP 2018
- Verifying properties of well-founded linked lists POPL 2006
- Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists SAS 2013
- On inter-procedural analysis of programs with lists and data PLDI 2011
- Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs ESOP 2015
- A more pragmatic implementation of the lock-free, ordered, linked list PPoPP 2021
- Verifying Reachability Invariants of Linked Structures POPL 1983
- Pushing the Information-Theoretic Limits of Random Access Lists: Traversing Cons Lists in (1 + 1/๐ ) โlg ๐โ + ๐ + 9 Steps ICFP 2025