Pages that link to "Item:Q3613378"
From MaRDI portal
The following pages link to Abstract Regular Tree Model Checking of Complex Dynamic Data Structures (Q3613378):
Displayed 22 items.
- Programs with lists are counter automata (Q537953) (← links)
- Juggrnaut: using graph grammars for abstracting unbounded heap structures (Q746781) (← links)
- Model checking dynamic memory allocation in operating systems (Q835783) (← links)
- Automata-based verification of programs with tree updates (Q845236) (← links)
- Equational approximations for tree automata completion (Q968530) (← links)
- Approximated parameterized verification of infinite-state processes with global conditions (Q1039841) (← links)
- Verify heaps via unified model checking (Q1986561) (← links)
- Forest automata for verification of heap manipulation (Q2441715) (← links)
- A Game Theoretic Approach to the Analysis of Dynamic Networks (Q2864354) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- Counterexample Validation and Interpolation-Based Refinement for Forest Automata (Q2961572) (← links)
- Controlled Term Rewriting (Q3172893) (← links)
- A Logic-Based Framework for Reasoning about Composite Data Structures (Q3184673) (← links)
- Bottom-Up Shape Analysis (Q3392926) (← links)
- Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies (Q3454088) (← links)
- Monotonic Abstraction for Programs with Dynamic Memory Heaps (Q3512503) (← links)
- Abstracting Complex Data Structures by Hyperedge Replacement (Q3540389) (← links)
- Automata-Based Termination Proofs (Q3637353) (← links)
- Handling Left-Quadratic Rules When Completing Tree Automata (Q4982086) (← links)
- Verifying Multithreaded Recursive Programs with Integer Variables (Q5179057) (← links)
- An Efficient Decision Procedure for Imperative Tree Data Structures (Q5200043) (← links)
- Computing Simulations over Tree Automata (Q5458323) (← links)