VERIFICATION OF DATAFLOW SCHEDULING
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
758 | en_US |
dc.citation.issue |
6 | en_US |
dc.citation.spage |
737 | en_US |
dc.citation.volume |
18 | en_US |
dc.citation.woscount |
0 | |
dc.contributor.author |
Chiang, Tsung-Hsi | en_US |
dc.contributor.author |
Dung, Lan-Rong | en_US |
dc.contributor.department |
電控工程研究所 | zh_TW |
dc.contributor.department |
Institute of Electrical and Control Engineering | en_US |
dc.date.accessioned |
2014-12-08T15:11:01Z | |
dc.date.available |
2014-12-08T15:11:01Z | |
dc.date.issued |
2008-09-01 | en_US |
dc.description.abstract |
This paper presents the formal verification method for high-level synthesis (HLS) to detect design errors of dataflow algorithms by using Petri Net (PN) and symbolic-model-verifier (SMV) techniques. Formal verification in high-level design means architecture verification, which is different from functional verification in register transfer level (RTL). Generally, dataflow algorithms need algorithmic transformations to achieve optimal goals and also need design scheduling to allocate process or resources before mapping on a silicon. However, algorithmic transformations and design scheduling are error-prone. In order to detect high-level faults, high-level verification is applied to verify the synthesis results in HLS. Instead of applying Boolean algebra in traditional verification, this paper adopts both Petri Net theory and SMV model checker to verify the correctness of the synthesis results of the high-level dataflow designs. In the proposed hybrid verification method, a high-level designor DUV (design-under-verification) is first transformed into a Petri Net model. Then, Petri Net theory is applied to check the correctness of its algorithmic transformations of HLS, and the SMV model checker is used to verify the correctness of the design scheduling. We presented two approaches to realize the proposed verification method and concluded the best one who outperforms the other in terms of processing speed and resource usage. | en_US |
dc.identifier.doi |
10.1142/S0218194008003891 | en_US |
dc.identifier.issn |
0218-1940 | en_US |
dc.identifier.journal |
INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1142/S0218194008003891 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/8440 | |
dc.identifier.wosnumber |
WOS:000262084900002 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Formal verification | en_US |
dc.subject |
high-level synthesis | en_US |
dc.subject |
dataflow | en_US |
dc.subject |
Petri net | en_US |
dc.subject |
model checking | en_US |
dc.title |
VERIFICATION OF DATAFLOW SCHEDULING | en_US |
dc.type |
Article | en_US |
檔案
- 000262084900002.pdf (642.0 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Chiang, T.-H., & Dung, L.-R. (2008). VERIFICATION OF DATAFLOW SCHEDULING. INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING, 18(6), 737–758. https://doi.org/10.1142/S0218194008003891
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/8440