Pages that link to "Item:Q2441715"
From MaRDI portal
The following pages link to Forest automata for verification of heap manipulation (Q2441715):
Displaying 13 items.
- Verification of heap manipulating programs with ordered data by extended forest automata (Q300414) (← links)
- Verification of multi-linked heaps (Q439948) (← links)
- Juggrnaut: using graph grammars for abstracting unbounded heap structures (Q746781) (← links)
- Nested antichains for WS1S (Q1733101) (← links)
- Verify heaps via unified model checking (Q1986561) (← links)
- Forest automata for verification of heap manipulation (Q2441715) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- Counterexample Validation and Interpolation-Based Refinement for Forest Automata (Q2961572) (← links)
- Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic (Q2988661) (← links)
- Minimization of Visibly Pushdown Automata Using Partial Max-SAT (Q3303909) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703767) (← links)
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure (Q5918382) (← links)
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure (Q5919501) (← links)