Skip to main content

A Model for Synchronous Switching Circuits and its Theory of Correctness

  • Conference paper
Designing Correct Circuits

Part of the book series: Workshops in Computing ((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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. R. E. Bryant, A switch-level model and simulation for the MOS digital systems. IEEE Trans. Comput., c-33 (Feb. 1984) pp 160–177.

    Article  Google Scholar 

  3. K. M. Chandy and J. Misra, Parallel program design: a foundation. Addison-Wesley, 1988.

    MATH  Google Scholar 

  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. 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. C. A. R. Hoare, Fixed points of increasing functions. Information Processing Letters 34 (April 1990) pp 111–112.

    Article  MathSciNet  MATH  Google Scholar 

  7. A. Tarski, A lattice-theoretical fixpoint theorem and its application. Pacific J. of Math. 5 (1955)p 285.

    Article  MathSciNet  MATH  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag London

About this paper

Cite this paper

Chaochen, Z., Hoare, C.A.R. (1991). A Model for Synchronous Switching Circuits and its Theory of Correctness. In: Jones, G., Sheeran, M. (eds) Designing Correct Circuits. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3544-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3544-9_11

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19659-4

  • Online ISBN: 978-1-4471-3544-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics