Skip to main content

Generating designs using an Algorithmic Register Transfer Language with formal semantics

  • Invited Paper
  • Conference paper
  • First Online:
Higher Order Logic Theorem Proving and Its Applications (HUG 1994)

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

Included in the following conference series:

Abstract

ARTL (Algorithmic Register Transfer Language) is a language used to describe and specify synchronous hardware at the algorithmic and register-transfer levels. Its syntax and natural semantics are formalized in higher-order logic using HOL. An ARTL simulation engine (abstract machine) and compiler are described and verified within HOL. The machine and compiler for ARTL is fully implemented. Also, we present the principles of ARTL synthesis using to standard cells and field programmable gate arrays (FPGAs).

Supported by NY State Center for Advanced Technology at Syracuse University.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sanjiv Naryan, Frank Vlhid and Daniel D. Gajske, “System Specification with the SpecChart Language,” IEEE Design & Test of Computer, December 1992.

    Google Scholar 

  2. Mandayam Srivas, Mark Bickford and Ian Sutherland, Spectool: A Computer-Aided Verification Tool for Hardware Designs, ORA Corp. Tech. Report RL-TR-91-339, Vol. 1, December 1991.

    Google Scholar 

  3. Michael Monachino, “Design Verification System for Large-Scale LSI Designs,” IBM Journal of Research and Development, Vol. 26, January 1982.

    Google Scholar 

  4. R. Boulton, A. Gordon, M. Gordon, J. Harrison, J. Herbert and J. V. Tassel, “Experience with enbedding hardware description languages in HOL,” Tech. Report, University of Cambridge Computer Lab., 1992.

    Google Scholar 

  5. Giovanni De Micheli, Robert K. Brayton, Alberto Sangiovanni-Vincentelli, “Optimal State Assignment for Finite State Machines,” IEEE Trans. on Computer-Aided Design Vol. CAD-4, No. 3, July 1985.

    Google Scholar 

  6. Srinvas Devadas, Richard Newton, “Exact Algorithm for Output Encoding, State Assignment, and Four-Level Boolean Minimization,” IEEE Trans. on Computer-Aided Design Vol. 10, No. 1, January 1985.

    Google Scholar 

  7. Martine Schlag, Pak K. Chan, and Jackson Kong, “Empirical Evaluation of Multilevel Logic Minimization Tools for an FPGA Technology,” FPGAs, edited by Will Moore and Wayne Luk, Abingdon EE&CS Books, England, 1991.

    Google Scholar 

  8. Dave Allen, “Automatic One-hot Re-encoding for FPGAs,” Field Programmable Gate Array Conference, 1992.

    Google Scholar 

  9. R. Brayton, G. D. Hachtel, C. McMullen, and A. L. Sangiovann-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis, Hingham, MA: Kluwer Academic, 1984.

    Google Scholar 

  10. R. K. Brayton, R. Ruldell, A. Sangiovanni-Vincentelli, and A. Wang, “MIS: A multiple level logic optimization system,” IEEE Trans. Computer-Aided Design, vol. CAD-6, Nov. 1987.

    Google Scholar 

  11. Srinvas Devadas, Hi-Keung Ma and A. Richard Newton, “On the verification of sequential machines at different levels of abstraction,” IEEE Trans. Computer-Aided Design, vol. 7, June 1988.

    Google Scholar 

  12. Mike Gordon, “A proof Generating System for Higher-Order Logic,” in VLSI Specification, Verification and Synthesis, edited by Graham Birtwistle and P.A. Subrahmanyam, Kluwer, 1987.

    Google Scholar 

  13. Thomas F. Melham, Automating Recursive Type Definitions in Higher Order Logic, Tech. Report No. 146, University of Cambridge Computer Lab., Jan. 1989.

    Google Scholar 

  14. Wai Wang, Modelling Bit Vectors in HOL: the word Libray, Higher Order Logic Theorem Proving and Its Applicationsedited, HUG'93, Proceedings, Jeffrey J. Joyce and Carl-Johan H. Seger (eds), Lecture Notes in Computer Science 780, Springer-Verlag, 1994.

    Google Scholar 

  15. Hanne Riis Neilson and Flemming Nielson, Semantics with Applications: A Formal Introduction to Computer Science, Weily, 1991.

    Google Scholar 

  16. Juin-Yeu Lu and Shiu-Kai Chin, Using HOL and Operational Semantics to Describe and Verify a Programming Language and its Implementation, CASE center Tech. Report No. 9212, Syracuse University, December 1992.

    Google Scholar 

  17. Juin-Yeu Lu and Shiu-Kai Chin, “Linking HOL to a VLSI CAD System,” Higher Order Logic Theorem Proving and Its Applicationsedited, HUG'93, Proceedings, Jeffrey J. Joyce and Carl-Johan H. Seger (eds), Lecture Notes in Computer Science 780, Springer-Verlag, 1994.

    Google Scholar 

  18. Christopher R. Clare, Design Logic System Using State Machines, McGraw-Hill, 1973.

    Google Scholar 

  19. Mentor Graphics Corporation, GDT Manuals V.5, CA, 1990.

    Google Scholar 

  20. Xilinx, Inc., The Programmable Gate Array Data Book, CA, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Thomas F. Melham Juanito Camilleri

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lu, JY., Chin, SK. (1994). Generating designs using an Algorithmic Register Transfer Language with formal semantics. In: Melham, T.F., Camilleri, J. (eds) Higher Order Logic Theorem Proving and Its Applications. HUG 1994. Lecture Notes in Computer Science, vol 859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58450-1_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-58450-1_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58450-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics