Deciding equivalence of finite tree automata
SIAM Journal on Computing
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Implementing regular tree expressions
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
ACM Transactions on Programming Languages and Systems (TOPLAS)
Using multiset discrimination to solve language processing problems without hashing
Theoretical Computer Science
Coinductive axiomatization of recursive type equality and subtyping
Fundamenta Informaticae - Special issue: typed lambda-calculi and applications, selected papers
Haskell and XML: generic combinators or type-based translation?
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Derivatives of Regular Expressions
Journal of the ACM (JACM)
Typechecking for XML transformers
PODS '00 Proceedings of the nineteenth 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
Recursive subtyping revealed: (functional pearl)
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Regular expression pattern matching for XML
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Adding Structure to Unstructured Data
ICDT '97 Proceedings of the 6th International Conference on Database Theory
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Subtyping with Union Types, Intersection Types and Recursive Types
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Comparing Hierarchical Data in External Memory
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
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
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Polymorphic regular tree types and patterns
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Type inference for unique pattern matching
ACM Transactions on Programming Languages and Systems (TOPLAS)
Boolean operations and inclusion test for attribute-element constraints
Theoretical Computer Science
A system for the static analysis of XPath
ACM Transactions on Information Systems (TOIS)
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
Efficient static analysis of XML paths and types
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
On deciding well-definedness for query languages on trees
Journal of the ACM (JACM)
A crash course on database queries
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Deciding XPath containment with MSO
Data & Knowledge Engineering
Why it's nice to be quoted: quasiquoting for haskell
Haskell '07 Proceedings of the ACM SIGPLAN workshop on Haskell workshop
Confessions of a used programming language salesman
Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Modeling and optimization of scientific workflows
Ph.D. '08 Proceedings of the 2008 EDBT Ph.D. workshop
FLUX: functional updates for XML
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
XHaskell --- Adding Regular Expression Types to Haskell
Implementation and Application of Functional Languages
Types and higher-order recursion schemes for verification of higher-order programs
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PiDuce - A project for experimenting Web services technologies
Science of Computer Programming
Parametric polymorphism for XML
ACM Transactions on Programming Languages and Systems (TOPLAS)
Identifying query incompatibilities with evolving XML schemas
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
Semantics, Types and Effects for XML Updates
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
Schema-based independence analysis for XML updates
Proceedings of the VLDB Endowment
A typed calculus for querying distributed XML documents
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Regular expression subtyping for XML query and update languages
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
DynXML: safely programming the dynamic web
APLWACA '10 Proceedings of the 2010 Workshop on Analysis and Programming Languages for Web Applications and Cloud Applications
Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion
Subtyping algorithm of regular tree grammars with disjoint production rules
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Regular expression containment: coinductive axiomatization and computational interpretation
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extending type systems in a library: Type-safe XML processing in C++
Science of Computer Programming
XML graphs in program analysis
Science of Computer Programming
More precise typing of rewrite strategies
Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications
Impact of XML Schema Evolution
ACM Transactions on Internet Technology (TOIT)
Bit-coded regular expression parsing
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Parametric polymorphism and semantic subtyping: the logical connection
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Efficient inclusion checking on explicit and semi-symbolic tree automata
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Type-based optimization for regular patterns
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
The design space of type checkers for XML transformation languages
ICDT'05 Proceedings of the 10th international conference on Database Theory
The inclusion problem for regular expressions
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
XML validation for context-free grammars
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Linear systems for regular hedge languages
ADBIS'09 Proceedings of the 13th East European conference on Advances in Databases and Information Systems
Mechanizing the metatheory of mini-XQuery
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
VATA: a library for efficient manipulation of non-deterministic tree automata
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Query reasoning on trees with types, interleaving, and counting
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
The inclusion problem for regular expressions
Journal of Computer and System Sciences
Detecting specification errors in declarative languages with constraints
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
Checking NFA equivalence with bisimulations up to congruence
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model Checking Higher-Order Programs
Journal of the ACM (JACM)
Hi-index | 0.00 |
We propose regular expression types as a foundation for statically typed XML processing languages. Regular expression types, like most schema languages for XML, introduce regular expression notations such as repetition (*), alternation (|), etc., to describe XML documents. The novelty of our type system is a semantic presentation of subtyping, as inclusion between the sets of documents denoted by two types. We give several examples illustrating the usefulness of this form of subtyping in XML processing.The decision problem for the subtype relation reduces to the inclusion problem between tree automata, which is known to be EXPTIME-complete. To avoid this high complexity in typical cases, we develop a practical algorithm that, unlike classical algorithms based on determinization of tree automata, checks the inclusion relation by a top-down traversal of the original type expressions. The main advantage of this algorithm is that it can exploit the property that type expressions being compared often share portions of their representations. Our algorithm is a variant of Aiken and Murphy's set-inclusion constraint solver, to which are added several new implementation techniques, correctness proofs, and preliminary performance measurements on some small programs in the domain of typed XML processing.