Verification of XML Transformation based on Higher-Order Narrowing
Project/Area Number |
23500021
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Multi-year Fund |
Section | 一般 |
Research Field |
Fundamental theory of informatics
|
Research Institution | The University of Aizu |
Principal Investigator |
SUZUKI TARO 会津大学, コンピュータ理工学部, 上級准教授 (90272179)
|
Co-Investigator(Kenkyū-buntansha) |
OKUI Satoshi 中部大学, 工学部, 准教授 (00283515)
|
Project Period (FY) |
2011 – 2013
|
Project Status |
Completed (Fiscal Year 2013)
|
Budget Amount *help |
¥3,640,000 (Direct Cost: ¥2,800,000、Indirect Cost: ¥840,000)
Fiscal Year 2013: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2012: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2011: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
|
Keywords | ナローイング / XML / 正規表現 |
Research Abstract |
We investigated theoretical properties of narrowing for hedge rewrite systems as a verification of XML transformation. A narrowing calculus is designed for left-linear, right-flat constructor-based hedge rewrite systems. Given an equation with an application of transformation function to an XML document in the one side and an undesirable transformation result in the other side, the narrowing calculus produces a narrowing derivation and a unifier of the final equation in the derivation as an instance of undesirable transformation. We have shown that the narrowing calculus is sound and complete, and preunification problem associated with the calculus is decidable.
|
Report
(4 results)
Research Products
(10 results)