Verification theories for XML schema

Authors:
Suad Alagić;Mark Royer;David Briggs
Affiliations:
Department of Computer Science, University of Southern Maine, Portland, ME;Department of Computer Science, University of Southern Maine, Portland, ME;Department of Computer Science, University of Southern Maine, Portland, ME
Venue:
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
Year:
2006

Citing 10
Cited 2

Automatic verification of database transaction safety

ACM Transactions on Database Systems (TODS)
The essence of XML

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Subsumption for XML types

ICDT '01 Proceedings of the 8th International Conference on Database Theory
Behavioral Compatibility of Self-Typed Theories

ECOOP '02 Proceedings of the 16th European Conference on Object-Oriented Programming
A Theorem Prover-Based Analysis Tool for Object-Oriented Databases

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
A Model Theory for Generic Schema Management

DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Reasoning about Keys for XML

DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
XDuce: A statically typed XML processing language

ACM Transactions on Internet Technology (TOIT)
Integrity constraints for XML

Journal of Computer and System Sciences - Special issue on PODS 2000
Parametric polymorphism for XML

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Mapping XSD to OO schemas

ICOODB'09 Proceedings of the Second international conference on Object databases
Object-oriented constraints for XML schema

ICOODB'10 Proceedings of the Third international conference on Objects and databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

XML Schema types and structures are represented as theories of a verification system, PVS, for proving properties related to XML schemas. Type derivations by restriction and extension as defined in XML Schema are represented in the PVS type system using predicate subtyping. Availability of parametric polymorphism in PVS makes it possible to represent XML sequences and sets via PVS theories. Transaction verification methodology is based on declarative, logic-based specification of frame constraints and the actual transaction updates. XML applications, including constraints typical for XML schemas, such as keys and referential integrity, have been verified.