{
"response":{"numFound":3,"start":0,"numFoundExact":true,"docs":[
{
"citationRef_s":"Other [cs.OH]. École normale supérieure de Cachan - ENS Cachan, 2010. English. <a target=\"_blank\" href=\"https://www.theses.fr/2010DENS0043\">⟨NNT : 2010DENS0043⟩</a>",
"citationFull_s":"Camille Vacher. Tree automata with global constraints for the verification of security properties. Other [cs.OH]. École normale supérieure de Cachan - ENS Cachan, 2010. English. <a target=\"_blank\" href=\"https://www.theses.fr/2010DENS0043\">⟨NNT : 2010DENS0043⟩</a>. <a target=\"_blank\" href=\"https://theses.hal.science/tel-00598494\">⟨tel-00598494⟩</a>",
"title_s":["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é"],
"authFullName_s":["Camille Vacher"],
"halId_s":"tel-00598494",
"docType_s":"THESE",
"producedDateY_i":2010},
{
"citationRef_s":"<i>25th Annual IEEE Symposium on Logic in Computer Science (LICS)</i>, Jul 2010, Edinburgh, Scotland, United Kingdom. pp.263-272, <a target=\"_blank\" href=\"https://dx.doi.org/10.1109/LICS.2010.28\">⟨10.1109/LICS.2010.28⟩</a>",
"citationFull_s":"Luis Barguñó, Carlos Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher. The Emptiness Problem for Tree Automata with Global Constraints. <i>25th Annual IEEE Symposium on Logic in Computer Science (LICS)</i>, Jul 2010, Edinburgh, Scotland, United Kingdom. pp.263-272, <a target=\"_blank\" href=\"https://dx.doi.org/10.1109/LICS.2010.28\">⟨10.1109/LICS.2010.28⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00578901\">⟨inria-00578901⟩</a>",
"title_s":["The Emptiness Problem for Tree Automata with Global Constraints"],
"authFullName_s":["Luis Barguñó",
"Carlos Creus",
"Guillem Godoy",
"Florent Jacquemard",
"Camille Vacher"],
"halId_s":"inria-00578901",
"docType_s":"COMM",
"producedDateY_i":2010},
{
"citationRef_s":"<i>Third International Conference on Language and Automata Theory and Applications</i>, Apr 2009, Tarragona, Spain. pp.446-457, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-642-00982-2_38\">⟨10.1007/978-3-642-00982-2_38⟩</a>",
"citationFull_s":"Florent Jacquemard, Francis Klay, Camille Vacher. Rigid Tree Automata. <i>Third International Conference on Language and Automata Theory and Applications</i>, Apr 2009, Tarragona, Spain. pp.446-457, <a target=\"_blank\" href=\"https://dx.doi.org/10.1007/978-3-642-00982-2_38\">⟨10.1007/978-3-642-00982-2_38⟩</a>. <a target=\"_blank\" href=\"https://inria.hal.science/inria-00579001\">⟨inria-00579001⟩</a>",
"title_s":["Rigid Tree Automata"],
"authFullName_s":["Florent Jacquemard",
"Francis Klay",
"Camille Vacher"],
"halId_s":"inria-00579001",
"docType_s":"COMM",
"producedDateY_i":2009}]
}}