Counterexample Validation and Interpolation-Based Refinement for Forest Automata
From MaRDI portal
Publication:2961572
DOI10.1007/978-3-319-52234-0_16zbMath1484.68103OpenAlexW2570552138MaRDI QIDQ2961572
Martin Hruška, Adam Rogalewicz, Tomáš Vojnar, Ondřej Lengál, Lukáš Holík
Publication date: 21 February 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-52234-0_16
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (1)
Cites Work
- Unnamed Item
- Verification of heap manipulating programs with ordered data by extended forest automata
- Programs with lists are counter automata
- Loop invariant synthesis in a combined abstract domain
- Forest automata for verification of heap manipulation
- Spatial Interpolants
- Counterexample Validation and Interpolation-Based Refinement for Forest Automata
- Scalable Shape Analysis for Systems Code
- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
- Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data
- Automatic numeric abstractions for heap-manipulating programs
- Counterexample-guided focus
- Tools and Algorithms for the Construction and Analysis of Systems
- Computer Aided Verification
- Lazy Abstraction with Interpolants
- Tools and Algorithms for the Construction and Analysis of Systems
- Computer Aided Verification
This page was built for publication: Counterexample Validation and Interpolation-Based Refinement for Forest Automata
