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
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
Introduction to the Theory of Computation
Introduction to the Theory of Computation
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
Containment for XPath Fragments under DTD Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Incremental Validation of XML Documents
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Processing XML Streams with Deterministic Automata
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
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
UnQL: a query language and algebra for semistructured data based on structural recursion
The VLDB Journal — The International Journal on Very Large Data Bases
XDuce: A statically typed XML processing language
ACM Transactions on Internet Technology (TOIT)
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
CDuce: an XML-centric general-purpose language
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
XPath satisfiability in the presence of DTDs
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of typechecking top-down XML transformations
Theoretical Computer Science - Database theory
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Static analysis of xml transformation and schema languages
Static analysis of xml transformation and schema languages
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
An observation on time-storage trade off
Journal of Computer and System Sciences
Typechecking top-down XML transformations: Fixed input or output schemas
Information and Computation
XEvolve: an XML schema evolution framework
Proceedings of the 2011 ACM Symposium on Applied 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
Optimizing schema languages for XML: numerical constraints and interleaving
ICDT'07 Proceedings of the 11th international conference on Database Theory
Foundations of XML based on logic and automata: a snapshot
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Decidability of Downward XPath
ACM Transactions on Computational Logic (TOCL)
On XPath with transitive axes and data tests
Proceedings of the 32nd symposium on Principles of database systems
Hi-index | 0.00 |
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus on complete algorithms which always produce the correct answer. We consider top-down XML transformations incorporating XPath expressions and abstract document types by grammars and tree automata. By restricting schema languages and transformations, we identify several practical settings for which typechecking can be done in polynomial time. Moreover, the resulting framework provides a rather complete picture as we show that most scenarios cannot be enlarged without rendering the typechecking problem intractable. So, the present research sheds light on when to use fast complete algorithms and when to reside to sound but incomplete ones.