Pages that link to "Item:Q2852015"
From MaRDI portal
The following pages link to Abstract regular tree model checking (Q2852015):
Displaying 20 items.
- Verification of heap manipulating programs with ordered data by extended forest automata (Q300414) (← links)
- A theoretical limit for safety verification techniques with regular fix-point computations (Q963463) (← links)
- Equational approximations for tree automata completion (Q968530) (← links)
- Deterministic bottom-up tree transducers and ground term rewrite systems (Q1019744) (← links)
- Second-order finite automata (Q2158302) (← links)
- Forest automata for verification of heap manipulation (Q2441715) (← links)
- Tree regular model checking: a simulation-based approach (Q2500700) (← links)
- Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems (Q2827837) (← links)
- Counterexample Validation and Interpolation-Based Refinement for Forest Automata (Q2961572) (← links)
- Model Checking Parameterized Systems (Q3176379) (← links)
- Fair Termination for Parameterized Probabilistic Concurrent Systems (Q3303911) (← links)
- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures (Q3613378) (← links)
- Automata-Based Termination Proofs (Q3637353) (← links)
- Handling Left-Quadratic Rules When Completing Tree Automata (Q4982086) (← links)
- Second-Order Finite Automata (Q5042226) (← links)
- Anti-unification in Constraint Logic Programming (Q5108501) (← links)
- A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata (Q5170274) (← links)
- Computer Aided Verification (Q5312914) (← links)
- Computing Simulations over Tree Automata (Q5458323) (← links)
- Parameterized verification under TSO with data types (Q6535379) (← links)
