Counterexample validation and interpolation-based refinement for forest automata
From MaRDI portal
Publication:2961572
Recommendations
Cites work
- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
- Abstract regular tree model checking
- Accurate invariant checking for programs manipulating lists and arrays with infinite data
- Automatic numeric abstractions for heap-manipulating programs
- Computer Aided Verification
- Counterexample validation and interpolation-based refinement for forest automata
- Counterexample-guided focus
- Forest automata for verification of heap manipulation
- Interpolation and SAT-based model checking.
- Lazy Abstraction with Interpolants
- Loop invariant synthesis in a combined abstract domain
- Programs with lists are counter automata
- Scalable Shape Analysis for Systems Code
- Spatial interpolants
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Verification of heap manipulating programs with ordered data by extended forest automata
Cited in
(2)
This page was built for publication: Counterexample validation and interpolation-based refinement for forest automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961572)