Formal Methods in System Design

, Volume 37, Issue 1, pp 1–60

Theorem prover approach to semistructured data design

  • Scott Uk-Jin Lee
  • Gillian Dobbie
  • Jing Sun
  • Lindsay Groves
Article

DOI: 10.1007/s10703-010-0099-4

Cite this article as:
Lee, S.UJ., Dobbie, G., Sun, J. et al. Form Methods Syst Des (2010) 37: 1. doi:10.1007/s10703-010-0099-4

Abstract

The wide adoption of semistructured data has created a growing need for effective ways to ensure the correctness of its organization. One effective way to achieve this goal is through formal specification and automated verification. This paper presents a theorem proving approach towards verifying that a particular design or organization of semistructured data is correct. We formally specify the semantics of the Object Relationship Attribute data model for Semistructured Data (ORA-SS) modeling notation and its correctness criteria for semistructured data normalization using the Prototype Verification System (PVS). The result is that effective verification on semistructured data models and their normalization can be carried out using the PVS theorem prover.

Keywords

Formal specification Automated verification Semistructured data modeling Schema normalization Theorem proving ORA-SS PVS 

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Scott Uk-Jin Lee
    • 1
  • Gillian Dobbie
    • 2
  • Jing Sun
    • 2
  • Lindsay Groves
    • 3
  1. 1.CEA, LISTLaboratory of Model-driven Engineering for Embedded SystemsGif sur YvetteFrance
  2. 2.Department of Computer ScienceThe University of AucklandAucklandNew Zealand
  3. 3.School of Engineering and Computer ScienceVictoria University of WellingtonWellingtonNew Zealand

Personalised recommendations