1. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Lukávs Holík, Ahmed Rezine, Philipp Rümmer, and Jari Stenman. 2015. Norn: An SMT solver for string constraints. In CAV '15 (Lect. Notes in Comput. Sci.), Vol. 9206. Springer, 462--469. https://doi.org/10.1007/978--3--319--21690--4_29
2. Sergio Abriola, Diego Figueira, and Santiago Figueira. 2017. Logics of repeating values on data trees and branching counter systems. In FoSSaCS '17 (Lect. Notes in Comput. Sci.), Vol. 10203. Springer, 196--212. https://doi.org/10.1007/978--3--662--54458--7_12
3. Loredana Afanasiev, Patrick Blackburn, Ioanna Dimitriou, Bertrand Gaiffe, Evan Goris, Maarten Marx, and Maarten de Rijke. 2005. PDL for ordered trees. J. Appl. Non-Classical Log. , Vol. 15, 2 (2005), 115--135. https://doi.org/10.3166/jancl.15.115--135
4. Loredana Afanasiev and Marteen Marx. 2008. An analysis of XQuery benchmarks. Inform. Sys. , Vol. 33, 2 (2008), 155--181. https://doi.org/10.1016/j.is.2007.05.002
5. Diego Arroyuelo, Francisco Claude, Sebastian Maneth, Veli M"akinen, Gonzalo Navarro, Kim Nguy$tilderaisebox0pt[1.3ex][.9ex]ê $n, Jouni Sirén, and Niko V"alim"aki. 2015. Fast in-memory XPath search using compressed indexes. Softw. Pract. & Exp. , Vol. 45, 3 (2015), 399--434. https://doi.org/10.1002/spe.2227