Journal of Computer and System Sciences
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
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
Typechecking Top-Down Uniform Unranked Tree Transducers
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)
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
XPath satisfiability in the presence of DTDs
Proceedings of the twenty-fourth 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
Transformation and reaction rules for data on the web
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
On the complexity of typechecking top-down XML transformations
Theoretical Computer Science - Database theory
LiXQuery: a formal foundation for XQuery research
ACM SIGMOD Record
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
Comparing XML path expressions
Proceedings of the 2006 ACM symposium on Document engineering
A system for the static analysis of XPath
ACM Transactions on Information Systems (TOIS)
Journal of Computer and System Sciences
Well-definedness and semantic type-checking for the nested relational calculus
Theoretical Computer Science
An edit operation-based approach to the inclusion problem for DTDs
Proceedings of the 2007 ACM symposium on Applied computing
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)
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
Approximate schemas, source-consistency and query answering
Journal of Intelligent Information Systems
Towards practical typechecking for macro tree transducers
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Rewrite-based verification of XML updates
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Transforming XML documents as schemas evolve
Proceedings of the VLDB Endowment
XML graphs in program analysis
Science of Computer Programming
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
Minimizing tree automata for unranked trees
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
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
Web and semantic web query languages: a survey
Proceedings of the First international conference on Reasoning Web
Towards types for web rule languages
Proceedings of the First international conference on Reasoning Web
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information 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 is in polynomial time. Moreover, the resulting framework provides a rather complete picture as we show that most scenarios can not 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.