swMATH13874MaRDI QIDQ25785FDOQ25785
Author name not available (Why is that?)
Official website: http://rd.springer.com/chapter/10.1007%2F978-3-662-48899-7_38
Cited In (13)
- Proving termination through conditional termination
- Runtime complexity analysis of logically constrained rewriting
- From Jinja bytecode to term rewriting: a complexity reflecting transformation
- ARMC
- Slothrop
- KITTeL
- TiML
- Jinja Threads
- AGES
- Automatically proving termination and memory safety for programs with pointer arithmetic
- TcT
- Rewriting modulo SMT and open system analysis
- Completion for logically constrained rewriting
This page was built for software: Ctrl
