Skip to main content
SpringerLink
Log in

Hardware Verification Using Co-induction in COQ

  • Conference paper
  • First Online:
Theorem Proving in Higher Order Logics (TPHOLs 1999)

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

Included in the following conference series:

Abstract

This paper presents a toolbox implemented in Coq and dedicated to the specification and verification of synchronous sequential devices. The use of Coq co-inductive types underpins our methodology and leads to elegant and uniform descriptions of the circuits and their behaviours as well as clear and short proofs. An application to a non trivial circuit is given as an illustration.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Barras and al. The Coq Proof Assistant Reference Manual: Version 6.1. Technical Report 0203, INRIA-Rocquencourt, CNRS-ENS Lyon, France, Dec. 1997.

    Google Scholar 

  2. D. Cachera. Verification of Arithmetic Circuits using a Functional Language and PVS. Technical Report 97-48, ENS-Lyon, LIP, Dec. 1997.

    Google Scholar 

  3. T. Coquand. Une Théorie des Constructions. PhD thesis, Université Paris 7, Janvier 1989.

    Google Scholar 

  4. T. Coquand and G. Huet. Constructions: A Higher Order Proof System for Mechanizing Mathematics. EUROCAL 85, Linz Springer-Verlag LNCS 203, 1985.

    Google Scholar 

  5. S. Coupet-Grimal and L. Jakubiec. Coq and Hardware Verification: a Case Study. In J. G. J. vonWright and J. Harrison, editors, TPHOLs’96, LCNS 1125, pages 125–139, Turku (Finlande), 27–30th August 1996. Springer-Verlag.

    Google Scholar 

  6. P. Curzon. The Formal Verification of the Fairisle ATM Switching Element. Technical Report 329, University of Cambridge, Mar. 1994.

    Google Scholar 

  7. P. Curzon. The Formal Verification of the Fairisle ATM Switching Element: an Overview. Technical Report 328, University of Cambridge, Mar. 1994.

    Google Scholar 

  8. E. Garcez and W. Rosenstiel. The Verification of an ATM Switching Fabric using the HSIS Tool. IX Brazilian Symposium on the Design of Integrated Circuits, 1996.

    Google Scholar 

  9. E. Giménez. Un calcul de constructions in finies et son application à la vèrication de systèmes communicants. PhD thesis, Ecole Normale Superieure de Lyon, 1996.

    Google Scholar 

  10. I. Leslie and D. McAuley. Fairisle: A General Topology ATM LAN. http://www.cl.cam.ac.uk/Research/SRG/fairpap.html, Dec. 1990.

  11. I. Leslie and D. McAuley. Fairisle: An ATM Network for the Local Area. ACM Communication Review, 4(19):327–336, September 1991.

    Article  Google Scholar 

  12. J. Lu and S. Tahar. Practical Approaches to the Automatic Verification of an ATM Switch using VIS. In IEEE 8th Great Lakes Symposium on VLSI (GLS-VLSI’98), pages 368–373, Lafayette, Louisiana, USA, Feb. 1998. IEEE Computer Society Press.

    Google Scholar 

  13. P. S. Miner and S. D. Johnson. Verification of an Optimized Fault-Tolerant Clock Synchronization Circuit. In Designing Correct Circuits. Bästad, 1996.

    Google Scholar 

  14. C. Paulin-Mohring. Inductive Definition in the System Coq: Rules and Properties. Typed Lambda Calculi and Applications (Also Research Report 92-49, LIPENS Lyon), Dec. 1993.

    Google Scholar 

  15. C. Paulin-Mohring. Circuits as Streams in Coq. Verification of a Sequential Multiplier. Basic Research Action “Types”, July 1995.

    Google Scholar 

  16. S. Tahar and P. Curzon. A Comparison of MDG and HOL for Hardware Verification. In J. G. J. von Wright and J. Harrison, editors, TPHOLs’96, LCNS 1125, pages 415–430, Turku (Finlande), 27–30th August 1996. Springer-Verlag.

    Google Scholar 

  17. S. Tahar, P. Curzon, and Lu. J. Three Approaches to Hardware Verification: HOL, MDG and VIS Compared. In G. Gopalakrishnan and P. Windley, editors, Formal Methods in Computer-Aided Design, LNCS 1522, pages 433–450, FMCAD’98, Palo Alto, California, USA, Nov. 1998. Springer-Verlag.

    Chapter  Google Scholar 

  18. S. Tahar, Z. Zhou, X. Song, E. Cerny, and M. Langevin. Formal Verification of an ATM Switch Fabric using Multiway Decision Graphs. In Proc. of the Great Lakes Symp. on VLSI, IEEE Computer Society Press, pages 106–111, Mar. 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique de Marseille - URA CNRS 1787, 39, rue F. Joliot-Curie, 13453, Marseille, France

    Solange Coupet-Grimal & Line Jakubiec

Authors
  1. Solange Coupet-Grimal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Line Jakubiec
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INRIA Sophia Antipolis, 2004 Route des Lucioles, F-06902, Sophia Antipolis Cedex, France

    Yves Bertot , Gilles Dowek  & Laurent Théry ,  & 

  2. University of Nice - Sophia Antipolis, Parc Valrose, F-06108, Nice Cedex 2, France

    André Hirschowitz

  3. University of Paris XI, 15, rue Georges Clemenceau, F-91405, Orsay Cedex, France

    Christine Paulin

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Coupet-Grimal, S., Jakubiec, L. (1999). Hardware Verification Using Co-induction in COQ. In: Bertot, Y., Dowek, G., Théry, L., Hirschowitz, A., Paulin, C. (eds) Theorem Proving in Higher Order Logics. TPHOLs 1999. Lecture Notes in Computer Science, vol 1690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48256-3_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-48256-3_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66463-5

  • Online ISBN: 978-3-540-48256-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation