arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1507.02297cs.LO
收藏

通过计算范围缩减的等价性检验和仿真

Equivalence Checking and Simulation By Computing Range Reduction

Eugene Goldberg

摘要:

我们介绍了新的方法的等价性检查和模拟的基础上计算范围减少(CRR)。给定一个组合电路$N$,CRR问题是计算如果不考虑$N$的一组输入,则从$N$的范围中消失的一组输出。重要的是,在许多情况下,即使计算$N$的整个范围是不可行的,也可以有效地找到范围缩减。通过CRR解决等价性检查有助于生成模仿“切割传播”方法的等价性证明。商业工具已经成功地使用了这种方法的有限版本。通过仿真对电路$N$进行功能验证可以被视为降低计算$N$范围的复杂性的一种方式。不是查找$N$的整个范围并检查它是否包含错误输出,而是仅针对一个输入计算这样的范围。CRR仿真提供了一种处理复杂距离计算的替代方法。其思想是排除$N$的输入子集,并计算由这种排除引起的范围减小。如果消失的输出集包含错误输出,则$N$存在错误。

英文摘要:

We introduce new methods of equivalence checking and simulation based on Computing Range Reduction (CRR). Given a combinational circuit $N$, the CRR problem is to compute the set of outputs that disappear from the range of $N$ if a set of inputs of $N$ is excluded from consideration. Importantly, in many cases, range reduction can be efficiently found even if computing the entire range of $N$ is infeasible. Solving equivalence checking by CRR facilitates generation of proofs of equivalence that mimic a "cut propagation" approach. A limited version of such an approach has been successfully used by commercial tools. Functional verification of a circuit $N$ by simulation can be viewed as a way to reduce the complexity of computing the range of $N$. Instead of finding the entire range of $N$ and checking if it contains a bad output, such a range is computed only for one input. Simulation by CRR offers an alternative way of coping with the complexity of range computation. The idea is to exclude a subset of inputs of $N$ and compute the range reduction caused by such an exclusion. If the set of disappeared outputs contains a bad one, then $N$ is buggy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑