Ground approximations of term rewriting systems

DOI10.1016/J.TCS.2026.115997MaRDI QIDQ7266652zbMATH OpenFDO

Authors Sándor Vágvölgyi

Publication date 15 June 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.115997

zbMATH Keywords

bottom-up tree automatonextended ground term rewriting systemground approximation of a term rewriting system by a term rewriting systemground term rewriting systemterm rewriting system

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
• Decidability for left-linear growing term rewriting systems.
• Decidable approximations of term rewriting systems
• Decidable call-by-need computations in term rewriting
• Derivation trees of ground term rewriting systems.
• Finer Is Better: Abstraction Refinement for Rewriting Approximations
• Handling Algebraic Properties in Automatic Analysis of Security Protocols
• scientific article; zbMATH DE number 1615242 (Why is no real title available?)
• scientific article; zbMATH DE number 3854429 (Why is no real title available?)
• scientific article; zbMATH DE number 19765 (Why is no real title available?)
• scientific article; zbMATH DE number 599028 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• New Undecidability Results for Properties of Term Rewrite Systems
• NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
• Polynomial time termination and constraint satisfaction tests
• Reachability analysis over term rewriting systems
• Reachability and confluence are undecidable for flat term rewriting systems
• Reachability, confluence, and termination analysis with state-compatible automata
• Rewriting Approximations for Fast Prototyping of Static Analyzers
• Symbol different term rewrite systems
• Synchronized tree languages for reachability in non-right-linear term rewrite systems
• Term rewriting restricted to ground terms.
• Towards more precise rewriting approximations

This page was built for publication: Ground approximations of term rewriting systems

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