Eighth IEEE International High-Level Design Validation and Test Workshop最新文献

筛选
英文 中文
Relating vehicle-level and network-level reliability through high-level fault injection 通过高级故障注入将车辆级和网络级可靠性联系起来
Eighth IEEE International High-Level Design Validation and Test Workshop Pub Date : 2003-11-12 DOI: 10.1109/HLDVT.2003.1252477
Fulvio Corno, P. Gabrielli, S. Tosato
{"title":"Relating vehicle-level and network-level reliability through high-level fault injection","authors":"Fulvio Corno, P. Gabrielli, S. Tosato","doi":"10.1109/HLDVT.2003.1252477","DOIUrl":"https://doi.org/10.1109/HLDVT.2003.1252477","url":null,"abstract":"This paper presents some recent results to improve the evaluation of reliability due to network connections in automotive environments. Evaluation is based on the adoption of performance thresholds aiming at detecting performance loss at particular types of fault occurrence. For this activity we modeled the vehicle network at the functional level and then integrated it into a complete vehicle model describing both electronic and mechanical behavior; in this way, it is possible to build an automated fault injection environment to forecast the effects of faults at the network level on the vehicle dynamics. Furthermore, an on-line threshold manager permits to interrupt a single simulation when a fault activates an error threshold, reducing the overall campaign simulation time.","PeriodicalId":344813,"journal":{"name":"Eighth IEEE International High-Level Design Validation and Test Workshop","volume":"369 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133448480","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Nano, quantum, and molecular computing: are we ready for the validation and test challenges? 纳米、量子和分子计算:我们准备好迎接验证和测试挑战了吗?
Eighth IEEE International High-Level Design Validation and Test Workshop Pub Date : 2003-11-12 DOI: 10.1109/HLDVT.2003.1252467
S. Shukla, R. Karri, S. Goldstein, F. Brewer, K. Banerjee, S. Basu
{"title":"Nano, quantum, and molecular computing: are we ready for the validation and test challenges?","authors":"S. Shukla, R. Karri, S. Goldstein, F. Brewer, K. Banerjee, S. Basu","doi":"10.1109/HLDVT.2003.1252467","DOIUrl":"https://doi.org/10.1109/HLDVT.2003.1252467","url":null,"abstract":"In the recent years a lot of research effort is being spent in the areas of nanotechnology, quantum computation, and biologically inspired computing. As we are faced with various challenges regarding their implementability, architectural visions, and design automation, not much has been done in the field of high level design and validation in looking further into the future, and ponder about the state of the art in design validation and test in such miniscule technology era. Very few reported research work have surfaced on the design and validation challenges for these technologies. However, this certainly is a matter of concern because the technology of the small will be ridden with random faults and hence architectural design strategies need to change to take into account these stochastic models of failures to build robust designs. Validation of such designs also have to capture the stochastic behavioral models of the technology, and hence traditional validation and testing techniques will not work directly. Are we getting ready with our theory; technology and tools to address these challenges? This futuristic panel asks technology and computer aided design experts, as well as finding agency program managers questions about the technological barriers to be surpassed, as well as how the funding agencies such as NSF are ramping up for this technological future.","PeriodicalId":344813,"journal":{"name":"Eighth IEEE International High-Level Design Validation and Test Workshop","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130963982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
High-level test generation for hardware testing and software validation 为硬件测试和软件验证生成高级测试
Eighth IEEE International High-Level Design Validation and Test Workshop Pub Date : 2003-11-12 DOI: 10.1109/HLDVT.2003.1252488
O. Goloubeva, M. Reorda, M. Violante
{"title":"High-level test generation for hardware testing and software validation","authors":"O. Goloubeva, M. Reorda, M. Violante","doi":"10.1109/HLDVT.2003.1252488","DOIUrl":"https://doi.org/10.1109/HLDVT.2003.1252488","url":null,"abstract":"It is now common for design teams to develop systems where hardware and software components cooperate; they are thus facing the challenging task of validating and testing systems where hardware and software parts exist. In this paper a high-level test generation approach is presented, which is able to produce input stimuli that can be fruitfully exploited for test and validation purposes of both hardware and software components. Experimental results are reported showing that the proposed approach produces high quality vectors in terms of the adopted metrics for hardware and software faults.","PeriodicalId":344813,"journal":{"name":"Eighth IEEE International High-Level Design Validation and Test Workshop","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131018461","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Matching in the presence of don't cares and redundant sequential elements for sequential equivalence checking 在不关心和冗余序列元素存在的情况下进行匹配,以进行序列等价性检查
Eighth IEEE International High-Level Design Validation and Test Workshop Pub Date : 2003-11-12 DOI: 10.1109/HLDVT.2003.1252486
S. Rahim, B. Rouzeyre, L. Torres, J. Rampon
{"title":"Matching in the presence of don't cares and redundant sequential elements for sequential equivalence checking","authors":"S. Rahim, B. Rouzeyre, L. Torres, J. Rampon","doi":"10.1109/HLDVT.2003.1252486","DOIUrl":"https://doi.org/10.1109/HLDVT.2003.1252486","url":null,"abstract":"Full sequential equivalence checking by state space traversal has been shown to be unpractical for large designs. To address state space explosion new approaches have been proposed that exploit structural characteristics of a design and make use of multiple analysis engines (e.g. BDDs, Simulation, SAT) to transform the sequential equivalence checking problem into a combinational equivalence checking problem. While these approaches, based on induction techniques, have been successful in general, they are not able to reach proof of equivalence in presence of complex transformations between the reference design and its implementation. One of these transformations is redundant Flip-Flops (FFs) removal. FFs may be removed by redundancy removal, or don't care optimization techniques applied by synthesis tools. Consequently, some FFs in the reference design may have no equivalent FFs in the implementation net-list. Latest researches in this area have proposed specific solutions for particular cases. Matching in the presence of redundant constant input FFs has been addressed and identification of sequential redundancy is performed. This paper presents an indepth study of some possible causes of unmatched FFs due to redundancy removal, and proposes a generic approach to achieve prove of equivalence in presence of redundant FFs. Our approach is independent from specific synthesis transformations. It is able to achieve matching in presence of complex redundancies, and is able to perform formal equivalence checking in presence of don't cares. The experimental results show a significant improvement in the matching rates of FFs when compared to industrial equivalence checking tools. This higher matching is directly translated to a higher success rate in proving equivalency.","PeriodicalId":344813,"journal":{"name":"Eighth IEEE International High-Level Design Validation and Test Workshop","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134257911","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A method for the evaluation of behavioral fault models 行为错误模型的评估方法
Eighth IEEE International High-Level Design Validation and Test Workshop Pub Date : 2003-11-12 DOI: 10.1109/HLDVT.2003.1252492
Emilio Gaudette, M. Moussa, I. Harris
{"title":"A method for the evaluation of behavioral fault models","authors":"Emilio Gaudette, M. Moussa, I. Harris","doi":"10.1109/HLDVT.2003.1252492","DOIUrl":"https://doi.org/10.1109/HLDVT.2003.1252492","url":null,"abstract":"Many fault models have been proposed which attempt to capture design errors in behavioral descriptions, but these fault models have never been quantitatively evaluated. The essential question which must be answered about any fault model is, \"If all faults in this model are detected, is the design guaranteed to be correct?\" In this paper we present a method to examine the degree to which an arbitrary fault model can ensure the detection of all design errors. The method involves comparing fault coverage to error coverage as defined by a practical design error model which we describe. We have employed our method to perform a limited analysis of the statement and branch coverage fault models.","PeriodicalId":344813,"journal":{"name":"Eighth IEEE International High-Level Design Validation and Test Workshop","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132851227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Enhancing SAT-based equivalence checking with static logic implications 通过静态逻辑含义增强基于sat的等价性检查
Eighth IEEE International High-Level Design Validation and Test Workshop Pub Date : 2003-11-12 DOI: 10.1109/HLDVT.2003.1252476
Rajat Arora, M. Hsiao
{"title":"Enhancing SAT-based equivalence checking with static logic implications","authors":"Rajat Arora, M. Hsiao","doi":"10.1109/HLDVT.2003.1252476","DOIUrl":"https://doi.org/10.1109/HLDVT.2003.1252476","url":null,"abstract":"We propose a novel technique to improve SAT-based Combinational Equivalence Checking (CEC) by statically adding meaningful clauses to the CNF formula of the miter circuit. A fast preprocessing quickly builds up the implication graph for the miter circuit under verification, resulting in a large set of direct, indirect and extended backward implications. The non-trivial implications are converted into two-literal clauses and added to the miter CNF database. These added clauses constrain the search space, and provide correlation among the different variables, which enhances the Boolean Constraint Propagation (BCP). Experimental results on ISCAS'85 CEC instances show that with the added clauses, an average speedup of more than 950x was achieved.","PeriodicalId":344813,"journal":{"name":"Eighth IEEE International High-Level Design Validation and Test Workshop","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115105019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
ATPG-based preimage computation: efficient search space pruning with ZBDD 基于atpg的原图像计算:基于ZBDD的高效搜索空间剪枝
Eighth IEEE International High-Level Design Validation and Test Workshop Pub Date : 2003-07-28 DOI: 10.1109/HLDVT.2003.1252484
Kameshwar Chandrasekar, M. Hsiao
{"title":"ATPG-based preimage computation: efficient search space pruning with ZBDD","authors":"Kameshwar Chandrasekar, M. Hsiao","doi":"10.1109/HLDVT.2003.1252484","DOIUrl":"https://doi.org/10.1109/HLDVT.2003.1252484","url":null,"abstract":"Computing image/preimage is a fundamental step in formal verification of hardware systems. Conventional OBDD-based methods for formal verification suffer from spatial explosion, since OBDDs can grow exponentially in large designs. On the other hand, SAT/ATPG based methods are less demanding on memory. But the run-time can be huge for these methods, since they must explore an exponential search space. In order to reduce this temporal explosion of SAT/ATPG based methods, efficient learning techniques are needed. In this paper, we present a new ZBDD based method to compactly store and efficiently search previously explored search-states for 'ATPG-based preimage computation'. We learn front these search-states and avoid searching their subsets or supersets. Both,solution and conflict subspaces are pruned based on simple set operations using ZBDDs. We integrate our techniques into an ATPG engine and demonstrate their efficiency on ISCAS '89 benchmark circuits. Experimental results show that significant search-space pruning for preimage computation is achieved, compared to previous methods.","PeriodicalId":344813,"journal":{"name":"Eighth IEEE International High-Level Design Validation and Test Workshop","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125473339","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信