Skip to main content
SpringerLink
Log in

Experiments with Finite Tree Automata in Coq

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

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

Included in the following conference series:

Abstract

Tree automata are a fundamental tool in computer science. We report on experiments to integrate tree automata in Coq using shallow and deep reflection techniques. While shallow reflection seems more natural in this context, it turns out to give disappointing results. Deep reflection is more difficult to apply, but is more promising.

This work was done as part of Dyade, a common venture between Bull S.A. and INRIA.

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, S. Boutin, C. Cornes, J. Courant, J.-C. Filliatre, E. Giménez, H. Herbelin, G. Huet, C. Muñoz, C. Murthy, C. Parent, C. Paulin-Mohring, A. Saibi, and B. Werner. The Coq proof assistant reference manual: Version 6.3.1. Technical report, INRIA, France, 1999.

    Google Scholar 

  2. S. Boutin. Using reflection to build efficient and certified decision procedures. In M. Abadi and T. Ito, editors, TACS’97. Springer-Verlag LNCS 1281, 1997.

    Google Scholar 

  3. R. Boyer and J. S. Moore. Metafunctions: Proving them correct and using them efficiently as new proof procedures. In The Correctness Problem in Computer Science. Acad. Press, 1981.

    Google Scholar 

  4. W. Charatonik and A. Podelski. Set-based analysis of reactive infinite-state systems. In B. Steffen, editor, TACAS’98, pages 358–375. Springer Verlag LNCS 1384, 1998.

    Google Scholar 

  5. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, T. Sophie, and M. Tommasi. Tree automata techniques and applications. Available at http://www.grappa.univ-lille3.fr/tata, 1997.

  6. L. Fribourg and M. Veloso Peixoto. Automates concurrents à contraintes. Technique et Science Informatique, 13(6):837–866, 1994.

    MATH  Google Scholar 

  7. F. Gécseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 1–68. Springer Verlag, 1997.

    Google Scholar 

  8. J. Goubault-Larrecq. Satisfiability of inequality constraints and detection of cycles with negative weight in graphs. Part of the Coq contribs, available at http://pauillac.inria.fr/coq/contribs/graphs.html, 1998.

  9. J. Goubault-Larrecq. A method for automatic cryptographic protocol verification. In FMPPTA’2000, pages 977–984. Springer Verlag LNCS 1800, 2000.

    Google Scholar 

  10. J. Harrison. Binary decision diagrams as a HOL derived rule. The Computer Journal, 38:162–170, 1995.

    Article  MathSciNet  Google Scholar 

  11. J. Harrison. Stålmarck’s algorithm as a HOL derived rule. In J. von Wright, J. Grundy, and J. Harrison, editors, TPHOL’96, pages 221–234. Springer Verlag LNCS 1125, 1996.

    Google Scholar 

  12. J.-P. Jouannaud. Rewrite proofs and computations. In H. Schwichtenberg, editor, Proof and Computation, volume 139 of NATO series F: Computer and Systems Sciences, pages 173–218. Springer Verlag, 1995.

    Google Scholar 

  13. D. Monniaux. Abstracting cryptographic protocols with tree automata. In SAS’99, pages 149–163. Springer Verlag LNCS 1694, 1999.

    Google Scholar 

  14. O. Müller. A verification environment for I/O automata based on formalized meta-theory. Master’s thesis, Technische Universität München, 1998.

    Google Scholar 

  15. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 4, pages 133–191. Elsevier Science Publishers B. V., 1990.

    Google Scholar 

  16. K. N. Verma, J. Goubault-Larrecq, S. Prasad, and S. Arun-Kumar. Reflecting BDDs in Coq. In ASIAN’2000, pages 162–181. Springer Verlag LNCS 1961, 2000.

    Google Scholar 

  17. R. W. Weyhrauch. Prolegomena to a theory of mechanized formal reasoning. Artifical Intelligence, 13(1, 2):133–170, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  18. S. Yu and Z. Luo. Implementing a model checker for LEGO. In J. Fitzgerald, C. B. Jones, and P. Lucas, editors, FME’97, pages 442–458. Springer-Verlag LNCS 1313, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GIE Dyade, INRIA Rocquencourt, Domaine de Voluceau, B.P. 105, 78153, Le Chesnay, France

    Xavier Rival & Jean Goubault-Larrecq

  2. Ecole Normale Supérieure, 45, rue d’Ulm, 75005, Paris, France

    Xavier Rival

  3. LSV, ENS Cachan, 61, av. du président-Wilson, 94235, Cachan, France

    Jean Goubault-Larrecq

Authors
  1. Xavier Rival
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean Goubault-Larrecq
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, University of Glasgow, 17 Lilybank Gardens, Glasgow, G12 8QQ, Scotland, UK

    Richard J. Boulton

  2. Division of Informatics, University of Edinburgh, James Clerk Maxwell Building, King’s Buildings, Edinburgh, EH9 3JZ, Scotland, UK

    Paul B. Jackson

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rival, X., Goubault-Larrecq, J. (2001). Experiments with Finite Tree Automata in Coq. In: Boulton, R.J., Jackson, P.B. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2001. Lecture Notes in Computer Science, vol 2152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44755-5_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-44755-5_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42525-0

  • Online ISBN: 978-3-540-44755-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation