Beauty Is Our Business pp 193-205 | Cite as
A Theory for the Derivation of C-mos Circuit Designs
Chapter
Summary
This paper shows how propositional logic may be used to reason about synchronous sequential switching circuits implemented in C-mos. It develops a simple formalism and theory for describing and predicting their behaviour. On this it builds a calculus of design which is driven by proof obligations. The design philosophy for software introduced in [1] is thereby extended to a certain kind of hardware design.
No prior knowledge of hardware is assumed of the reader; but useful background, motivation, examples and pictures may be found in [2]. Many of the problems described in that paper have been solved in this one.
Keywords
Consistent State Propositional Logic Parallel Composition Proof Obligation Propositional Formula
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.
Download
to read the full chapter text
References
- [1]E. W. Dijkstra. Guarded commands, non-determinacy, and the formal derivation of programs. Comm. ACM, 18 (8): 453–457, August 1975.MathSciNetMATHCrossRefGoogle Scholar
- [2]C. A. R. Hoare and M. J. C. Gordon. Partial correctness of C-mos switching circuits: an exercise in applied logic. In Proceedings of the third annual symposium on logic in computer science, Edinburgh, pages 28–36, July 1988.Google Scholar
Copyright information
© Springer-Verlag New York, Inc. 1990