Parsing theory. Vol. 1: languages and parsing
Parsing theory. Vol. 1: languages and parsing
Programming perl
The SGML handbook
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
Regular expressions into finite automata
Theoretical Computer Science
One-unambiguous regular languages
Information and Computation
Journal of the ACM (JACM)
Definitive XML Schema
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
Deterministic Regular Languages
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Sorting and Searching on the Word RAM
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Unambiguity of Extended Regular Expressions in SGML Document Grammars
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
DTDs versus XML schema: a practical study
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Towards efficient implementation of XML schema content models
Proceedings of the 2004 ACM symposium on Document engineering
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
One-unambiguity of regular expressions with numeric occurrence indicators
Information and Computation
Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Daios: Efficient Dynamic Web Service Invocation
IEEE Internet Computing
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Regular Expressions with Counting: Weak versus Strong Determinism
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
SIAM Journal on Computing
Optimizing schema languages for XML: numerical constraints and interleaving
ICDT'07 Proceedings of the 11th international conference on Database Theory
Deterministic regular expressions in linear time
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Regular Expressions with Counting: Weak versus Strong Determinism
SIAM Journal on Computing
Checking determinism of regular expressions with counting
DLT'12 Proceedings of the 16th international conference on Developments in Language 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 consider the determinism checking of XML Schema content models, as required by the W3C Recommendation. We argue that currently applied solutions have flaws and make processors vulnerable to exponential resource needs by pathological schemas, and we help to eliminate this potential vulnerability of XML Schema based systems. XML Schema content models are essentially regular expressions extended with numeric occurrence indicators. A previously published polynomial-time solution to check the determinism of such expressions is improved to run in linear time, and the improved algorithm is implemented and evaluated experimentally. When compared to the corresponding method of a popular production-quality XML Schema processor, the new implementation runs orders of magnitude faster. Enhancing the solution to take further extensions of XML Schema into account without compromising its linear scalability is also discussed.