Cited in
(13)- Completion for logically constrained rewriting
- Proving termination through conditional termination
- Rewriting modulo SMT and open system analysis
- Automatically proving termination and memory safety for programs with pointer arithmetic
- ARMC
- Slothrop
- KITTeL
- TiML
- Jinja Threads
- AGES
- TcT
- From Jinja bytecode to term rewriting: a complexity reflecting transformation
- Runtime complexity analysis of logically constrained rewriting
This page was built for software: Ctrl
