Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
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
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth 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
Incremental Validation of XML Documents
ICDT '03 Proceedings of the 9th International Conference on Database Theory
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
Typechecking XML views of relational databases
ACM Transactions on Computational Logic (TOCL)
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
XML with data values: typechecking revisited
Journal of Computer and System Sciences - Special issu on PODS 2001
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
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
Frontiers of tractability for typechecking simple XML transformations
Journal of Computer and System Sciences
On the minimization of XML Schemas and tree automata for unranked trees
Journal of Computer and System Sciences
An edit operation-based approach to the inclusion problem for DTDs
Proceedings of the 2007 ACM symposium on Applied computing
A crash course on database queries
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
Typechecking top-down XML transformations: Fixed input or output schemas
Information and Computation
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
Classes of tree homomorphisms with decidable preservation of regularity
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
ACM Transactions on Database Systems (TODS)
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
SIAM Journal on Computing
The complexity of text-preserving XML transformations
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complexity of typechecking XML views of relational databases
ICDT'07 Proceedings of the 11th international conference on Database Theory
Exact XML type checking in polynomial time
ICDT'07 Proceedings of the 11th international conference on Database Theory
Automata for positive core XPath queries on compressed documents
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Polynomial-time inverse computation for accumulative functions with multiple data traversals
PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Deciding definability by deterministic regular expressions
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
We investigate the typechecking problem for XML transformations: statically verifying that every answer to a transformation 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 input and output schemas. The complexity of the typechecking problems in this scenario ranges from PTIME to EXPTIME.