Constrained term rewriting tooL

DOI10.1007/978-3-662-48899-7_38MaRDI QIDQ3460083zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Controlled term rewriting
• CSI -- a confluence tool
• CoLL: a confluence tool for left-linear term rewrite systems
• Term Rewriting with Logical Constraints
• Proving termination properties with \textsc{mu-term}

Cited in

(16)

• Transforming imperative programs into bisimilar logically constrained term rewrite systems via injective functions from configurations to terms
• Term Rewriting with Logical Constraints
• Loop detection by logically constrained term rewriting
• A nesting-preserving transformation of SIMP programs into logically constrained term rewrite systems
• Verifying procedural programs via constrained rewriting induction
• Proving termination through conditional termination
• Runtime complexity analysis of logically constrained rewriting
• From Jinja bytecode to term rewriting: a complexity reflecting transformation
• Controlled term rewriting
• Ctrl
• Difference of constrained patterns in logically constrained term rewrite systems
• Automatically proving termination and memory safety for programs with pointer arithmetic
• Termination of generalized term rewriting systems
• Confluence Criteria for Logically Constrained Rewrite Systems
• Extended Nested Dual System Groups, Revisited
• Completion for logically constrained rewriting

This page was built for publication: Constrained term rewriting tooL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460083)