13 citations · 27 across the 9 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
cs.LO2008★ 7 cited
Automated Induction for Complex Data Structures
Adel Bouhoula, Florent Jacquemard
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int…
cs.LO2008★ 13 cited
Visibly Tree Automata with Memory and Constraints
Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin
Tree automata with one memory have been introduced in 2001. They generalize both pushdown (word) automata and the tree automata with constraints of equality between brothers of Bog…