WEKO3
アイテム
並列処理環境下における関数型プログラムのデバック方式
https://ipsj.ixsq.nii.ac.jp/records/31375
https://ipsj.ixsq.nii.ac.jp/records/31375d5bc6c55-4c89-4c71-b63c-55ccdee843bd
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-PRO84011004.pdf (1.5 MB)
|
Copyright (c) 1984 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | SIG Technical Reports(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 1984-12-14 | |||||||
| タイトル | ||||||||
| タイトル | 並列処理環境下における関数型プログラムのデバック方式 | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Parallel -processing- oriented Algorithmic Bug - detection Method for Functional Programming Languages | |||||||
| 言語 | ||||||||
| 言語 | jpn | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_18gh | |||||||
| 資源タイプ | technical report | |||||||
| 著者所属 | ||||||||
| 日本電信電話公社武蔵野電気通信研究所 | ||||||||
| 著者所属 | ||||||||
| 日本電信電話公社武蔵野電気通信研究所 | ||||||||
| 著者所属 | ||||||||
| 日本電信電話公社武蔵野電気通信研究所 | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Musashino Electrical Communication Laboratory, N.T.T. | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Musashino Electrical Communication Laboratory, N.T.T. | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Musashino Electrical Communication Laboratory, N.T.T. | ||||||||
| 著者名 |
高橋, 直久
× 高橋, 直久
|
|||||||
| 著者名(英) |
Naohisa, Takahashi
× Naohisa, Takahashi
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | A new algorithmic debugging method for functional programming languages named Projected Graph Minimization (PMG) method is proposed. This method detects bugs in programs more efficiently than the conventional divide-and-query algorithm and is especially suitable under highly-parallel computing environment. Dynamic execution history data as well as static dependency data created by a compiler are stored in a relational data-base. Debugging information such as subroutine trace can be retrieved by applying relational algebra operators to the data-base. This approach frees programmers from annoying about where and when programs are executed. The method detects locations of bugs by analyzing the programmer's answers to the queries automatically generated by the debugging system. This paper also clarifies the effectiveness of the proposed method by showing the results of the experimental debugging system for dataflow machines. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | A new algorithmic debugging method for functional programming languages named Projected Graph Minimization (PMG) method is proposed. This method detects bugs in programs more efficiently than the conventional divide-and-query algorithm, and is especially suitable under highly-parallel computing environment. Dynamic execution history data as well as static dependency data created by a compiler are stored in a relational data-base. Debugging information such as subroutine trace can be retrieved by applying relational algebra operators to the data-base. This approach frees programmers from annoying about where and when programs are executed. The method detects locations of bugs by analyzing the programmer's answers to the queries automatically generated by the debugging system. This paper also clarifies the effectiveness of the proposed method by showing the results of the experimental debugging system for dataflow machines. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AN10485570 | |||||||
| 書誌情報 |
情報処理学会研究報告プログラミング（PRO） 巻 1984, 号 55(1984-PRO-011), p. 1-9, 発行日 1984-12-14 |
|||||||
| Notice | ||||||||
| SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. | ||||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
