Handbook of theoretical computer science (vol. B)
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
A query language and optimization techniques for unstructured data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Complexity results for two-way and multi-pebble automata and their logics
ICALP '94 Selected papers from the 21st international colloquium on Automata, languages and programming
The TSIMMIS Approach to Mediation: Data Models and Languages
Journal of Intelligent Information Systems - Special issue: next generation information technologies and systems
Regular path queries with constraints
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Your mediators need data conversion!
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Catching the boat with Strudel: experiences with a Web-site management system
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Type inference for queries on semistructured data
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Acta Cybernetica
WWW '99 Proceedings of the eighth international conference on World Wide Web
Journal of the ACM (JACM)
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SilkRoute: trading between relations and XML
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Regular expression types for XML
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Handbook of Formal Languages
Object Exchange Across Heterogeneous Information Sources
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
XDuce: A Typed XML Processing Language (Preliminary Report)
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
Enhancing Semistructured Data Mediators with Document Type Definitions
ICDE '99 Proceedings of the 15th International Conference on Data 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
Representing and querying XML with incomplete information
ACM Transactions on Database Systems (TODS)
Complementing deterministic tree-walking automata
Information Processing Letters
Journal of Computer and System Sciences
Frontiers of tractability for typechecking simple XML transformations
Journal of Computer and System Sciences
The equivalence problem for deterministic MSO tree transducers is decidable
Information Processing Letters
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)
XML transformation by tree-walking transducers with invisible pebbles
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressiveness and complexity of xml publishing transducers
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Extended abstract: towards verifying semistructured data
APCCM '07 Proceedings of the fourth Asia-Pacific conference on Comceptual modelling - Volume 67
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
Efficient memory representation of XML document trees
Information Systems
Typechecking top-down XML transformations: Fixed input or output schemas
Information and Computation
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Expressiveness and complexity of XML publishing transducers
ACM Transactions on Database Systems (TODS)
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
Language and Automata Theory and Applications
Pebble alternating tree-walking automata and their recognizing power
Acta Cybernetica
Type-based specialization of xml transformations
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Pebble Macro Tree Transducers with Strong Pebble Handling
Fundamenta Informaticae
Circularity, composition, and decomposition results for pebble macro tree transducers
Journal of Automata, Languages and Combinatorics
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Operational state complexity of nested word automata
Theoretical Computer Science
Deciding determinism of caterpillar expressions
Theoretical Computer Science
Efficient inclusion checking for deterministic tree automata and XML Schemas
Information and Computation
Higher-order multi-parameter tree transducers and recursion schemes for program verification
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Weighted tree-walking automata
Acta Cybernetica
Deterministic caterpillar expressions
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Tree automata over infinite alphabets
Pillars of computer science
Rewrite-based verification of XML updates
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Query-preserving watermarking of relational databases and Xml documents
ACM Transactions on Database Systems (TODS)
Efficient reasoning about data trees via integer linear programming
Proceedings of the 14th International Conference on Database Theory
Verification of tree-processing programs via higher-order model checking
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
SIAM Journal on Computing
XML graphs in program analysis
Science of Computer Programming
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
Graph-transformation verification using monadic second-order logic
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Tree transformations and dependencies
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining 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
Nested pebbles and transitive closure
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Efficient memory representation of XML documents
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
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
The design space of type checkers for XML transformation languages
ICDT'05 Proceedings of the 10th international conference on Database Theory
The equivalence problem for deterministic MSO tree transducers is decidable
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Expressive power of pebble automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Deterministic automata on unranked trees
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
State complexity of the concatenation of regular tree languages
Theoretical Computer Science
Research into verifying semistructured data
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Macro tree transformations of linear size increase achieve cost-optimal parallelism
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
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
Efficient reasoning about data trees via integer linear programming
ACM Transactions on Database Systems (TODS)
Transformations Between Different Models of Unranked Bottom-Up Tree Automata
Fundamenta Informaticae
Weighted Extended Tree Transducers
Fundamenta Informaticae
Survey: Weighted Extended Top-down Tree Transducers Part II—Application in Machine Translation
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Pebble Macro Tree Transducers with Strong Pebble Handling
Fundamenta Informaticae
Lower bounds for the size of deterministic unranked tree automata
Theoretical Computer Science
Complexity of pebble tree-walking automata
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
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 study the typechecking problem for XML (eXtensible Markup Language) transformers: given an XML transformation program and a DTD for the input XML documents, check whether every result of the program conforms to a specified output DTD. We model XML transformers using a novel device called a k-pebble transducer, that can express most queries without data-value joins in XML-QL, XSLT, and other XML query languages. Types are modeled by regular tree languages, a robust extension of DTDs. The main result of the paper is that typechecking for k-pebble transducers is decidable. Consequently, typechecking can be performed for a broad range of XML transformation languages, including XML-QL and a fragment of XSLT.