A Model for Synchronous Switching Circuits and its Theory of Correctness
Following Bryant , an algorithm is given for translating a switching circuit design into a program which simulates its dynamic behaviour. A theory of assertions based on Dijkstra  and UNITY  is then developed to formalise specifications of hardware circuit designs, and to establish their correctness. Both combinational and sequential circuits are taken into account, and both in N-mos and C-mos; the latter turns out to be much simpler.
Unable to display preview. Download preview PDF.
- D. A. Basin, G. M. Brown and M. E. Leeser, Formally verified synthesis of combinational CMOS circuits, in Formal VLSI specification and synthesis, VLSI design methods I, L. J. M. Claesen (ed), North Holland, 1990, pp 197–206.Google Scholar
- E. W. Dijkstra, Guarded commands, non-determinacy, and the formal derivation of programs. Comm. ACM 18 (August 1975) pp 435–457.Google Scholar
- C. A. R. Hoare, A theory for the derivation of C-mos circuit designs, in Beauty is our business, W. H. J. Feijen et al (ed), Springer-Verlag, 1990.Google Scholar
- G. Winskel, Models and logic of MOS circuits. Proc. of Intl. Summer School on Logic of Programming and Calculi of Discrete Design (July 1986).Google Scholar