Symbol different term rewrite systems

DOI10.1016/j.jlamp.2015.06.005zbMath1332.68105OpenAlexW1100208954MaRDI QIDQ492918

Sándor Vágvölgyi

Publication date: 21 August 2015

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2015.06.005

zbMATH Keywords

tree automatonground reachabilityground tree transducerground word problemterm-rewriting system

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Word problems, etc. in computability and recursion theory (03D40)

Uses Software

• Timbuk

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reachability analysis over term rewriting systems
• A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
• On tree automata that certify termination of left-linear term rewriting systems
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• A fast algorithm for constructing a tree automaton recognizing a congruential tree language
• Term rewriting restricted to ground terms.
• Restricted ground tree transducers
• Decidable call-by-need computations in term rewriting
• Derivation trees of ground term rewriting systems.
• Reachability Analysis of Term Rewriting Systems with Timbuk
• Congruences Generated by Extended Ground Term Rewrite Systems
• Implementing term rewriting by jungle evaluation
• Finer Is Better: Abstraction Refinement for Rewriting Approximations
• Handling Algebraic Properties in Automatic Analysis of Security Protocols
• Variations on the Common Subexpression Problem
• Left-linear Bounded TRSs are Inverse Recognizability Preserving
• Rewriting Approximations for Fast Prototyping of Static Analyzers