Skip to main content

Using the temporal logic programming language Tokio for algorithm description and automatic CMOS gate array synthesis

  • Conference paper
  • First Online:
Logic Programming '85 (LP 1985)

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

Included in the following conference series:

Abstract

To date, simulation has been the primary method used to support hardware logic design. In particular, there has been little that could support such design from the system level, such as a language to describe processing algorithms. In this paper, we will propose a silicon compiler, which is designed to support CMOS gate arrays from the system level. Descriptions from the system level through the state diagram level are done by using the temporal logic programming language called Tokio. Being based on temporal logic, Tokio enables the use of temporal operators. This facilitates the description of concurrent operations that cannot be easily described in Prolog. In addition, because the mathematical models are clearly defined, verification and synthesis can be easily supported. At present, only a simulator coded in Prolog is available to support descriptions of this level in Tokio.

A program that automatically synthesizes logical circuits for CMOS gate array from state diagram level is supported. The core of this program has already been developed in C-Prolog. Synthesis has already been tested at our laboratory. We used the Unify Processor (UP) of PIE (Parallel Inference Machine) which is currently under development, as an example.

This paper introduces the hardware design support strategy based on Tokio, and explains the details of the program that synthesizes CMOS gate arrays from the descriptions of the state diagram level.

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

  • Manna Z, Pnueli A (1981) Verification of concurrent programs part I: the temporal framework, Stanford univ. rep. STAN-C81-836

    Google Scholar 

  • Moszkowski B (1983) Reasoning about digital circuits, Stanford univ. rep. STAN-CS-83-970

    Google Scholar 

  • Aoyagi T, Kono S, Fujita M, Moto-oka T (1985) Logic Programming Conference '85, Tokyo Japan

    Google Scholar 

  • Kono S, Aoyagi T, Fujita M, Tanaka H (1985) Logic Programming Conference '85, Tokyo Japan

    Google Scholar 

  • Fujita M (1984) Logic design assistance with temporal logic, phD dissertation, Univ. of Tokyo

    Google Scholar 

  • Juley JR, Dietmeyer DL (1968) A digital system design language (DDL), IEEE trans. computer, vol. C-17, no. 9

    Google Scholar 

  • Juley JR, Dietmeyer DL (1969) Translation of a DDL digital system specification to equation, IEEE trans. computer, vol. C-18, no. 4

    Google Scholar 

  • Pereira F (1984) C-Prolog users manual version 1.5, EdCAD, Edinburgh univ.

    Google Scholar 

  • Goto A, Aida A, Tanaka H, Moto-oka T (1983) Highly parallel inference engine PIE, Logic Programming Conference '83, Tokyo Japan

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Eiiti Wada

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fujita, M., Ishisone, M., Nakamura, H., Tanaka, H., Moto-oka, T. (1986). Using the temporal logic programming language Tokio for algorithm description and automatic CMOS gate array synthesis. In: Wada, E. (eds) Logic Programming '85. LP 1985. Lecture Notes in Computer Science, vol 221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16479-0_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-16479-0_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16479-1

  • Online ISBN: 978-3-540-39820-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics