Constrained Term Rewriting tooL

DOI10.1007/978-3-662-48899-7_38zbMath1471.68110OpenAlexW2295119103MaRDI QIDQ3460083

Cynthia Kop, Naoki Nishida

Publication date: 12 January 2016

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48899-7_38

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items

Verifying Procedural Programs via Constrained Rewriting Induction ⋮ Automatically proving termination and memory safety for programs with pointer arithmetic ⋮ Loop detection by logically constrained term rewriting ⋮ From Jinja bytecode to term rewriting: a complexity reflecting transformation ⋮ Unnamed Item ⋮ Proving Termination Through Conditional Termination ⋮ Extended Nested Dual System Groups, Revisited ⋮ Ctrl ⋮ Runtime complexity analysis of logically constrained rewriting