Using Finite State Automata to Implement W3C XML Schema Content Model Validation and Restriction Checking

Henry Thompson; Richard Tobin

Using Finite State Automata to Implement W3C XML Schema Content Model Validation and Restriction Checking

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Implementing validation and restriction checking for W3C XML Schema content models is harder than for DTDs. This paper gives complete details on how to convert W3C XML Schema content models to Finite State Automata, including handling of numeric exponents and wildcards. Enforcing the Unique Particle Attribution constraint and implementing restriction checking in polynomial time using these FSAs is also described.

Original language	English
Title of host publication	XML Europe 2003
Publisher	IDEAlliance
Publication status	Published - 2003

Access to Document

http://www.ltg.ed.ac.uk/~ht/XML_Europe_2003.html

Cite this

@inproceedings{183dacf6539e436a8f72796afaf59237,

title = "Using Finite State Automata to Implement W3C XML Schema Content Model Validation and Restriction Checking",

abstract = "Implementing validation and restriction checking for W3C XML Schema content models is harder than for DTDs. This paper gives complete details on how to convert W3C XML Schema content models to Finite State Automata, including handling of numeric exponents and wildcards. Enforcing the Unique Particle Attribution constraint and implementing restriction checking in polynomial time using these FSAs is also described. ",

author = "Henry Thompson and Richard Tobin",

year = "2003",

language = "English",

booktitle = "XML Europe 2003",

publisher = "IDEAlliance",

}

TY - GEN

T1 - Using Finite State Automata to Implement W3C XML Schema Content Model Validation and Restriction Checking

AU - Thompson, Henry

AU - Tobin, Richard

PY - 2003

Y1 - 2003

N2 - Implementing validation and restriction checking for W3C XML Schema content models is harder than for DTDs. This paper gives complete details on how to convert W3C XML Schema content models to Finite State Automata, including handling of numeric exponents and wildcards. Enforcing the Unique Particle Attribution constraint and implementing restriction checking in polynomial time using these FSAs is also described.

AB - Implementing validation and restriction checking for W3C XML Schema content models is harder than for DTDs. This paper gives complete details on how to convert W3C XML Schema content models to Finite State Automata, including handling of numeric exponents and wildcards. Enforcing the Unique Particle Attribution constraint and implementing restriction checking in polynomial time using these FSAs is also described.

M3 - Conference contribution

BT - XML Europe 2003

PB - IDEAlliance

ER -

Using Finite State Automata to Implement W3C XML Schema Content Model Validation and Restriction Checking

Abstract

Access to Document

Fingerprint

Cite this