Reachability Analysis for Termination and Confluence of Rewriting

DOI10.1007/978-3-030-17462-0_15MaRDI QIDQ6091333zbMATH OpenFDO

Authors Christian Sternagel, Akihisa Yamada

Publication date 24 November 2023

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-17462-0_15

zbMATH Keywords

conditional term rewritingconfluenceinfeasibilityreachability analysistermination

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Reachability analysis over term rewriting systems
• Reachability in conditional term rewriting systems
• Characterizing conclusive approximations by logical formulae
• Reachability, confluence, and termination analysis with state-compatible automata
• Complete symbolic reachability analysis using back-and-forth narrowing

Cited in

(9)

• Reachability-based acyclicity analysis by abstract interpretation
• Term orderings for non-reachability of (conditional) rewriting
• Automatically Proving and Disproving Feasibility Conditions
• Reachability analysis over term rewriting systems
• Certifying the weighted path order (invited talk)
• Small term reachability and related problems for terminating term rewriting systems
• An Iabelle/HOL formalization of narrowing and multiset narrowing for E-unifiability, reachability and infeasibility
• A distribution semantics for probabilistic term rewriting
• Correctness of static flow analysis in continuation semantics

This page was built for publication: Reachability Analysis for Termination and Confluence of Rewriting

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