Forester: From Heap Shapes to Automata Predicates
- 31 March 2017
- book chapter
- Published by Springer Nature
- p. 365-369
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Counterexample Validation and Interpolation-Based Refinement for Forest Automata2017
- Run Forester, Run Backwards!2016
- Fully Automated Shape Analysis Based on Forest Automata2013
- Forest automata for verification of heap manipulationFormal Methods in System Design, 2012
- An Easy to Use Infrastructure for Building Static Analysis ToolsLecture Notes in Computer Science, 2012
- VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata2012
- Abstract regular (tree) model checkingInternational Journal on Software Tools for Technology Transfer, 2011
- Counterexample-Guided Abstraction Refinement2000