A logic simulator can prove the correctness of a digital circuit when it can be shown that only circuits implementing the system specification will produce a particular response to a sequence of simulation commands. By simulating a circuit symbolically, verification can avoid the combinatorial explosion that would normally occur when evaluating circuit operation over many combinations of input and initial state. In this paper, we describe our methodology for verifying synchrono~ts circuits using the stack circuit of Mead and Conway as an illustrative example.
CITATION STYLE
Bryant, R. E. (1990). Verification of synchronous circuits by symbolic logic simulation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 408 LNCS, pp. 15–24). Springer Verlag. https://doi.org/10.1007/0-387-97226-9_21
Mendeley helps you to discover research relevant for your work.