Skip to main content

Transformational development of circuit descriptions for binary adders

  • Part III. Case Studies in Development
  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 544))

Abstract

Transformational programming is the method of program development where an algorithm is stepwise deduced from a specification by applying correctness-preserving transformations. Using this programming technique, circuit descriptions for different binary adders are derived, viz. the parallel adder, the serial adder, and the carry look-ahead adder. This case study aims at transferring notions and methods from programming to hardware description and design.

This research was partially supported by the Deutscher Akademischer Austauschdienst and the Spanish CICYT within the “Projektbezogene Förderung des wissenschaftlichen Austauschs mit Spanien/Acciones Integradas Hispano-Alemanas” in the project “Formale Beschreibung digitaler Schaltkreise/Contribución a la descripión formal de circuitos digitales”.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F.L. Bauer, H. Wössner: Algorithmic Language and Program Development. Berlin: Springer 1982

    Google Scholar 

  2. F.L. Bauer, R. Berghammer, M. Broy, W. Dosch, F. Geiselbrechtinger, R. Gnatz, E. Hangel, W. Hesse, B. Krieg-Brückner, A. Laut, T. Matzner, B. Möller, F. Nicki, H. Partsch, P. Pepper, K. Samelson (†), M. Wirsing, H. Wössner: The Munich Project CIP. Volume I: The Wide Spectrum Language CIP-L. Lecture Notes in Computer Science 183. Berlin: Springer 1985

    Google Scholar 

  3. F.L. Bauer, B. Möller, H. Partsch, P. Pepper: Formal Program Construction by Transformations — Computer-Aided, Intuition-Guided Programming. IEEE Transactions on Software Engineering 15:2, 165–180 (1989)

    Google Scholar 

  4. R. P. Brent, H. T. Kung: A Regular Layout for Parallel Adders. IEEE Transactions on Computers C-31:3, 260–264 (1980)

    Google Scholar 

  5. C. Delgado Kloos: Semantics of Digital Circuits. Lecture Notes in Computer Science 285. Berlin: Springer 1987

    Google Scholar 

  6. I. Flores: The Logic of Computer Arithmetic. Englewood Cliffs, New Jersey: Prentice-Hall 1963

    Google Scholar 

  7. F.J. Hill, G.R. Peterson: Introduction to Switching Theory and Logic Design. Second Edition. New York: John Wiley & Sons 1974

    Google Scholar 

  8. F.J. Hill, G.R. Peterson: Digital Systems: Hardware Organization and Design. Second Edition. New York: John Wiley & Sons 1978

    Google Scholar 

  9. M. M. Mano: Digital Design. Englewood Cliffs, New Jersey: Prentice-Hall 1984

    Google Scholar 

  10. C. Mead, L. Conway: Introduction to VLSI Systems. Reading, Mass.: Addison-Wesley Publishing Company 1980

    Google Scholar 

  11. R. K. Richards: Digital Design. New York: John Wiley & Sons 1971

    Google Scholar 

  12. A. Weinberger, J. L. Smith: The Logical Design of a One-Micro-second Adder Using One-Megacycle Circuitry. IRE Trans. Elec. Computer EC-5:2, 65–73 (1956)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Manfred Broy Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kloos, C.D., Dosch, W. (1991). Transformational development of circuit descriptions for binary adders. In: Broy, M., Wirsing, M. (eds) Methods of Programming. Lecture Notes in Computer Science, vol 544. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018275

Download citation

  • DOI: https://doi.org/10.1007/BFb0018275

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54576-7

  • Online ISBN: 978-3-540-38491-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics