Skip to main content
SpringerLink
Log in

Correct compilation of specifications to deterministic asynchronous circuits

  • Published:
Formal Methods in System Design Aims and scope Submit manuscript

Abstract

Powerful methods have been developed by A. martin and others wherby asynchronous circuits may be automatically constructed by starting from high-level specifications and incrementally transforming them into asynchronous circuits. In this paper we make the informal arguments for the correctness of this compilatin process mathematically rigorous. With rigorsouly justified transformations, specifications may be translated into circuits that provably meet their specification. A full proof of the correctness of the circuit compiler is given. Other results of independent interest include: the process model takes fairness of gates into account, hazard-freeness is formally defined, and all hazard-free circuits constructed solely of and, or, not gates and C elements are proven to behave deterministically to any outside observer. A novel notion of equivalence is used to justify the correctness of the compiler.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.A. Bergstra and J.W. Klop. Process Algebra for Synchronous Communication.Information and Control, 60:109–137, 1984.

    Google Scholar 

  2. Erik Brunvand and Robert F. Sproull. Tranlating concurrent programs into delay-insenitive circuits. InProceedings of ICCAD-89, pages 262–265. IEEE Computer Society Press, 1989.

  3. R. E. Bryant. On the complexityof VLSI implementations and Graph Representation of Boolena Functions with Application to Integer Multiplication.IEEE Transactions on Computers, 40(2), 1986.

  4. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and J. Hwand. Symbolic Model Checking: 1020 States and Beyond. InProceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, 1990.

  5. Steven M. Burns. Automated compilation of concurrent programs into self-timed circuits. Technical Report Caltech-CS-TR-88-2, California Institute of Technology, 1988.

  6. Steven M. Burns and Alain J. Martin. Synthesis of Self-timed circuits.by program transformation. In G.J. Milne, editor,The Fusion of Hardware Design and Verification, pages 99–116. Elsevier Science Publishers B.V. (North-Holland), 1988.

  7. N. Dershowitz and J.-P. Jouannaud. Rewriting systems. InHandbook of theoretical computer science. MIT/Elsevier, 1990.

  8. David L. Dill. Trace theory for automatic hierarchical verfication of speed-independent circuits. In Jonathan Allen and F. Thomson Leighton, editor,Advance Research in VLSI: Proceedings of the Fifth MIT Conference, pages 51–65. MIT Press, 1988.

  9. Jo C. Ebergen. A formal approach to designing delay-insensitive cirucits. Computing Science Notes 88/10, Dept. of Math. and C.S., Eindhoven Univ. of Technology, May 1988.

  10. M. Felleisen, D. Freidman, and E. Kohlbecker. A syntactic theory of sequential control.Theoretical Computer Sciene, 52:205–237, 1987.

    Google Scholar 

  11. M. Hennessy.Algebraic Theory of Processes. MIT Press, 1988.

  12. Matthew Hennessy. Synchronous and asynchronous experimens on processes.Inform. and Control, 59:36–83, 1983.

    Google Scholar 

  13. C.A.R. Hoare.Communicating Sequential Processes. Prentice-Hall, 1985.

  14. Alain J. Martin. The design of a self-timed circuit for distributed mutual exclusion. In1985 Chapel Nill Conference on VLSI, pages 245–260, 1985.

  15. Alain J. Martin. Compiling communicating processes into delay-insensitive VLSI circuits.Distributed Computing, 1(4):226–234, 1986.

    Google Scholar 

  16. Alain J. Martin. The limitations to delay-insensitivity in asynchronous circuits. In Wiliam J. Dally, editor,Sixth MIT Conference on Advanced Research in VLSI, pages 263–278. MIT Press, 1990.

  17. Alain J. Martin. Programming in VLSI: From communicating processes to delay-insensitive circuits. In C. A. R. Hoare, editor,Developments in Concurrency and Communication. Addison-Wesley, 1990. UT Year of Programming Institute on Concurrent Programming.

  18. Alain J. Martin. Synthesis of asynchronous VLSI circuits. In J. Straunstrup, editor,Formal Methods for VLSI Design, pages 237–283. North-Holland, 1990.

  19. Alain J. Martin, Steven M. Burns, T.K. Lee, Drazen Borkovic, and Pieter J. Hazewindus. The design of an asynchronous microprocessor. In Charles L. Seitz, editor,Advanced Research in VLSI: Proc. of the Decennial Caltech Conference on VLSI, pages 351–373, 1989.

  20. Terse H.-Y. Meng, Robert W. Brodersen, and David G. Messerschmitt, Automatic synthesis of asynchronous circuits from high-level specifications.IEEE Trans. CAD, 8(1):1185–1205, November 1989.

    Google Scholar 

  21. Robin Milner,Comunication and Concurrency, Prentice Hal, 1989.

  22. R. De Nicola and M.C.B. Hennessy. Testing Equivalences for Processes.Theoretifal Computer Science, 34:83–133, 1983.

    Google Scholar 

  23. G. Plotkin, LCF considered as a programming language.Theoretical Computer Science, 5:223–255, 1977.

    Google Scholar 

  24. Scott F. Smith and Amy E. Zwarico. Provably correct synthesis of asynchronous circuits. In Jørgen Staunstrup and Robin Sharp, editors,2nd Workshop on Designing Correct Circuits, Lyngby, pages 237–260. Elsevier, North Holland, 1992.

    Google Scholar 

  25. Scott F. Smith and Amy E. Zwarico. Correct compilation of specifications to deterministic asynchronous circuits. In George Milne, editor,Correct Hardware Design and Verification Methods (CHARME), volume 683 ofLecture Notes in Computer Science. Springer Verlag, 1993.

  26. C. H. van Berkel. Beware the isochronic fork. Nat. Lab. Unclassified Report UR 003/91, Philips Research Lab. Eindhoven, The Netherlands, 1991.

    Google Scholar 

  27. Kees van Berkel.Handshake Circuits: an Asynchrnous Architecture for VLSI Programming, volume 5 ofInternational Series on Parallel Computation. Cambridge University Press, 1993.

  28. Kees van Berkel, Joep Kessels, Marly Roncken, Ronald Saeijs, and Frits Schalij. The VLSI-programming language Tangram and its translation into handshake circuits. InProceedings of the European Design Automation Conference, pages 384–389, 1991.

  29. S. Weber, B. Bloom, and G. Brown. Compiling Joy to silicon. InAdvance research in VLSI and parallel systems; proceedings of the 1992 Brown/MIT conference. MIT Press, 1992.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Scince, The Johns Hopkins University, 21218, Baltimor, MD, USA

    Scott F. Smith & Amy E. Zwarico

Authors
  1. Scott F. Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amy E. Zwarico
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Smith, S.F., Zwarico, A.E. Correct compilation of specifications to deterministic asynchronous circuits. Form Method Syst Des 7, 155–226 (1995). https://doi.org/10.1007/BF01384076

Download citation

  • Received:

  • Issue Date:

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

Key words

Search

Navigation