Assertional Specification and Verification Using PVS of the Steam Boiler Control System
Formal Methods for Industrial Applications, Specifying and Programming the Steam Boiler Control (the book grow out of a Dagstuhl Seminar, June 1995).
Developing XML Documents with Guaranteed ``Good'' Properties
ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
Semantic Data Modeling Using XML Schemas
ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
Hardware Verification Using PVS
Formal Hardware Verification - Methods and Systems in Comparison
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
Designing Semistructured Databases Using ORA-SS Model
WISE '01 Proceedings of the Second International Conference on Web Information Systems Engineering (WISE'01) Volume 1 - Volume 1
An introduction to description logics
The description logic handbook
A normal form for XML documents
ACM Transactions on Database Systems (TODS)
Strong functional dependencies and their application to normal forms in XML
ACM Transactions on Database Systems (TODS)
Semistructured Database Design (Web Information Systems Engineering and Internet Technologie)
Semistructured Database Design (Web Information Systems Engineering and Internet Technologie)
Removing XML data redundancies using functional and equality-generating dependencies
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
Validating semistructured data using OWL
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
| Hi-index | 0.00 |
Semistructured data is now widely used in both web applications and database systems. Much of the research into this area defines algorithms that transform the data and schema, such as data integration, change management, view definition, and data normalization. While some researchers have defined a formalism for the work they have undertaken, there is no widely accepted formalism that can be used for the comparison of algorithms within these areas. The requirements of a formalism that would be helpful in these situations are that it must capture all the necessary semantics required to model the algorithms, it should not be too complex and it should be easy to use. This paper describes a first step in defining such a formalism. We have modelled the semantics expressed in the ORA-SS (Object Relationship Attribute data model for SemiStructured data) data modelling notation in two formal languages that have automatic verification tools. We compare the two models and present the findings.