Deciding equivalence of finite tree automata
SIAM Journal on Computing
Decision problems for term rewriting systems and recognizable tree languages
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Handbook of theoretical computer science (vol. B)
Towards static type checking for XSLT
DocEng '01 Proceedings of the 2001 ACM Symposium on Document engineering
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Ground Tree Rewriting Graphs of Bounded Tree Width
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
CDuce: an XML-centric general-purpose language
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Access control of XML documents considering update operations
Proceedings of the 2003 ACM workshop on XML security
Information Processing Letters
Secure XML querying with security views
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Reachability Analysis over Term Rewriting Systems
Journal of Automated Reasoning
Frontiers of tractability for typechecking simple XML transformations
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML type checking with macro tree transducers
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The expressivity of XPath with transitive closure
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML access control using static analysis
ACM Transactions on Information and System Security (TISSEC)
Journal of Computer and System Sciences
Formalizing XML access control for update operations
Proceedings of the 12th ACM symposium on Access control models and technologies
ACCOn: checking consistency of XML write-access control policies
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Local Hoare reasoning about DOM
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Closure of Hedge-Automata Languages by Hedge Rewriting
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Deciding equivalence of top--down XML transformations in polynomial time
Journal of Computer and System Sciences
Satisfiability and relevance for queries over active documents
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Equational approximations for tree automata completion
Journal of Symbolic Computation
Recognizing boolean closed A-tree languages with membership conditional rewriting mechanism
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Towards practical typechecking for macro tree transducers
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Exact XML type checking in polynomial time
ICDT'07 Proceedings of the 11th international conference on Database Theory
On computing reachability sets of process rewrite systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Computing transitive closures of hedge transformations
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
Transition graphs of rewriting systems over unranked trees
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Consistency and repair for XML write-access control policies
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree language L as the first child of a node labeled by a". For these rules, we give type inference algorithms, considering types defined by several classes of unranked tree automata. These type inference algorithms are directly applicable to XML static typechecking, which is the problem of verifying whether, a given document transformation always converts source documents of a given input type into documents of a given output type. We show that typechecking for arbitrary sequences of XML update primitives can be done in polynomial time when the unranked tree automaton defining the output type is deterministic and complete, and that it is EXPTIME-complete otherwise. We then apply the results to the verification of access control policies for XML updates. We propose in particular a polynomial time algorithm for the problem of local consistency of a policy, that is, for deciding the non-existence of a sequence of authorized update operations starting from a given document that simulates a forbidden update operation.