A Decidable Logic for Describing Linked Data Structures
No abstract available.
Related papers
- Predicate Abstraction for Linked Data Structures VMCAI 2016
- A Decidable Logic for Tree Data-Structures with Measurements VMCAI 2019
- Synthesizing iterators from abstraction functions GPCE 2012
- Graph Types POPL 1993
- Decidable logics combining heap structures and data POPL 2011
- On the simplicity of synthesizing linked data structure operations GPCE 2013
- Verification of semantic commutativity conditions and inverse operations on linked data structures PLDI 2011
- Full functional verification of linked data structures PLDI 2008