Automatic verification of database transaction safety
ACM Transactions on Database Systems (TODS)
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
Checking Satisfactions of XML Referential Integrity Constraints
AMT '09 Proceedings of the 5th International Conference on Active Media Technology
Revealing the X/O impedance mismatch: changing lead into gold
SSDGP'06 Proceedings of the 2006 international conference on Datatype-generic programming
Verification technology for object-oriented/XML transactions
ICOODB'09 Proceedings of the Second international conference on Object databases
ICOODB'09 Proceedings of the Second international conference on Object databases
Verification theories for XML schema
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
Automatic versus interactive program verification
Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technology
Hi-index | 0.00 |
This paper presents an object-oriented representation of the core structural and constraint-related features of XML Schema. The structural features are representedwithin the limitations of object-oriented type systems including particles (elements and groups) and type hierarchies (simple and complex types and type derivations). The applicability of the developed representation is demonstrated through a collection of complex object-oriented queries. The main novelty is that features of XML Schema that are not expressible in object-oriented type systems such as range constraints, keys and referential integrity, and type derivation by restriction are specified in an object-oriented assertion language Spec#. An assertion language overcomes major problems in the object-oriented/XML mismatch. It allows specification of schema integrity constraints and transactions that are required to preserve those constraints. Most importantly, Spec# technology comes with automatic static verification of code with respect to the specified constraints. This technology is applied in the paper to transaction verification.