使用递归模式的XSLT流性分析

2012 Sixth International Conference on Research Challenges in Information Science (RCIS) Pub Date : 2012-05-16 DOI:10.1109/RCIS.2012.6240419

Pavel Labath

{"title":"使用递归模式的XSLT流性分析","authors":"Pavel Labath","doi":"10.1109/RCIS.2012.6240419","DOIUrl":null,"url":null,"abstract":"We present an algorithm which checks whether a restricted XSLT stylesheet can be applied to documents conforming to a given schema using the Simple Streaming XML Transducer algorithm of Dvořáková et al. [1], [2]. Our contribution consists in extending the set of admissible schemas by allowing the choice constructor and recursive element definitions. We thoroughly analyze every part of the algorithm, prove its correctness and determine the worst case complexity bounds.","PeriodicalId":130476,"journal":{"name":"2012 Sixth International Conference on Research Challenges in Information Science (RCIS)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"XSLT streamability analysis with recursive schemas\",\"authors\":\"Pavel Labath\",\"doi\":\"10.1109/RCIS.2012.6240419\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present an algorithm which checks whether a restricted XSLT stylesheet can be applied to documents conforming to a given schema using the Simple Streaming XML Transducer algorithm of Dvořáková et al. [1], [2]. Our contribution consists in extending the set of admissible schemas by allowing the choice constructor and recursive element definitions. We thoroughly analyze every part of the algorithm, prove its correctness and determine the worst case complexity bounds.\",\"PeriodicalId\":130476,\"journal\":{\"name\":\"2012 Sixth International Conference on Research Challenges in Information Science (RCIS)\",\"volume\":\"103 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Sixth International Conference on Research Challenges in Information Science (RCIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RCIS.2012.6240419\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Sixth International Conference on Research Challenges in Information Science (RCIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RCIS.2012.6240419","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

我们提出了一种算法，该算法使用Dvořáková等人的Simple Streaming XML Transducer算法检查受限制的XSLT样式表是否可以应用于符合给定模式的文档[1]，[2]。我们的贡献包括通过允许选择构造函数和递归元素定义来扩展可接受的模式集。我们对算法的各个部分进行了深入的分析，证明了算法的正确性，并确定了最坏情况下的复杂度界限。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

XSLT streamability analysis with recursive schemas

We present an algorithm which checks whether a restricted XSLT stylesheet can be applied to documents conforming to a given schema using the Simple Streaming XML Transducer algorithm of Dvořáková et al. [1], [2]. Our contribution consists in extending the set of admissible schemas by allowing the choice constructor and recursive element definitions. We thoroughly analyze every part of the algorithm, prove its correctness and determine the worst case complexity bounds.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2012 Sixth International Conference on Research Challenges in Information Science (RCIS)

自引率

0.00%

发文量