Ctrl

swMATH13874MaRDI QIDQ25785FDOQ25785

Author name not available (Why is that?)

Described by source

• Constrained term rewriting tooL

Cited In (6)

• Proving termination through conditional termination
• Runtime complexity analysis of logically constrained rewriting
• From Jinja bytecode to term rewriting: a complexity reflecting transformation
• Automatically proving termination and memory safety for programs with pointer arithmetic
• Rewriting modulo SMT and open system analysis
• Completion for logically constrained rewriting

This page was built for software: Ctrl