Compositional shape analysis by means of bi-abduction
Authors:
Open Access
- 21 January 2009
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 289-300
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- Monotonic Abstraction for Programs with Dynamic Memory HeapsLecture Notes in Computer Science, 2008
- Scalable Shape Analysis for Systems CodeLecture Notes in Computer Science, 2007
- Heap Assumptions on DemandLecture Notes in Computer Science, 2007
- Abstract Regular Tree Model Checking of Complex Dynamic Data StructuresLecture Notes in Computer Science, 2006
- Symbolic Execution with Separation Logic2005
- Shape Analysis by Predicate Abstraction2005
- Interprocedural Shape Analysis for Cutpoint-Free ProgramsLecture Notes in Computer Science, 2005
- Boolean Heaps2005
- Solving shape-analysis problems in languages with destructive updatingACM Transactions on Programming Languages and Systems, 1998
- Abductive Logic ProgrammingJournal of Logic and Computation, 1992