As XPath predicates are involved, XSD 1.1 conditional declarations make difficult the problem of statically verifying whether a type is a legal restriction of its base. The XSD 1.1 current draft adopts a full dynamic approach to the problem. In this paper we propose a hybrid solution (neither completely static, nor completely dynamic) to the same problem.

Casimirri M., Marinelli P., Vitali F. (2008). Optimized Cartesian product: A hybrid approach to derivation-chain checking in XSD 1.1. s.l : s.n [10.4242/BalisageVol1.Marinelli01].

Optimized Cartesian product: A hybrid approach to derivation-chain checking in XSD 1.1

MARINELLI, PAOLO;VITALI, FABIO
2008

Abstract

As XPath predicates are involved, XSD 1.1 conditional declarations make difficult the problem of statically verifying whether a type is a legal restriction of its base. The XSD 1.1 current draft adopts a full dynamic approach to the problem. In this paper we propose a hybrid solution (neither completely static, nor completely dynamic) to the same problem.
2008
Proceedings of Balisage: The Markup Conference 2008. Balisage Series on Markup Technologies.
Casimirri M., Marinelli P., Vitali F. (2008). Optimized Cartesian product: A hybrid approach to derivation-chain checking in XSD 1.1. s.l : s.n [10.4242/BalisageVol1.Marinelli01].
Casimirri M.; Marinelli P.; Vitali F.
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/75316
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact