I'm looking at doing some verification work where I've got regular tree grammars as an underlying theory.
Z3 lets you define your own stuff with uninterpreted functions, but that doesn't tend to work well any time your decision procedures are recursive. They used to allow for plugins but that has been depricated, I think.
I'm wondering, does anybody have a recommendation of a decent SMT solver that allows you to write decision procedures for custom theories?