The following pages link to Thomas Genet (Q556684):
Displayed 13 items.
- Reachability analysis over term rewriting systems (Q556686) (← links)
- Termination criteria for tree automata completion (Q730470) (← links)
- Equational approximations for tree automata completion (Q968530) (← links)
- (Q2723425) (← links)
- Towards Static Analysis of Functional Programs Using Tree Automata Completion (Q2945135) (← links)
- (Q2980977) (← links)
- Reachability Analysis of Term Rewriting Systems with Timbuk (Q2996202) (← links)
- Feasible Trace Reconstruction for Rewriting Approximations (Q3527288) (← links)
- Reachability in Conditional Term Rewriting Systems (Q4916227) (← links)
- (Q4993342) (← links)
- (Q5277878) (← links)
- A Completion Algorithm for Lattice Tree Automata (Q5327489) (← links)
- Towards an Efficient Implementation of Tree Automata Completion (Q5505416) (← links)