scientific article

zbMath1273.68221MaRDI QIDQ2852015

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Second-Order Finite Automata, Verification of heap manipulating programs with ordered data by extended forest automata, Model Checking Parameterized Systems, Second-order finite automata, Anti-unification in Constraint Logic Programming, Counterexample Validation and Interpolation-Based Refinement for Forest Automata, Forest automata for verification of heap manipulation, Fair Termination for Parameterized Probabilistic Concurrent Systems, A theoretical limit for safety verification techniques with regular fix-point computations, A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata, Equational approximations for tree automata completion, Computing Simulations over Tree Automata, Deterministic bottom-up tree transducers and ground term rewrite systems, Automata-Based Termination Proofs, Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems, Handling Left-Quadratic Rules When Completing Tree Automata