Camille Vacher

According to our database, Camille Vacher authored at least 5 papers between 2009 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2013

Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories

Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher

Log. Methods Comput. Sci., 2013

2011

Rigid tree automata and applications.

Florent Jacquemard, Francis Klay, Camille Vacher

Inf. Comput., 2011

2010

Tree automata with global constraints for the verification of security properties. (Automates d'arbres à contraintes globales pour la vérification de propriétés de sécurité).

Camille Vacher

PhD thesis, 2010

The Emptiness Problem for Tree Automata with Global Constraints.

Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009

Rigid Tree Automata.

Florent Jacquemard, Francis Klay, Camille Vacher

Proceedings of the Language and Automata Theory and Applications, 2009