Restricted symbolic evaluation is fast and useful
Restricted symbolic evaluation is fast and useful
复制标题
受限符号求值快速且有用
DOI：
--
复制
发表时间：
1989
期刊：
影响因子：
--
通讯作者：
V. Pitchumani
中科院分区：
文献类型：
--
作者：
J. L. Carter;B. Rosen;Gordon L. Smith;V. Pitchumani
本文提出了一种两兆和三个值的模拟方法。模拟传播的值包括熟悉的0、1和X，以及命名未知数及其形式否定的集合。每个值都适合一个计算机字。这种受限符号评估的应用包括嵌入式阵列电路的设计规则检查和时序验证。作者简要探讨了这两个应用程序。通过仔细选择组合两个zillion和三个值的规则，以及值的表示，可以使模拟具有惊人的效率。作者提出了两个变体和每个变体的实现。两者都很快;速度越快，产生的信息就越少。<<ETX>>
A method is presented for simulation with two zillion and three values. The values that are propagated by the simulation include the familiar 0, 1, and X and also a collection of named unknowns and their formal negations. Each value fits into a single computer word. Applications of this restricted symbolic evaluation include design rule checking for circuits with embedded arrays and timing verification. The authors explore these two applications briefly. By carefully choosing rules for combining the two zillion and three values, and the representations of the values, it is possible to make simulation surprisingly efficient. The authors present two variants and an implementation of each. Both are fast; the faster one sometimes yields less information.<<ETX>>