The following pages link to (Q4993362):
Displaying 4 items.
- Runtime complexity analysis of logically constrained rewriting (Q2119101) (← links)
- Extending Maximal Completion (Invited Talk) (Q5089002) (← links)
- Operationally-based program equivalence proofs using LCTRSs (Q6052946) (← links)
- Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting (Q6052950) (← links)
