Advertisement

Veritas+: A specification language based on type theory

  • F K Hanna
  • N Daeche
  • M Longley
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 408)

Abstract

A specification language, veritas+, based on type theory, is proposed as being an ideal notation for specifying and reasoning about digital systems. The development, within veritas+, of a formal theory of arithmetic and numerals is outlined and its application to the specification, at differing levels of abstraction, of arithmetic devices is illustrated. A significant theorem is established within this theory that describes the relationship between specifications and iterative implementations of arithmetic functions and thus provides a general approach to the synthesis and formal verification of arithmetic circuits.

A brief account is given of the computational implementation of the veritas+ logic.

Keywords

Specification languages Type theory Formal verification 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7 References

  1. [C86]
    Constable, R.L., et al., “Implementing Mathematics with the Nuprl Proof Development System”, Prentice-Hall, 1986Google Scholar
  2. [G85]
    Gordon, M.J., “A Machine Oriented Formulation of Higher-Order Logic” Technical Report 68, Computer Laboratory, University of Cambridge, 1985.Google Scholar
  3. [G86]
    Gordon, M.J., “Why Higher-Order Logic is a Good Formalism for Specifying and Verifying Hardware” in “Formal Aspects of VLSI Design”, ed. G.J. Milne and P.A. Subrahmanyam, North Holland, 1986.Google Scholar
  4. [GMW79]
    Gordon, M.J., Milner, A.J., Wadsworth, C.P., “Edinburgh LCF — a Mechanised Logic of Computation”, Vol 78, LNCS, Springer-Verlag, 1979.Google Scholar
  5. [H83]
    Hanna, F.K., “Overview of the Veritas Project”, Technical Report, University of Kent, 1983.Google Scholar
  6. [HD85]
    Hanna, F.K., Daeche, N., “Specification and Verification using Higher-Order Logic”, in Proc CHDL, ed. Koomen and Moto-oka, North Holland, 1985.Google Scholar
  7. [HD86a]
    Hanna, F.K., Daeche, N., “Specification and Verification using Higher-Order Logic: A Case Study”, in “Formal Aspects of VLSI Design”, ed. G.J. Milne and P.A. Subrahmanyam, North Holland, 1986.Google Scholar
  8. [HD86b]
    Hanna, F.K., Daeche, N., “Purely Functional Implementation of a Logic” 8th Intnl Conf on Automated Deduction, pp598–607, Vol 230, LNCS, Springer-Verlag, 1986.Google Scholar
  9. [HD88]
    Hanna, F.K., Daeche, N., “Computational Logic: An Algebraic Approach”, Technical Report (3 vols), University of Kent, 1988Google Scholar
  10. [ML84]
    Martin-Löf, P. “Constructive mathematics and computer programming”, pp501–518, Phil Trans R. Soc. London, A 312, 1984.Google Scholar
  11. [S86]
    Sheeran, M., “Describing and Reasoning about Circuits using Relations”, in Proc 1986 Leeds workshop on Theoretical Aspects of VLSI Design.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • F K Hanna
  • N Daeche
  • M Longley

There are no affiliations available

Personalised recommendations