Ctrl

swMATH13874MaRDI QIDQ25785FDOQ25785

Author name not available (Why is that?)

Described by source

• Constrained Term Rewriting tooL

Cited In (6)

• Rewriting Modulo SMT and Open System Analysis
• Runtime complexity analysis of logically constrained rewriting
• From Jinja bytecode to term rewriting: a complexity reflecting transformation
• Title not available (Why is that?)
• Proving Termination Through Conditional Termination
• Automatically proving termination and memory safety for programs with pointer arithmetic

This page was built for software: Ctrl