Abstract regular tree model checking
From MaRDI portal
Publication:2852015
Recommendations
Cited in
(22)- Parameterized verification under TSO with data types
- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
- Deterministic bottom-up tree transducers and ground term rewrite systems
- Forest automata for verification of heap manipulation
- Computing Simulations over Tree Automata
- A uniform (bi-)simulation-based framework for reducing tree automata
- Model checking parameterized systems
- Second-order finite automata
- Counterexample validation and interpolation-based refinement for forest automata
- Computer Aided Verification
- Equational approximations for tree automata completion
- Approximation-based tree regular model-checking
- scientific article; zbMATH DE number 1903380 (Why is no real title available?)
- Synchronized tree languages for reachability in non-right-linear term rewrite systems
- A theoretical limit for safety verification techniques with regular fix-point computations
- Tree regular model checking: a simulation-based approach
- Handling left-quadratic rules when completing tree automata
- Automata-Based Termination Proofs
- Anti-unification in constraint logic programming
- Fair termination for parameterized probabilistic concurrent systems
- Second-Order Finite Automata
- Verification of heap manipulating programs with ordered data by extended forest automata
This page was built for publication: Abstract regular tree model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2852015)