SAT Solvers for Queries over Tree Automata with Constraints. - Pierre-Cyrille Héam; Vincent Hugot; Olga Kouchnarenko (ICST Workshops, 2010)

From Linear Temporal Logic Properties to Rewrite Propositions. - Pierre-Cyrille Héam; Vincent Hugot; Olga Kouchnarenko (IJCAR, 2012)

On Positive TAGED with a Bounded Number of Constraints. - Pierre-Cyrille Héam; Vincent Hugot; Olga Kouchnarenko (CIAA, 2012)

Loops and overloops for Tree-Walking Automata. - Pierre-Cyrille Héam; Vincent Hugot; Olga Kouchnarenko (Theor. Comput. Sci., 2012)

Tree automata, approximations, and constraints for verification : Tree (Not quite) regular model-checking. (Automates d'arbres, approximations et contraintes pour la vérification : Model-checking d'arbres (pas tout à fait) régulier). - Vincent Hugot (2013)

Deterministic Automata for Unordered Trees. - Adrien Boiret; Vincent Hugot; Joachim Niehren; Ralf Treinen (GandALF, 2014)

The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard. - Pierre-Cyrille Héam; Vincent Hugot; Olga Kouchnarenko (CoRR, 2014)

Logics for Unordered Trees with Data Constraints on Siblings. - Adrien Boiret; Vincent Hugot; Joachim Niehren; Ralf Treinen (LATA, 2015)

Equivalence of Symbolic Tree Transducers. - Vincent Hugot; Adrien Boiret; Joachim Niehren (DLT, 2017)

Automata for unordered trees. - Adrien Boiret; Vincent Hugot; Joachim Niehren; Ralf Treinen (Inf. Comput., 2017)

The emptiness problem for tree automata with at least one global disequality constraint is NP-hard. - Pierre-Cyrille Héam; Vincent Hugot; Olga Kouchnarenko (Inf. Process. Lett., 2017)

Logics for unordered trees with data constraints. - Adrien Boiret; Vincent Hugot; Joachim Niehren; Ralf Treinen (J. Comput. Syst. Sci., 2019)

A safe dynamic access control providing mandatory automotive cybersecurity. - Vincent Hugot; Adrien Jousse; Christian Toinard; Benjamin Venelle (CSCI, 2021)

SAT-Based Automated Completion for Reachability Analysis. - Yohan Boichut; Vincent Hugot; Adrien Boiret (CIAA, 2024)