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.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.
