Forest Automata for Verification of Heap Manipulation
No abstract available.
Related papers
- Forester: From Heap Shapes to Automata Predicates - (Competition Contribution) TACAS 2017
- Deciding memory safety for single-pass heap-manipulating programs POPL 2020
- Fully Automated Shape Analysis Based on Forest Automata CAV 2013
- Counterexample Validation and Interpolation-Based Refinement for Forest Automata VMCAI 2017
- Forester: Shape Analysis Using Tree Automata - (Competition Contribution) TACAS 2015
- Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists SAS 2013
- Functional Correctness of C Implementations of Dijkstra's, Kruskal's, and Prim's Algorithms CAV 2021
- An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures VMCAI 2007