A Logic-Based Framework for Reasoning about Composite Data Structures
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 178-195
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- What Else Is Decidable about Integer Arrays?2008
- Shape Analysis of Single-Parent Heaps2007
- A logic of reachable patterns in linked data-structuresThe Journal of Logic and Algebraic Programming, 2007
- Shape Analysis for Composite Data Structures2007
- Rewriting Systems with Data2007
- Abstract Regular Tree Model Checking of Complex Dynamic Data StructuresLecture Notes in Computer Science, 2006
- What’s Decidable About Arrays?2005
- A Decidable Fragment of Separation Logic2004
- Parametric shape analysis via 3-valued logicACM Transactions on Programming Languages and Systems, 2002
- A survey and annotated bibliography of multiobjective combinatorial optimizationOR Spectrum, 2000