Program Verification Techniques for XML Schema-based Technologies

Authors

Suad Alagić PhD, University of Southern Maine
Mark Royer, University of Southern Maine
David Briggs PhD, University of Southern MaineFollow

Document Type

Conference Proceeding

Publication Date

9-1-2006

Abstract

Representation and verification techniques for XML Schema types, structures, and applications, in a program verification system PVS are presented. 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. Powerful PVS logic capabilities are used to express complex constraints of XML Schema and its applications. Transaction verification methodology developed in the paper is grounded on declarative, logic-based specification of the frame constraints and the actual transaction updates. A sample XML application given in the paper includes constraints typical for XML schemas such as keys and referential integrity, and in addition ordering and range constraints. The developed proof strategy is demonstrated by a sample transaction verification with respect to this schema. The overall approach has a model theory based on the view of XML types and structures as theories.

Comments

Copyright © SciTePress

Recommended Citation

Alagić, S., Royer, M. & Briggs, D. (2006). Program verification techniques for XML Schema-based technologies. In Proceedings of the First International Conference on Software and Data Technologies, 86-93. doi: 10.5220/0001309400860093