Verification of query preservation for tree and graph transformations
| Project/Area Number |
26870270
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Software
Theory of informatics
|
|---|
| Research Institution | Nagoya University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2014-04-01 – 2018-03-31
|
| Project Status |
Completed (Fiscal Year 2017)
|
| Budget Amount *help |
¥3,900,000 (Direct Cost: ¥3,000,000、Indirect Cost: ¥900,000)
Fiscal Year 2016: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2015: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2014: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Keywords | 問合せ保存性 / 木変換器 / 木オートマトン / 関数性 / 問合せ保存 |
|---|
| Outline of Final Research Achievements |
This research aims to investigate the decidability of query preservation for tree and graph transformations. In this work, we first examined the computational complexity of deciding the query preservation problem for some classes of tree transformations and queries. We also studied the query preservation of non-linear tree transformations and gave a decidable sufficient condition of determinacy, a property closely related to query preservation. We provided some notions of query preservation for non-deterministic tree transformations, and we offered some decidability results on the properties for non-deterministic ones.
|
Report
(5 results)
Research Products
(6 results)
