PDL for ordered trees, Journal of Applied Non-Classical Logics, vol.32, issue.2, pp.115-135, 2005. ,
DOI : 10.3166/jancl.15.115-135
URL : https://hal.archives-ouvertes.fr/inria-00001206
Query reasoning on trees with types, interleaving, and counting, IJCAI 2011: Proceedings of the 22nd International Joint Conference on Artificial Intelligence IJCAI/AAAI, pp.718-723, 2011. ,
Destabilizers and independence of XML updates, Proceedings of the VLDB Endowment, pp.906-917, 2010. ,
DOI : 10.14778/1920841.1920956
Semantic subtyping with an SMT solver, Proceedings of the 15th international conference on functional programming (ICFP '10), pp.105-116, 2010. ,
The Complexity of Enriched Mu-Calculi, Logical Methods in Computer Science, vol.4, issue.3, 2008. ,
DOI : 10.2168/LMCS-4(3:11)2008
Z3: An Efficient SMT Solver, Proceedings of the 14th international conference on tools and algorithms for the construction and analysis of systems (TACAS '08), pp.337-340, 2008. ,
DOI : 10.1007/978-3-540-78800-3_24
XML reasoning solver project ,
Efficient static analysis of XML paths and types, PLDI, 2007. ,
Parametric polymorphism and semantic subtyping: the logical connection, ICFP '11: Proceedings of the 16th ACM SIGPLAN international conference on Functional programming, pp.107-116, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00585686
BDD-based decision procedures for the modal logic K ???, Journal of Applied Non-Classical Logics, vol.2, issue.2, pp.169-208, 2006. ,
DOI : 10.1016/0004-3702(92)90049-4
A decision procedure for alternation-free modal µ?calculi, Advances in Modal Logic, pp.341-362, 2008. ,
Reasoning about the past with two-way automata, ICALP, 1998. ,
DOI : 10.1007/BFb0055090
Modal ??-Calculus and Alternating Tree Automata, Automata Logics, and Infinite Games, pp.205-211, 2002. ,
DOI : 10.1007/3-540-36387-4_10