WEKO3
アイテム
Constant Propagation in CRIL by Bidirectional Data Flow Analysis
https://ipsj.ixsq.nii.ac.jp/records/235040
https://ipsj.ixsq.nii.ac.jp/records/2350402ef85c39-1f92-4557-8858-be57f03578a1
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-TPRO1703002.pdf (665.3 kB)
2026年6月18日からダウンロード可能です。
|
Copyright (c) 2024 by the Information Processing Society of Japan
|
|
| 非会員：¥0, IPSJ:学会員：¥0, PRO:会員：¥0, DLIB:会員：¥0 | ||
| Item type | Trans(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2024-06-18 | |||||||||
| タイトル | ||||||||||
| タイトル | Constant Propagation in CRIL by Bidirectional Data Flow Analysis | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | Constant Propagation in CRIL by Bidirectional Data Flow Analysis | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [通常論文] reversible computation, concurrency, data flow analysis, optimization, constant propagation | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| Graduate School of Informatics, Nagoya University | ||||||||||
| 著者所属 | ||||||||||
| Graduate School of Informatics, Nagoya University | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Graduate School of Informatics, Nagoya University | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Graduate School of Informatics, Nagoya University | ||||||||||
| 著者名 |
Shunya, Oguchi
× Shunya, Oguchi
× Shoji, Yuen
|
|||||||||
| 著者名(英) |
Shunya, Oguchi
× Shunya, Oguchi
× Shoji, Yuen
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | We present bidirectional data flow analysis for constant propagation in the concurrent reversible intermediate language, CRIL, proposed by the authors. A CRIL program consists of basic blocks, each with one instruction enclosed by entry and exit labels. In CRIL, basic blocks are executed concurrently in forward and backward directions, keeping causal safety and causal liveness as the fundamental correctness for reversibility. To optimize CRIL programs, we focus on bidirectional data flow among basic blocks. We propose data flow analysis among basic blocks to reveal data flow conflicts in both directions. The bidirectional data flow analysis enables the backward constant propagation in addition to the forward one. We define directed edges labeled variables among basic blocks for possible forward data flows and give directed edges for possible backward data flows using the edges of foward data flows. It is shown that the forward and backward data flow edges cover all the data flows in executing the program in either direction. Based on this soundness property, if a constant propagates by the data flow edges, then it propagates in all concurrent executions of both directions. We show bidirectional constant propagation in a CRIL example by the data flow analysis. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.32(2024) (online) ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | We present bidirectional data flow analysis for constant propagation in the concurrent reversible intermediate language, CRIL, proposed by the authors. A CRIL program consists of basic blocks, each with one instruction enclosed by entry and exit labels. In CRIL, basic blocks are executed concurrently in forward and backward directions, keeping causal safety and causal liveness as the fundamental correctness for reversibility. To optimize CRIL programs, we focus on bidirectional data flow among basic blocks. We propose data flow analysis among basic blocks to reveal data flow conflicts in both directions. The bidirectional data flow analysis enables the backward constant propagation in addition to the forward one. We define directed edges labeled variables among basic blocks for possible forward data flows and give directed edges for possible backward data flows using the edges of foward data flows. It is shown that the forward and backward data flow edges cover all the data flows in executing the program in either direction. Based on this soundness property, if a constant propagates by the data flow edges, then it propagates in all concurrent executions of both directions. We show bidirectional constant propagation in a CRIL example by the data flow analysis. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.32(2024) (online) ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AA11464814 | |||||||||
| 書誌情報 |
情報処理学会論文誌プログラミング（PRO） 巻 17, 号 3, 発行日 2024-06-18 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7802 | |||||||||
| 出版者 | ||||||||||
| 言語 | ja | |||||||||
| 出版者 | 情報処理学会 | |||||||||
