Abstract regular tree model checking
From MaRDI portal
Publication:2852015
zbMATH Open1273.68221MaRDI QIDQ2852015FDOQ2852015
Adam Rogalewicz, Peter Habermehl, Tomáš Vojnar, Ahmed Bouajjani
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 (20)
- Deterministic bottom-up tree transducers and ground term rewrite systems
- Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems
- A theoretical limit for safety verification techniques with regular fix-point computations
- Automata-Based Termination Proofs
- Fair Termination for Parameterized Probabilistic Concurrent Systems
- A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata
- Anti-unification in Constraint Logic Programming
- Verification of heap manipulating programs with ordered data by extended forest automata
- Second-order finite automata
- Equational approximations for tree automata completion
- Counterexample Validation and Interpolation-Based Refinement for Forest Automata
- Parameterized verification under TSO with data types
- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
- Forest automata for verification of heap manipulation
- Computer Aided Verification
- Second-Order Finite Automata
- Handling Left-Quadratic Rules When Completing Tree Automata
- Computing Simulations over Tree Automata
- Model Checking Parameterized Systems
- Title not available (Why is that?)
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)
