Effectively-Propositional Reasoning about Reachability in Linked Data Structures
No abstract available.
Related papers
- Modular reasoning about heap paths via effectively propositional formulas POPL 2014
- Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs ESOP 2015
- Concurrent Data Structures Linked in Time ECOOP 2017
- Predicate Abstraction for Linked Data Structures VMCAI 2016
- Separation Logic Modulo Theories APLAS 2013
- Verifying Reachability Invariants of Linked Structures POPL 1983
- Rooting for Efficiency: Mechanised Reasoning about Array-Based Trees in Separation Logic CPP 2024
- Verifying properties of well-founded linked lists POPL 2006