Equational approximations for tree automata completion

DOI10.1016/j.jsc.2010.01.009zbMath1192.68398OpenAlexW1986138153MaRDI QIDQ968530

Vlad Rusu, Thomas Genet

Publication date: 5 May 2010

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2010.01.009

zbMATH Keywords

verificationreachabilitytree automataterm rewriting systemsrewriting modulo equations

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items (6)

Unnamed Item ⋮ Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting ⋮ Unnamed Item ⋮ Towards more precise rewriting approximations ⋮ Equational approximations for tree automata completion ⋮ Termination criteria for tree automata completion

Uses Software

• Maude
• Timbuk

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reachability analysis over term rewriting systems
• Flow analysis of lazy higher-order functional programs
• Equational approximations for tree automata completion
• Tree regular model checking: a simulation-based approach
• Reachability Analysis of Term Rewriting Systems with Timbuk
• Closure of Hedge-Automata Languages by Hedge Rewriting
• Tree Pattern Rewriting Systems
• Certifying a Tree Automata Completion Checker
• Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
• Rewriting Approximations for Fast Prototyping of Static Analyzers
• Towards an Efficient Implementation of Tree Automata Completion
• Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation
• Term Rewriting and Applications
• Automated Deduction – CADE-19
• Rewriting Techniques and Applications

This page was built for publication: Equational approximations for tree automata completion