Pages that link to "Item:Q2996202"
From MaRDI portal
The following pages link to Reachability Analysis of Term Rewriting Systems with Timbuk (Q2996202):
Displaying 12 items.
- Symbol different term rewrite systems (Q492918) (← links)
- Reachability analysis over term rewriting systems (Q556686) (← links)
- Descendants of a recognizable tree language for sets of linear monadic term rewrite rules (Q845695) (← links)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- Equational approximations for tree automata completion (Q968530) (← links)
- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy (Q1637228) (← links)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- A logic of reachable patterns in linked data-structures (Q2643337) (← links)
- Narrowing and Rewriting Logic: from Foundations to Applications (Q2873786) (← links)
- Reachability in Conditional Term Rewriting Systems (Q4916227) (← links)
- Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism (Q5179049) (← links)
- Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting (Q6052950) (← links)
