Publication:4993342
From MaRDI portal
DOI10.4230/LIPIcs.FSCD.2018.16zbMath1462.68096MaRDI QIDQ4993342
Publication date: 15 June 2021
completeness; tree automata; term rewriting systems; regularity preservation; tree automata completion; over-approximation
68Q45: Formal languages and automata
68N18: Functional programming and lambda calculus
68Q42: Grammars and rewriting systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reachability analysis over term rewriting systems
- Termination criteria for tree automata completion
- Equational approximations for tree automata completion
- Automata-Based Abstraction for Automated Verification of Higher-Order Tree-Processing Programs
- HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA
- Efficient ground completion
- Decidable approximations of term rewriting systems
- Reachability Analysis with State-Compatible Automata
- Verifying higher-order functional programs with pattern-matching algebraic data types
- Rewriting Approximations for Fast Prototyping of Static Analyzers
- Term Rewriting and Applications
- Computer Aided Verification
- Rewriting Techniques and Applications