Certifying a Tree Automata Completion Checker

DOI10.1007/978-3-540-71070-7_43zbMath1165.68400OpenAlexW1801431769MaRDI QIDQ3541727

No author found.

Publication date: 27 November 2008

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71070-7_43

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Reachability, confluence, and termination analysis with state-compatible automata, Equational approximations for tree automata completion, Termination criteria for tree automata completion

Uses Software

• Coq
• AVISPA