Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
From MaRDI portal
Recommendations
- Abstract regular tree model checking
- Approximation-based tree regular model-checking
- Tree regular model checking: a simulation-based approach
- scientific article; zbMATH DE number 1903380
- Verification of tree-processing programs via higher-order model checking
- Model Checking on Trees with Path Equivalences
- FO Model Checking on Nested Pushdown Trees
- Tree-decompositions and the model-checking problem
- scientific article; zbMATH DE number 2155183
Cited in
(29)- Computing Simulations over Tree Automata
- Verify heaps via unified model checking
- Bottom-Up Shape Analysis
- Model checking dynamic memory allocation in operating systems
- An efficient decision procedure for imperative tree data structures
- Automata-based verification of programs with tree updates
- Counterexample validation and interpolation-based refinement for forest automata
- Automata-Based Termination Proofs
- Verification of heap manipulating programs with ordered data by extended forest automata
- Verification of heap manipulating programs with ordered data by extended forest automata
- Automated formal analysis and verification: an overview
- Handling left-quadratic rules when completing tree automata
- Programs with lists are counter automata
- scientific article; zbMATH DE number 1629942 (Why is no real title available?)
- Term rewriting with prefix context constraints and bottom-up strategies
- Abstracting Complex Data Structures by Hyperedge Replacement
- Equational approximations for tree automata completion
- scientific article; zbMATH DE number 1617320 (Why is no real title available?)
- Pattern-based verification of programs with extended linear linked data structures
- Controlled term rewriting
- A game theoretic approach to the analysis of dynamic networks
- Tools and Algorithms for the Construction and Analysis of Systems
- Juggrnaut: using graph grammars for abstracting unbounded heap structures
- Verifying multithreaded recursive programs with integer variables
- Monotonic Abstraction for Programs with Dynamic Memory Heaps
- Tools and Algorithms for the Construction and Analysis of Systems
- Forest automata for verification of heap manipulation
- Approximated parameterized verification of infinite-state processes with global conditions
- A Logic-Based Framework for Reasoning about Composite Data Structures
This page was built for publication: Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613378)
