Towards more precise rewriting approximations

DOI10.1007/978-3-319-15579-1_51MaRDI QIDQ2799215zbMATH OpenOpenAlexFDO

Authors Jacques Chabin, Pierre Réty, Yohan Boichut

Publication date 8 April 2016

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-15579-1_51

zbMATH Keywords

logic programmingreachabilityterm rewritingtree languages

Mathematics Subject Classification ID

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

Recommendations

• Towards more precise rewriting approximations
• Over-approximating descendants by synchronized tree languages
• Synchronized tree languages for reachability in non-right-linear term rewrite systems
• Finer Is Better: Abstraction Refinement for Rewriting Approximations
• Equational approximations for tree automata completion

Cited in

(6)

• Multiple context-free tree grammars: lexicalization and characterization
• Towards more precise rewriting approximations
• Synchronized tree languages for reachability in non-right-linear term rewrite systems
• Rewriting approximations for properties verification over CCS specifications
• Over-approximating descendants by synchronized tree languages
• A new idea on the interval-symbol method with correct zero rewriting for reducing exact computations

This page was built for publication: Towards more precise rewriting approximations

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