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

Logic in computer science (03B70) Grammars and rewriting systems (68Q42) 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)

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

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)