Abstract
XML Schema types and structures are represented as theories of a verification system, PVS, for proving properties related to XML schemas. 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. Transaction verification methodology is based on declarative, logic-based specification of frame constraints and the actual transaction updates. XML applications, including constraints typical for XML schemas, such as keys and referential integrity, have been verified.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Alagić, S., Bernstein, P.A.: A model theory for generic schema management. In: Ghelli, G., Grahne, G. (eds.) DBPL 2001. LNCS, vol. 2397, pp. 228–246. Springer, Heidelberg (2002)
Alagić, S., Logan, J.: Consistency of Java transactions. In: Lausen, G., Suciu, D. (eds.) DBPL 2003. LNCS, vol. 2921, pp. 71–89. Springer, Heidelberg (2004)
Alagić, S., Briggs, D.: Semantics of Objectified XML. In: Lausen, G., Suciu, D. (eds.) DBPL 2003. LNCS, vol. 2921, pp. 147–165. Springer, Heidelberg (2004)
Alagić, S., Kouznetsova, S.: Behavioral compatibility of self-typed theories. In: Magnusson, B. (ed.) ECOOP 2002. LNCS, vol. 2374, pp. 585–608. Springer, Heidelberg (2002)
Archer, M., Di Vito, B., Munoz, C.: Developing user strategies in PVS: A tutorial. In: Proceedings of STRATA 2003 (2003)
Buneman, P., Davidson, S., Fan, W., Hara, C., Tan, W.-C.: Reasoning about keys for XML. In: Ghelli, G., Grahne, G. (eds.) DBPL 2001. LNCS, vol. 2397, pp. 133–148. Springer, Heidelberg (2002)
Fan, W., Simeon, J.: Integrity constraints for XML. Journal of Computer and System Sciences 66, 254–291 (2003)
Hosoya, H., Pierce, B.: XDuce: A typed XML processing language. ACM Transactions on Internet Technology 3(2), 117–148 (2003)
Hosoya, H., Frisch, A., Castagna, G.: Parametric polymorphism for XML. In: Proceedings of POPL 2005, pp. 50–62. ACM, New York (2005)
Kuper, G.M., Simeon, J.: Subsumption for XML types. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 331–345. Springer, Heidelberg (2000)
Owre, S., Shankar, N., Rushby, J.M., Stringer-Clavert, D.W.J.: PVS Language Reference. SRI International, Computer Science Laboratory, Menlo Park, California
Owre, S., Shankar, N.: Writing PVS proof strategies, Computer Science Laboratory, SRI International, http://www.csl.sri.com
Sheard, T., Stemple, D.: Automatic verification of database transaction safety. ACM Transactions on Database Systems 14, 322–368 (1989)
Spelt, D., Even, S.: A theorem prover-based analysis tool for object-oriented databases. In: Cleaveland, W.R. (ed.) ETAPS 1999 and TACAS 1999. LNCS, vol. 1579, pp. 375–389. Springer, Heidelberg (1999)
Simeon, J., Wadler, P.: The Essence of XML. In: Proceedings of POPL 2003, pp. 1–13. ACM, New York (2003)
W3C: XML Schema Part 0: Primer, 2nd edn., http://www.w3.org/TR/xmlschema-0/
W3C: XML Schema Part 1: Structures, 2nd edn., http://www.w3.org/TR/xmlschema-1/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alagić, S., Royer, M., Briggs, D. (2006). Verification Theories for XML Schema. In: Bell, D.A., Hong, J. (eds) Flexible and Efficient Information Handling. BNCOD 2006. Lecture Notes in Computer Science, vol 4042. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11788911_26
Download citation
DOI: https://doi.org/10.1007/11788911_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35969-2
Online ISBN: 978-3-540-35971-5
eBook Packages: Computer ScienceComputer Science (R0)