定时验证:对错误路径的新理解

[1992] Proceedings The European Conference on Design Automation Pub Date : 1992-03-16 DOI:10.1109/EDAC.1992.205960

E. Bolender, Martin Lipp

{"title":"定时验证:对错误路径的新理解","authors":"E. Bolender, Martin Lipp","doi":"10.1109/EDAC.1992.205960","DOIUrl":null,"url":null,"abstract":"Despite the growing number of timing verification algorithms, a concise formal approach for the definition of false paths is missing. In this paper, based on the logical and delay properties of the discussed circuits, some precise formal definitions are derived with two major advantages. First, they make the understanding of false paths surprisingly intelligible. Second, they are independent of algorithmic interpretations because of their formal derivation.<<ETX>>","PeriodicalId":285019,"journal":{"name":"[1992] Proceedings The European Conference on Design Automation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Timing verification: a new understanding of false paths\",\"authors\":\"E. Bolender, Martin Lipp\",\"doi\":\"10.1109/EDAC.1992.205960\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Despite the growing number of timing verification algorithms, a concise formal approach for the definition of false paths is missing. In this paper, based on the logical and delay properties of the discussed circuits, some precise formal definitions are derived with two major advantages. First, they make the understanding of false paths surprisingly intelligible. Second, they are independent of algorithmic interpretations because of their formal derivation.<<ETX>>\",\"PeriodicalId\":285019,\"journal\":{\"name\":\"[1992] Proceedings The European Conference on Design Automation\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-03-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings The European Conference on Design Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EDAC.1992.205960\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings The European Conference on Design Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDAC.1992.205960","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

尽管时序验证算法的数量不断增加，但缺少一种定义假路径的简明形式化方法。本文根据所讨论电路的逻辑和延迟特性，导出了一些精确的形式定义，这些定义具有两个主要优点。首先，它们让错误路径的理解变得出奇地容易。其次，由于它们的形式推导，它们独立于算法解释

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

查看原文本刊更多论文

Timing verification: a new understanding of false paths

Despite the growing number of timing verification algorithms, a concise formal approach for the definition of false paths is missing. In this paper, based on the logical and delay properties of the discussed circuits, some precise formal definitions are derived with two major advantages. First, they make the understanding of false paths surprisingly intelligible. Second, they are independent of algorithmic interpretations because of their formal derivation.<>

求助全文

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

来源期刊

[1992] Proceedings The European Conference on Design Automation

自引率

0.00%

发文量