Skip to main content

Reasoning about a class of linear systems of equations in HOL

  • 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:

  • 116 Accesses

Abstract

In this paper we present an algorithm implemented in the HOL system to prove the equivalence of two linear systems of equations (of a certain class) about natural numbers. The procedure has been developed in order to reason about an aspect of programs described in the Silage language. The semantics of Silage has been defined in the HOL system and specifies the class of linear systems of equations that the algorithm copes with.

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. C.M. Angelo, L. Claesen, and H. De Man. “Modeling Multi-rate DSP Specification Semantics for Formal Transformational Design in HOL”. To appear in Formal Methods in System Design: An International Journal, vol. 5, nos. 1/2, July 1994. Kluwer Academic Publishers.

    Google Scholar 

  2. C.M. Angelo, Formal Hardware Verification in a Silicon Compilation Environment by means of Theorem Proving, Ph.D. Thesis, IMEC, Leuven, Belgium, February 1994.

    Google Scholar 

  3. H. Abelson, G.J. Sussman, and J. Sussman. Structure and Interpretation of Computer Programs. The MIT Press/McGraw-Hill Book Company, 1985. The MIT Electrical Engineering and Computer Science Series.

    Google Scholar 

  4. H. De Man, J. Rabaey, P. Six, and L. Claesen. “Cathedral-II: a Silicon Compiler for Digital Signal Processing”. IEEE Design & Test of Computers, 3(6):73–85, December 1986.

    Google Scholar 

  5. D. Genin, P.N. Hilfinger, J. Rabaey, C. Scheers, and H. De Man. “DSP Specification Using the Silage Language”. In IEEE International Conference on Acoustics, Speech and Signal Processing, pages 1057–1060. Albuquerque, NM, April 1990.

    Google Scholar 

  6. M. Gordon. “HOL: A Proof Generating System for Higher-Order Logic”. In G. Birtwistle and P.A. Subrahmanyam, editors, VLSI Specification, Verification and Synthesis, pages 73–128. Kluwer Academic Publishers, 1988.

    Google Scholar 

  7. P.N. Hilfinger. “Silage, a High-level Language and Silicon Compiler for Digital Signal Processing”. In IEEE 1985 Custom Integrated Circuits Conference, CICC'85, pages 213–216. Portland, OR, May 1985.

    Google Scholar 

  8. L. Nachtergaele. A Silage Tutorial. IMEC, Leuven, Belgium, May 1990.

    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

Angelo, C.M., Claesen, L., De Man, H. (1994). Reasoning about a class of linear systems of equations in HOL. 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_33

Download citation

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

  • 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