Abstract regular tree model checking
From MaRDI portal
Publication:2852015
zbMATH Open1273.68221MaRDI QIDQ2852015FDOQ2852015
Authors: Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomáš Vojnar 
Publication date: 7 October 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066106000521
Recommendations
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (22)
- Deterministic bottom-up tree transducers and ground term rewrite systems
- A theoretical limit for safety verification techniques with regular fix-point computations
- 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
- Handling left-quadratic rules when completing tree automata
- Second-order finite automata
- Approximation-based tree regular model-checking
- Tree regular model checking: a simulation-based approach
- Equational approximations for tree automata completion
- Parameterized verification under TSO with data types
- A uniform (bi-)simulation-based framework for reducing tree automata
- Model checking parameterized systems
- Anti-unification in constraint logic programming
- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
- Forest automata for verification of heap manipulation
- Synchronized tree languages for reachability in non-right-linear term rewrite systems
- Computer Aided Verification
- Second-Order Finite Automata
- Computing Simulations over Tree Automata
- Title not available (Why is that?)
- Fair termination for parameterized probabilistic concurrent systems
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)
