Theorem prover approach to semistructured data design
- Authors
- Lee, Scott Uk-Jin; Dobbie, Gillian; Sun, Jing; Groves, Lindsay
- Issue Date
- Nov-2010
- Publisher
- Kluwer Academic Publishers
- Keywords
- Formal specification; Automated verification; Semistructured data modeling; Schema normalization; Theorem proving; ORA-SS; PVS
- Citation
- Formal Methods in System Design, v.37, no.1, pp.1 - 60
- Indexed
- SCIE
SCOPUS
- Journal Title
- Formal Methods in System Design
- Volume
- 37
- Number
- 1
- Start Page
- 1
- End Page
- 60
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/39424
- DOI
- 10.1007/s10703-010-0099-4
- ISSN
- 0925-9856
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF COMPUTING > ERICA 컴퓨터학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/39424)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.