Tree Automata with Equality Constraints Modulo Equational Theories
From MaRDI portal
Recommendations
Cited in
(18)- Tree automata with equality constraints modulo equational theories
- Tree automata, (dis-)equality constraints and term rewriting. What's new?
- Protocol Verification Via Rigid/Flexible Resolution
- Languages Modulo Normalization
- Propositional Tree Automata
- Tree Automata with Global Constraints
- Superposition for Fixed Domains
- TAGED Approximations for Temporal Properties Model-Checking
- scientific article; zbMATH DE number 1136085 (Why is no real title available?)
- scientific article; zbMATH DE number 2043529 (Why is no real title available?)
- scientific article; zbMATH DE number 1512627 (Why is no real title available?)
- scientific article; zbMATH DE number 2150281 (Why is no real title available?)
- scientific article; zbMATH DE number 1841842 (Why is no real title available?)
- Harald Ganzinger's legacy: contributions to logics and programming
- Encompassment properties and automata with constraints
- Equality and disequality constraints on direct subterms in tree automata
- Tree automata-based refinement with application to Horn clause verification
- Rigid tree automata and applications
This page was built for publication: Tree Automata with Equality Constraints Modulo Equational Theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613434)