. Afanasiev, PDL for ordered trees Journal of Applied Non-Classical Logics Query reasoning on trees with types, interleaving, and counting CDuce: an XML-centric general-purpose language, IJCAI 2011: Proceedings of the 22nd International Joint Conference on Artificial Intelligence ICFP'03: ICFP 11: Proceedings of the ACM international conference on Functional programming, pp.115-135, 2003.

. Benzaken, Static and dynamic semantics of nosql languages, POPL'13: Proceedings of the ACM Symposium on Principles of Programming Languages Robie, and Jérôme Siméon. XQuery 1.0: An XML query language, pp.101-114, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00797956

X. Castagna, Z. Castagna, and . Xu, Set-theoretic foundation of parametric polymorphism and subtyping, ICFP'11: Proceedings of the 16th ACM SIGPLAN international conference on Functional ProgrammingChekol et al., 2012] Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès, and Nabil Laya¨?daLaya¨?da. SPARQL query containment under RDFS entailment regime IJ- CAR: Proceedings of the 6th International Joint Conference on Automated Reasoning, pp.94-106, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00618839

. Dal-zilio, Silvano Dal-Zilio, Denis Lugiez, and Charles Meyssonnier. A logic you can count on, POPL'04: Proceedings of the ACM Symposium on Principles of Programming Languages, 2004.

. Genevès, Efficient static analysis of XML paths and types, PLDI '07: Proceedings of the 2007 ACM SIG- PLAN conference on Programming language design and implementation, pp.342-351, 2007.

. Genevès, Pierre Genevès, Nabil Laya¨?daLaya¨?da, and Vincent Quint. On the analysis of cascading style sheets, 2012.

. Genevès, Efficiently Deciding ??-Calculus with Converse over Finite Trees, ACM Transactions on Computational Logic, vol.16, issue.2, p.2015, 2015.
DOI : 10.1145/2724712

. Genevès, The XML reasoning project: http://wam.inrialpes.fr Parametric polymorphism and semantic subtyping: the logical connection, Pierre Genevès, and Nabil Laya¨?daLaya¨?da ICFP '11: Proceedings of the 16th ACM SIGPLAN international conference on Functional programming, pp.107-116, 2011.

. Kolovski, Analyzing web access control policies, Proceedings of the 16th international conference on World Wide Web , WWW '07, pp.677-686, 2007.
DOI : 10.1145/1242572.1242664
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.7297

]. D. Kozen, Results on the Propositional ??-Calculus, ICALP'82: Proceedings of the International Colloquium on Automata, Languages, and Programming, 1982.
DOI : 10.7146/dpb.v11i146.7420

]. Lugiez, Multitree automata that count, Theoretical Computer Science, vol.333, issue.1-2, pp.225-263, 2005.
DOI : 10.1016/j.tcs.2004.10.023
URL : http://doi.org/10.1016/j.tcs.2004.10.023

. Murata, XML access control using static analysis, ACM Transactions on Information and System Security, vol.9, issue.3, pp.292-324, 2006.
DOI : 10.1145/1178618.1178621

. Pan, 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

. Tanabe, A Decision Procedure for the Alternation-Free Two-Way Modal ??-Calculus, TABLEAUX, pp.277-291, 2005.
DOI : 10.1007/11554554_21

. Tanabe, A decision procedure for alternationfree modal µ?calculi, Advances in Modal Logic, pp.341-362, 2008.