Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems

DOI10.1007/978-3-319-44802-2_4zbMath1366.68107OpenAlexW2511860604MaRDI QIDQ2827837

Vivien Pelletier, Pierre Réty, Yohan Boichut

Publication date: 21 October 2016

Published in: Rewriting Logic and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44802-2_4

zbMATH Keywords

reachability analysisterm rewritingtree languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

Towards more precise rewriting approximations

Cites Work

• Tree tuple languages from the logic programming point of view
• A theoretical limit for safety verification techniques with regular fix-point computations
• Finer Is Better: Abstraction Refinement for Rewriting Approximations
• Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars
• Rewriting Techniques and Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems