Alternating automata on infinite trees
Theoretical Computer Science
Typechecking for XML transformers
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Regular expression pattern matching for XML
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extended path expressions of XML
PODS '01 Proceedings of the twentieth 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
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Using YAT to Build a Web Server
WebDB '98 Selected papers from the International Workshop on The World Wide Web and Databases
XDuce: A Typed XML Processing Language (Preliminary Report)
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
ACM SIGMOD Record
Typechecking Top-Down Uniform Unranked Tree Transducers
ICDT '03 Proceedings of the 9th International Conference on Database Theory
XDuce: A statically typed XML processing language
ACM Transactions on Internet Technology (TOIT)
Proceedings of the 2003 ACM symposium on Document engineering
Proceedings of the 2003 ACM symposium on Document engineering
Static Analysis of XML Transformations in Java
IEEE Transactions on Software Engineering
Information Processing Letters
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
On the complexity of typechecking top-down XML transformations
Theoretical Computer Science - Database theory
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Comparing XML path expressions
Proceedings of the 2006 ACM symposium on Document engineering
Boolean operations and inclusion test for attribute-element constraints
Theoretical Computer Science
Regular expression filters for XML
Journal of Functional Programming
A system for the static analysis of XPath
ACM Transactions on Information Systems (TOIS)
Frontiers of tractability for typechecking simple XML transformations
Journal of Computer and System Sciences
XML graphs in program analysis
Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Static validation of XSL transformations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Deciding XPath containment with MSO
Data & Knowledge Engineering
Combination of transformation and schema languages described by a complete formal semantics
Proceedings of the 2007 ACM symposium on Document engineering
Typechecking top-down XML transformations: Fixed input or output schemas
Information and Computation
Not all patterns, but enough: an automatic verifier for partial but sufficient pattern matching
Proceedings of the first ACM SIGPLAN symposium on Haskell
Deciding equivalence of top--down XML transformations in polynomial time
Journal of Computer and System Sciences
Boolean operations for attribute-element constraints
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
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
Graph-transformation verification using monadic second-order logic
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
The design space of type checkers for XML transformation languages
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
Non-backtracking top-down algorithm for checking tree automata containment
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Hi-index | 0.00 |
We are concerned about the static type checking problem for XSLT. In the context of XSLT and other XML programming, types are DTDs or schemas, and static type checking is to verify that a program always converts valid source documents into also valid output documents. To achieve static type checking for XSLT, we introduce a subset of XSLT, and an efficient algorithm of backward type inference for that subset. Although our XSLT subset lacks XPath, it includes recursive calls of templates and is powerful enough to capture basic XSLT transformations. Our method is based on Finite Tree Automata (FTA) which provide a rigorous representation of types in XML. Given types of output documents, backward type inference computes types of source documents. The idea of backward type inference is borrowed from Milo et al's work, while we reduce the computational complexity in their framework.