| Item type |
Trans(1) |
| 公開日 |
2023-06-29 |
| タイトル |
|
|
タイトル |
Templatizing Revision Operators for Synthesizing Bidirectional Programs with Functional Dependencies |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Templatizing Revision Operators for Synthesizing Bidirectional Programs with Functional Dependencies |
| 言語 |
|
|
言語 |
eng |
| キーワード |
|
|
主題Scheme |
Other |
|
主題 |
[発表概要, Unrefereed Presentatin Abstract] |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_6501 |
|
資源タイプ |
journal article |
| 著者所属 |
|
|
|
The Graduate University for Advanced Studies, SOKENDAI／National Institute of Informatics |
| 著者所属 |
|
|
|
The Graduate University for Advanced Studies, SOKENDAI／National Institute of Informatics |
| 著者所属 |
|
|
|
Peking University／National Institute of Informatics |
| 著者所属(英) |
|
|
|
en |
|
|
The Graduate University for Advanced Studies, SOKENDAI / National Institute of Informatics |
| 著者所属(英) |
|
|
|
en |
|
|
The Graduate University for Advanced Studies, SOKENDAI / National Institute of Informatics |
| 著者所属(英) |
|
|
|
en |
|
|
Peking University / National Institute of Informatics |
| 著者名 |
Bach, Nguyen Trong
Kanae, Tsushima
Zhenjiang, Hu
|
| 著者名(英) |
Bach, Nguyen Trong
Kanae, Tsushima
Zhenjiang, Hu
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Automatic synthesis of bidirectional programs is practically important to solve the view update problem in the database community since manually writing such programs is non-trivial. A bidirectional program is typically a well-behaved pair of two components - a forward program that defines a view over a source and a backward program that translates view updates to source updates. Existing synthesis methods, however, cannot cope with relation constraints like functional dependencies, resulting in the failure to find a program that is consistent with the user-given specification. In this work, we aim at the synthesis of bidirectional programs from examples with functional dependencies. We propose a method for forward propagation of functional dependencies from the source through intermediate relations to the view. We also templatize revision operators, which helps to strengthen the space in the template-based synthesis of atomic backward programs that could be combined into a complete backward program. We have fully implemented our proposed method and integrated it with an adaptive Datalog synthesizer of bidirectional programs from examples. The experimental results show that our work is realistically useful. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Automatic synthesis of bidirectional programs is practically important to solve the view update problem in the database community since manually writing such programs is non-trivial. A bidirectional program is typically a well-behaved pair of two components - a forward program that defines a view over a source and a backward program that translates view updates to source updates. Existing synthesis methods, however, cannot cope with relation constraints like functional dependencies, resulting in the failure to find a program that is consistent with the user-given specification. In this work, we aim at the synthesis of bidirectional programs from examples with functional dependencies. We propose a method for forward propagation of functional dependencies from the source through intermediate relations to the view. We also templatize revision operators, which helps to strengthen the space in the template-based synthesis of atomic backward programs that could be combined into a complete backward program. We have fully implemented our proposed method and integrated it with an adaptive Datalog synthesizer of bidirectional programs from examples. The experimental results show that our work is realistically useful. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AA11464814 |
| 書誌情報 |
情報処理学会論文誌プログラミング（PRO）
巻 16,
号 2,
p. 39-39,
発行日 2023-06-29
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
1882-7802 |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-TPRO1602016.pdf (32.1 kB)
