Verifying programs with dynamic 1-selector-linked structures in regular model checking
From MaRDI portal
Recommendations
- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
- Programs with Lists Are Counter Automata
- Pattern-based verification of programs with extended linear linked data structures
- Generalised multi-pattern-based verification of programs with linear linked structures
- Forest automata for verification of heap manipulation
Cited in
(16)- Computable fixpoints in well-structured symbolic model checking
- Forest automata for verification of heap manipulation
- Tree regular model checking: a simulation-based approach
- Generalised multi-pattern-based verification of programs with linear linked structures
- A logic of reachable patterns in linked data-structures
- Pattern-based verification of programs with extended linear linked data structures
- Counterexample validation and interpolation-based refinement for forest automata
- Bottom-Up Shape Analysis
- Monotonic Abstraction for Programs with Dynamic Memory Heaps
- On the Almighty Wand
- Simulating reachability using first-order logic with applications to verification of linked data structures
- On the almighty wand
- Verification via structure simulation
- Programs with lists are counter automata
- Programs with Lists Are Counter Automata
- Model checking dynamic memory allocation in operating systems
This page was built for publication: Verifying programs with dynamic 1-selector-linked structures in regular model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703767)