A note on the reduction of two-way automata to one-way atuomata
Information Processing Letters
Deciding equivalence of finite tree automata
SIAM Journal on Computing
Haskell overloading is DEXPTIME-complete
Information Processing Letters
Handbook of formal languages, vol. 3
Type inference for queries on semistructured data
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Typechecking for XML transformers
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML with data values: typechecking revisited
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Towards static type checking for XSLT
DocEng '01 Proceedings of the 2001 ACM Symposium on Document engineering
ACM SIGMOD Record
Query automata over finite trees
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Automata theory for XML researchers
ACM SIGMOD Record
A formal model for an expressive fragment of XSLT
Information Systems - Databases: Creation, management and utilization
Structured Document Transformations Based on XSL
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Typechecking for Semistructured Data
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
UnQL: a query language and algebra for semistructured data based on structural recursion
The VLDB Journal — The International Journal on Very Large Data Bases
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Typechecking XML Views of Relational Databases
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
An observation on time-storage trade off
Journal of Computer and System Sciences
Static Analysis of XML Transformations in Java
IEEE Transactions on Software Engineering
Information Processing Letters
Branching synchronization grammars with nested tables
Journal of Computer and System Sciences
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
Regular expression filters for XML
Journal of Functional Programming
Journal of Computer and System Sciences
Well-definedness and semantic type-checking for the nested relational calculus
Theoretical Computer Science
XML graphs in program analysis
Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
On deciding well-definedness for query languages on trees
Journal of the ACM (JACM)
Static validation of XSL transformations
ACM Transactions on Programming Languages and Systems (TOPLAS)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Approximate Structural Consistency
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Towards practical typechecking for macro tree transducers
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Equivalence of deterministic nested word to word transducers
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML graphs in program analysis
Science of Computer Programming
XML type checking using high-level tree transducer
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Which XML schemas admit 1-pass preorder typing?
ICDT'05 Proceedings of the 10th international conference on Database Theory
Well-definedness and semantic type-checking in the nested relational calculus and XQuery
ICDT'05 Proceedings of the 10th international conference on Database Theory
Static and dynamic semantics of NoSQL languages
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input schema. As typechecking quickly turns undecidable for query languages capable of testing equality of data values, we return to the limited framework where we abstract XML documents as labeled ordered trees. We focus on simple top-down recursive transformations motivated by XSLT and structural recursion on trees. We parameterize the problem by several restrictions on the transformations (deleting, non-deleting, bounded width) and consider both tree automata and DTDs as output schemas. The complexity of the typechecking problems in this scenario range from PTIME to EXPTIME.