enhanced symbolic simulation of a round-robin arbiter
文献类型：会议论文
| 作者 | Li Yongjian ; Zeng Naiju ; Hung William N. N. ; Song Xiaoyu |
| 出版日期 | 2011 |
| 会议名称 | 29th IEEE International Conference on Computer Design 2011, ICCD 2011 |
| 会议日期 | November 9 |
| 会议地点 | Amherst, MA, United states |
| 关键词 | Asynchronous sequential logic Computer simulation Design Hardware |
| 页码 | 102-107 |
| 中文摘要 | In this work, we present our results on formally verifying hardware design of round-robin arbiter which is the core component in many real network systems. Our approach is enhanced STE, which explores fully symbolic simulation for not only one round of round-robin arbitration, but also the sequential behaviors of the arbiter. Our experiments demonstrate that the enhanced STE specification for real-world hardware design can be finished automatically in a reasonable time and memory usage. © 2011 IEEE. |
| 英文摘要 | In this work, we present our results on formally verifying hardware design of round-robin arbiter which is the core component in many real network systems. Our approach is enhanced STE, which explores fully symbolic simulation for not only one round of round-robin arbitration, but also the sequential behaviors of the arbiter. Our experiments demonstrate that the enhanced STE specification for real-world hardware design can be finished automatically in a reasonable time and memory usage. © 2011 IEEE. |
| 收录类别 | EI |
| 会议主办者 | IEEE; IEEE Circuits and Systems Society; IEEE Computer Society |
| 会议录 | Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors
 |
| 语种 | 英语 |
| ISSN号 | 1063-6404 |
| ISBN号 | 9781457719523 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16253]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Li Yongjian,Zeng Naiju,Hung William N. N.,et al. enhanced symbolic simulation of a round-robin arbiter[C]. 见:29th IEEE International Conference on Computer Design 2011, ICCD 2011. Amherst, MA, United states. November 9. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。