Skip to main content
SpringerLink
Log in
Book cover

International Andrei Ershov Memorial Conference on Perspectives of System Informatics

PSI 1996: Perspectives of System Informatics pp 21–39Cite as

Calculating digital counters

  • Invited Talks
  • Conference paper
  • First Online:

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

Abstract

Deductive design characterizes a method where a system description is deduced from the functional specification of its behaviour applying formal transformations rules. Following this design methodology, we derive circuit descriptions for various combinational and sequential counters from a common functional specification using equational and inductive reasoning.

This research was partially supported by the Esprit working group 8533 NADA on New Hardware Design Methods and the DAAD project Deductive Design of Parallel Software and Hardware Systems.

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, 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 

  2. K. van Berkel: VLSI Programming of a Modulo-N Counter with Constant Response Time and Constant Power. In: S. Furber, M. Edwards: Asynchronous Design Methodologies. IFIP Transaction A-28. Amsterdam: Elsevier 1993, 1–11

    Google Scholar 

  3. R.T. Boute: Representational and Denotational Semantics of Digital Circuits. IEEE Transactions on Computers 38:7, 986–999

    Google Scholar 

  4. J.J.F. Cavanagh: Digital Computer Arithmetic — Design and Implementation. McGraw-Hill Computer Science Series. New York: McGraw-Hill 1984

    Google Scholar 

  5. L. Claesen (ed.): Formal VLSI Specification and Synthesis — VLSI Design Methods-I & Formal VLSI Correctness Verification — VLSI Design Methods-II. Amsterdam: Elsevier 1990

    Google Scholar 

  6. C. Delgado Kloos, W. Dosch: Transformational Development of Circuit Descriptions for Binary Adders. In: M. Broy, M. Wirsing (eds.): Methods of Programming — Selected Papers on the CIP-Project. Lecture Notes in Computer Science 544. Berlin: Springer 1991, 217–237

    Google Scholar 

  7. C. Delgado Kloos, W. Dosch: Efficient Circuits as Implementations of Non-Strict Functions. Workshops in Computing Series. In: G. Jones, M. Sheeran (eds.): Designing Correct Circuits. London: Springer 1991, 212–230

    Google Scholar 

  8. C. Delgado Kloos, W. Dosch, B. Möller: Design and Proof of Multipliers by Correctness-Preserving Transformation. In: P. Dewilde, J. Vandewalle (eds.): Computer Systems and Software Engineering. Proc. 6th Annual European Computer Conference (CompEuro 92). Los Alamitos, Ca.: IEEE Computer Society Press 1992, 238–243

    Google Scholar 

  9. M.D. Ercegovac, T. Lang: Digital Systems and Hardware/Firmware Algorithms. New York: John Wiley & Sons 1985

    Google Scholar 

  10. F.K. Hanna, N. Daeche, M. Longley: Specification and Verification Using Dependent Types. IEEE Transactions on Software Engineering 16:9, 949–964 (1990)

    Google Scholar 

  11. G. Jones, M. Sheeran: Designing Arithmetic Circuits by Refinement in Ruby. Science of Computer Programming 22:1–2, 107–135 (1994)

    Google Scholar 

  12. J.L.W. Kessels:Calculational Derivation of a Counter with Bounded Response Time. In: G.J. Milne, L. Pierre (eds): Correct Hardware Design and Verification Methods. Lecture Notes in Computer Science 683. Berlin: Springer 1993, 203–213

    Google Scholar 

  13. M.M. Mano: Digital Design. Englewood Cliffs, N.J.: Prentice Hall 1984

    Google Scholar 

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

    Google Scholar 

  15. J.T. O'Donnell: Hardware Description With Recursion Equations. Proc. IFIP 8th International Symposium on Computer Hardware Description Languages and their Applications. Amsterdam: North-Holland 1987, 363–382

    Google Scholar 

  16. A.R. Omondi: Computer Arithmetic Systems — Algorithms, Architecture and Implementations. Prentice Hall International Series in Computer Science. New York: Prentice Hall 1994

    Google Scholar 

  17. H. Partsch: Specification and Transformation of Programs — A Formal Approach to Software Development. Berlin: Springer 1990

    Google Scholar 

  18. N.R. Scott: Computer Number Systems and Arithmetic. Englewood Cliffs, N.J.: Prentice Hall 1985

    Google Scholar 

  19. J. Staunstrup: A Formal Approach to Hardware Design. The Kluwer International Series in Engineering and Computer Science. Boston: Kluwer 1994

    Google Scholar 

  20. N. Wirth: Digital Circuit Design for Computer Science Students — An Introductory Textbook. Berlin: Springer 1995

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Augsburg, D-86135, Augsburg

    Walter Dosch

Authors
  1. Walter Dosch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dines Bjørner Manfred Broy Igor V. Pottosin

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dosch, W. (1996). Calculating digital counters. In: Bjørner, D., Broy, M., Pottosin, I.V. (eds) Perspectives of System Informatics. PSI 1996. Lecture Notes in Computer Science, vol 1181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62064-8_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-62064-8_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62064-8

  • Online ISBN: 978-3-540-49637-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation