开关级电路增量等效性验证中符号仿真结果的重用研究

Proceedings Design, Automation and Test in Europe Pub Date : 1998-02-23 DOI:10.1109/DATE.1998.655923

L. Ribas-Xirgo, J. Carrabina-Bordoll

{"title":"开关级电路增量等效性验证中符号仿真结果的重用研究","authors":"L. Ribas-Xirgo, J. Carrabina-Bordoll","doi":"10.1109/DATE.1998.655923","DOIUrl":null,"url":null,"abstract":"Incremental methods are successfully applied to deal with successive verifications of slightly modified switch-level networks. That is, only those parts affected by the changes are symbolically traversed for verification. In this paper, we present an incremental technique for symbolic simulators which is inspired in both existing incremental techniques for non-symbolic simulators and a token-passing mechanisms in Petri nets.","PeriodicalId":179207,"journal":{"name":"Proceedings Design, Automation and Test in Europe","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the reuse of symbolic simulation results for incremental equivalence verification of switch-level circuits\",\"authors\":\"L. Ribas-Xirgo, J. Carrabina-Bordoll\",\"doi\":\"10.1109/DATE.1998.655923\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Incremental methods are successfully applied to deal with successive verifications of slightly modified switch-level networks. That is, only those parts affected by the changes are symbolically traversed for verification. In this paper, we present an incremental technique for symbolic simulators which is inspired in both existing incremental techniques for non-symbolic simulators and a token-passing mechanisms in Petri nets.\",\"PeriodicalId\":179207,\"journal\":{\"name\":\"Proceedings Design, Automation and Test in Europe\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-02-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Design, Automation and Test in Europe\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DATE.1998.655923\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Design, Automation and Test in Europe","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DATE.1998.655923","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

增量方法成功地应用于处理轻微修改的交换机级网络的连续验证。也就是说，只有那些受更改影响的部分才会被象征性地遍历以进行验证。在本文中，我们提出了一种用于符号模拟器的增量技术，该技术的灵感来自于现有的用于非符号模拟器的增量技术和Petri网中的令牌传递机制。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the reuse of symbolic simulation results for incremental equivalence verification of switch-level circuits

Incremental methods are successfully applied to deal with successive verifications of slightly modified switch-level networks. That is, only those parts affected by the changes are symbolically traversed for verification. In this paper, we present an incremental technique for symbolic simulators which is inspired in both existing incremental techniques for non-symbolic simulators and a token-passing mechanisms in Petri nets.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings Design, Automation and Test in Europe

自引率

0.00%

发文量