Advertisement

A Model for Synchronous Switching Circuits and its Theory of Correctness

  • Zhou Chaochen
  • C. A. R. Hoare
Part of the Workshops in Computing book series (WORKSHOPS COMP.)

Abstract

Following Bryant [2], 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 [4] and UNITY [3] 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.

Keywords

Simulation Program CMOS Circuit Sequential Circuit Local Wire Concealment Operator 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    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
  2. [2]
    R. E. Bryant, A switch-level model and simulation for the MOS digital systems. IEEE Trans. Comput., c-33 (Feb. 1984) pp 160–177.CrossRefGoogle Scholar
  3. [3]
    K. M. Chandy and J. Misra, Parallel program design: a foundation. Addison-Wesley, 1988.MATHGoogle Scholar
  4. [4]
    E. W. Dijkstra, Guarded commands, non-determinacy, and the formal derivation of programs. Comm. ACM 18 (August 1975) pp 435–457.Google Scholar
  5. [5]
    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
  6. [6]
    C. A. R. Hoare, Fixed points of increasing functions. Information Processing Letters 34 (April 1990) pp 111–112.MathSciNetCrossRefMATHGoogle Scholar
  7. [7]
    A. Tarski, A lattice-theoretical fixpoint theorem and its application. Pacific J. of Math. 5 (1955)p 285.MathSciNetCrossRefMATHGoogle Scholar
  8. [8]
    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

Copyright information

© Springer-Verlag London 1991

Authors and Affiliations

  • Zhou Chaochen
    • 1
  • C. A. R. Hoare
    • 1
  1. 1.Programming Research GroupOxfordEngland

Personalised recommendations