Date of Original Version
Proceedings of Mathematical Sciences Institute Workshop Cornell University, Ithaca, New York, USA July 5–7, 1989, LNCS 408, pp 14-24.
Abstract or Table of Contents
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 synchronous circuits using the stack circuit of Mead and Conway as an illustrative example.