Precise and Fast XML typechecking algorithm based on transducer theory
Project/Area Number |
19700007
|
Research Category |
Grant-in-Aid for Young Scientists (B)
|
Allocation Type | Single-year Grants |
Research Field |
Fundamental theory of informatics
|
Research Institution | The University of Tokyo |
Principal Investigator |
HOSOYA Haruo (HARUO Hosoya) The University of Tokyo, 大学院・情報理工学系研究科, 講師 (50335296)
|
Project Period (FY) |
2007 – 2010
|
Project Status |
Completed (Fiscal Year 2010)
|
Budget Amount *help |
¥3,920,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥720,000)
Fiscal Year 2010: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2009: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2008: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2007: ¥800,000 (Direct Cost: ¥800,000)
|
Keywords | 計算機言語 / XML / オートマトン / ツリーオートマトン / ツリートランスデューサ / 型検査 / ツリ-オートマトン / ツリ-トランスデューサ |
Research Abstract |
Research has been conducted on typechecking and related techniques for languages specialized to processing of XML, an international standard data format. In order to treat the special functionality of XML called schemas, theory of tree transducers has been exploited and an efficient typechecking algorithm has been developed by using alternating tree automata. Furthermore, transducers extended with multiple return values, XML query based on monadic second-order logic, and XML polymorphism have also been studied. All these results have been summarized in a monograph written in English.
|
Report
(6 results)
Research Products
(21 results)