Fully Automated Shape Analysis Based on Forest Automata
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 740-755
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Fully Automated Shape Analysis Based on Forest Automata2013
- Abstract regular (tree) model checkingInternational Journal on Software Tools for Technology Transfer, 2011
- Program Analysis for Overlaid Data Structures2011
- Forest Automata for Verification of Heap Manipulation2011
- Predator: A Practical Tool for Checking Manipulation of Dynamic Data Structures Using Separation LogicLecture Notes in Computer Science, 2011
- SLAyer: Memory Safety for Systems-Level Code2011
- Juggrnaut: Graph Grammar Abstraction for Unbounded Heap StructuresElectronic Notes in Theoretical Computer Science, 2010
- Automatic numeric abstractions for heap-manipulating programs2010
- Shape Analysis with Structural Invariant CheckersLecture Notes in Computer Science, 2007
- Shape analysis with inductive recursion synthesis2007