Hazard Checking of Asynchronous Circuits : A New Approach(高信頼アルゴリズム,ディペンダブルコンピュータシステムとセキュリティ技術及び一般)
スポンサーリンク
概要
- 論文の詳細を見る
We present a new framework to express the semantics of asynchronous circuits, and as an application, an algorithm that will check an implementation given as a netlist against a specification given as a state graph (SG). The algorithm is based on an exploration of the specification that computes certain information (as symbolic states) about the corresponding implementation states, which information is represented as a boolean formula. The algorithm is efficient, can be easily extended so as to use timing informations, and in case of hazards, can provide the user with extensive and easy-to-use information about the cause of the hazard. While it induces potential conservativeness, we did not encounter such examples of false negatives.
- 社団法人電子情報通信学会の論文
- 2006-04-07
著者
-
Myers Chris
University Of Utah
-
BEAL Frederic
Tokyo Institute of Technology
-
YONEDA Tomohiro
National Institute of Informatics
-
Yoneda Tomohiro
National Inst. Of Informatics Tokyo Jpn
関連論文
- Hazard Checking of Asynchronous Circuits : A New Approach(高信頼アルゴリズム,ディペンダブルコンピュータシステムとセキュリティ技術及び一般)
- Hazard Checking of Asynchronous Circuits: A New Approach(高信頼アルゴリズム,ディペンダブルコンピュータシステムとセキュリティ技術及び一般)
- Failure Trace Analysis of Timed Circuits for Automatic Timing Constraints Derivation(Dependable Computing)
- Partial Order Reduction for Timed Circuit Verification Based on Level Oriented Model(Verification and Dependability Analysis)(Dependable Computing)
- Partial Order Reduction for Timed Circuit Verification Based on Level Oriented Model
- Modular Synthesis of Timed Circuits Using Partial Order Reduction
- 時間付き信号遷移グラフの効率的縮約について(VLSIの設計/検証/テスト及び一般(デザインガイア))
- 時間付き信号遷移グラフの効率的縮約について(VLSIの設計/検証/テスト及び一般(デザインガイア))
- 時間付き信号遷移グラフの効率的縮約について(VLSIの設計/検証/テスト及び一般(デザインガイア))
- 時間付き信号遷移グラフの効率的縮約について(VLSIの設計/検証/テスト及び一般(デザインガイア))