13 citations · 27 across the 9 of their papers we have counts for
4 papers · 1 filter
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
Luis Barguñó, Carles Creus, Guillem Godoy +2
We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequ…
Rewrite based Verification of XML Updates
Florent Jacquemard, Michael Rusinowitch
We consider problems of access control for update of XML documents. In the context of XML programming, types can be viewed as hedge automata, and static type checking amounts to ve…
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…
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…