Satisfiability and relevance for queries over active documents, Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '09, pp.87-96, 2009. ,
DOI : 10.1145/1559795.1559810
URL : https://hal.archives-ouvertes.fr/inria-00429645
Semantics, Types and Effects for XML Updates, Proceedings of the 12th International Symposium, Database Programming Languages (DBPL), pp.1-17, 2009. ,
DOI : 10.1145/1348250.1348255
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.9410
CDuce: an XML-centric general-purpose language, Proceedings of the 8th ACM SIGPLAN International conference on Functional programming, pp.51-63, 2003. ,
URL : https://hal.archives-ouvertes.fr/hal-00152619
Regular Model Checking, Proceedings of the 12th Int. Conference on Computer Aided Verification (CAV), pp.403-418, 2000. ,
DOI : 10.1007/10722167_31
URL : https://hal.archives-ouvertes.fr/hal-00159512
On Computing Reachability Sets of Process Rewrite Systems, Proceedings 16th International Conference Term Rewriting and Applications (RTA), pp.484-499, 2005. ,
DOI : 10.1007/978-3-540-32033-3_35
URL : https://hal.archives-ouvertes.fr/hal-00161108
ACCOn, Proceedings of the 11th international conference on Extending database technology Advances in database technology, EDBT '08, pp.715-719, 2008. ,
DOI : 10.1145/1353343.1353433
Access control of XML documents considering update operations, Proceedings of the 2003 ACM workshop on XML security , XMLSEC '03, 2003. ,
DOI : 10.1145/968559.968568
XQuery Update Facility 1.0. W3C Candidate Recommendation, 2009. ,
Securing XML Documents, Proceedings of the 7th International Conference on Extending Database Technology (EDBT), pp.121-135, 2000. ,
DOI : 10.1007/3-540-46439-5_8
Rewrite Systems, Formal Models and Semantics), pp.243-320, 1990. ,
DOI : 10.1016/B978-0-444-88074-1.50011-1
Deciding equivalence of top???down XML transformations in polynomial time, Journal of Computer and System Sciences, vol.75, issue.5, pp.271-286, 2009. ,
DOI : 10.1016/j.jcss.2009.01.001
Macro tree transducers, Journal of Computer and System Sciences, vol.31, issue.1, pp.71-146, 1985. ,
DOI : 10.1016/0022-0000(85)90066-2
Secure XML querying with security views, Proceedings of the 2004 ACM SIGMOD international conference on Management of data , SIGMOD '04, pp.587-598, 2004. ,
DOI : 10.1145/1007568.1007634
Reachability Analysis over Term Rewriting Systems, Journal of Automated Reasoning, vol.37, issue.1?2, pp.3-4341, 2004. ,
DOI : 10.1007/s10817-004-6246-0
URL : https://hal.archives-ouvertes.fr/inria-00071609
Towards Practical Typechecking for Macro Tree Transducers, Proceedings of the 11th International Symposium on Database Programming Languages (DBPL), pp.246-260, 2007. ,
DOI : 10.1007/978-3-540-75987-4_17
URL : https://hal.archives-ouvertes.fr/inria-00126895
Formalizing XML access control for update operations, Proceedings of the 12th ACM symposium on Access control models and technologies , SACMAT '07, pp.169-174, 2007. ,
DOI : 10.1145/1266840.1266868
Local Hoare reasoning about DOM, Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '08, pp.261-270, 2008. ,
DOI : 10.1145/1376916.1376953
Equational approximations for tree automata completion, Journal of Symbolic Computation, vol.45, issue.5, pp.574-597, 2010. ,
DOI : 10.1016/j.jsc.2010.01.009
URL : https://hal.archives-ouvertes.fr/inria-00495405
Decision problems for term rewrite systems and recognizable tree languages, 8 t h Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp.148-159, 1991. ,
URL : https://hal.archives-ouvertes.fr/inria-00538875
Closure of Hedge-Automata Languages by Hedge Rewriting, Proceedings of the 19th International Conference on Rewriting Techniques and Applications (RTA), pp.157-171, 2008. ,
DOI : 10.1007/978-3-540-70590-1_11
URL : https://hal.archives-ouvertes.fr/inria-00329803
XSL Transformations (XSLT) 2.0. W3C working draft, World Wide Web Consortium, 2003. ,
Ground Tree Rewriting Graphs of Bounded Tree Width, Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp.559-570, 2002. ,
DOI : 10.1007/3-540-45841-7_46
Transition Graphs of Rewriting Systems over Unranked Trees, Proceedings 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS), pp.67-77, 2007. ,
DOI : 10.1007/978-3-540-74456-6_8
XML type checking with macro tree transducers, Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '05, pp.283-294, 2005. ,
DOI : 10.1145/1065167.1065203
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.549
Exact XML Type Checking in Polynomial Time, Proceedings of the 11th International Conference on Database Theory (ICDT), pp.254-268, 2007. ,
DOI : 10.1007/11965893_18
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.122.1094
Frontiers of Tractability for Typechecking Simple XML Transformations, Proceedings of the Twentythird ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp.23-34, 2004. ,
Typechecking for XML transformers, Journal of Computer and System Sciences, vol.66, issue.1, pp.66-97, 2003. ,
DOI : 10.1016/S0022-0000(02)00030-2
URL : http://doi.org/10.1016/s0022-0000(02)00030-2
The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates, Proceedings of the 3d International Conference on Language and Automata Theory and Applications (LATA), pp.601-613, 2009. ,
DOI : 10.1145/1353343.1353433
Hedge Automata: a Formal Model for XML Schemata Taxonomy of XML Schema Languages using Formal Language Theory, Extreme Markup Languages, 2000. ,
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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.452.2060
Recognizing Boolean Closed Atree languages with Membership Conditional Rewriting Mechanism ,
DOI : 10.1007/3-540-44881-0_34
Macro forest transducers, Information Processing Letters, vol.89, issue.3, pp.141-149, 2004. ,
DOI : 10.1016/j.ipl.2003.05.001
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.686.2441
Automata for XML???A survey, Journal of Computer and System Sciences, vol.73, issue.3, pp.289-315, 2007. ,
DOI : 10.1016/j.jcss.2006.10.003
URL : http://doi.org/10.1016/j.jcss.2006.10.003
Deciding Equivalence of Finite Tree Automata, SIAM Journal on Computing, vol.19, issue.3, pp.424-437, 1990. ,
DOI : 10.1137/0219027
Rewriting Systems over Unranked Trees, 2006. ,
The Expressivity of XPath with Transitive Closure, Proceedings of the 26th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp.328-337, 2006. ,
Computing transitive closures of hedge transformations, Proceedings of the 1st International Workshop on Verification and Evaluation of Computer and Communication Systems (VECOS), eWIC Series, 2007. ,
DOI : 10.1504/IJCCBS.2012.045079
URL : https://hal.archives-ouvertes.fr/hal-00161088
Towards static type checking for XSLT, Proceedings of the 2001 ACM Symposium on Document engineering , DocEng '01, pp.18-27, 2001. ,
DOI : 10.1145/502187.502191