subtyping algorithm of regular tree grammars with disjoint production rules

	subtyping algorithm of regular tree grammars with disjoint production rules
	Chen Lei; Chen Haiming
	2010
会议名称	7th International Colloquium on Theoretical Aspects of Computing, ICTAC 2010
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	45-59
会议日期	September
会议地点	Natal, Brazil
出版地	Germany
出版者	THEORETICAL ASPECTS OF COMPUTING
ISSN	3029743
ISBN	3642148077
部门归属	(1) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China
摘要	Most type systems of statically typed XML processing languages are implemented based on regular expression types, where subtyping reduces to checking inclusion between tree automata, which is not efficient enough. The paper proposes the regular tree grammars with disjoint production rules and presents a subtyping method which is based on checking inclusion between regular expressions. The commonly used XML schema languages such as DTDs and XML Schemas can be described by the restricted grammars. The method works in a bottom-up way on the structures of type expressions. According to the regular expressions used in XML schema languages, different inclusion algorithms can be applied to this method. Experiments show the effectiveness of our method. © 2010 Springer-Verlag.
关键词	Algorithms Trees (Mathematics)
主办者	Univ Fed Rio Grande Norte, Univ York
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/8922
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Chen Lei,Chen Haiming. subtyping algorithm of regular tree grammars with disjoint production rules[C]. Germany:THEORETICAL ASPECTS OF COMPUTING,2010:45-59.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
subtyping algorithm （325KB）			开放获取	--	请求全文