3 citations · 7 across the 5 of their papers we have counts for
1 paper · 1 filter
Benoît Boyer, Thomas Genet
The tree automaton completion is an algorithm used for proving safety properties of systems that can be modeled by a term rewriting system. This representation and verification tec…