Skip to main content
SpringerLink
Log in

Zenon: An Extensible Automated Theorem Prover Producing Checkable Proofs

  • Conference paper
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4790))

Abstract

We present Zenon, an automated theorem prover for first order classical logic (with equality), based on the tableau method. Zenon is intended to be the dedicated prover of the Focal environment, an object-oriented algebraic specification and proof system, which is able to produce OCaml code for execution and Coq code for certification. Zenon can directly generate Coq proofs (proof scripts or proof terms), which can be reinserted in the Coq specifications produced by Focal. Zenon can also be extended, which makes specific (and possibly local) automation possible in Focal.

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. Barendregt, H., Barendsen, E.: Autarkic Computations in Formal Proofs. Journal of Automated Reasoning (JAR) 28(3), 321–336 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bezem, M., Hendriks, D.H., de Nivelle, H.: Automated Proof Construction in Type Theory Using Resolution. Journal of Automated Reasoning (JAR) 29(3–4), 253–275 (2002)

    Article  MATH  Google Scholar 

  3. Delahaye, D., Étienne, J.-F., Donzeau-Gouge, V.V.: Certifying Airport Security Regulations using the Focal Environment. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol. 4085, pp. 48–63. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Delahaye, D., Étienne, J.-F., Donzeau-Gouge, V.V.: Reasoning about Airport Security Regulations using the Focal Environment. In: International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (ISoLA), Paphos (Cyprus) (November 2006)

    Google Scholar 

  5. Hurd, J.: Integrating Gandal and HOL. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Théry, L. (eds.) TPHOLs 1999. LNCS, vol. 1690, pp. 311–322. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Jaume, M., Morisset, C.: Formalisation and Implementation of Access Control Models. In: Information Assurance and Security (IAS), International Conference on Information Technology (ITCC), Las Vegas (USA), pp. 703–708. IEEE Computer Society Press, Los Alamitos (2005)

    Google Scholar 

  7. Leisenring, A.C.: Mathematical Logic and Hilbert’s ε-Symbol. MacDonald Technical and Scientific, London (1969) ISBN 0356026795

    Google Scholar 

  8. McCune, W., Shumsky, O.: System Description: IVY. In: McAllester, D. (ed.) CADE-17. LNCS, vol. 1831, pp. 401–405. Springer, Heidelberg (2000)

    Google Scholar 

  9. Paulson, L.C., Susanto, K.W.: Source-Level Proof Reconstruction for Interactive Theorem Proving. In: Theorem Proving in Higher Order Logics (TPHOLs). LNCS, Springer, Heidelberg (2007)

    Google Scholar 

  10. The  EDEMOI Project (2003), http://www-lsr.imag.fr/EDEMOI/

  11. Sutcliffe, G.: CASC-J3 - The 3rd IJCAR ATP System Competition. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 572–573. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Sutcliffe, G., Suttner, C.B.: The TPTP Problem Library: CNF Release v1.2.1. Journal of Automated Reasoning (JAR) 21(2), 177–203 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  13. The Coq Development Team. Coq, version 8.1. INRIA (November 2006), available at: http://coq.inria.fr/

  14. The Cristal Team. Objective Caml, version 3.10. INRIA (May 2007), available at: http://caml.inria.fr/

  15. The Focal Development Team. Focal, version 0.3.1. CNAM/INRIA/LIP6 (May 2005), available at: http://focal.inria.fr/

  16. The HELM Team. Matita, version 0.1.0. Computer Science Department, University of Bologna (July 2006), available at: http://matita.cs.unibo.it/

Download references

Author information

Authors and Affiliations

  1. LIP6/Paris 6, Paris, France

    Richard Bonichon

  2. CEDRIC/CNAM, Paris, France

    David Delahaye

  3. INRIA, Rocquencourt, France

    Damien Doligez

Authors
  1. Richard Bonichon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Delahaye
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Damien Doligez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Nachum Dershowitz Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonichon, R., Delahaye, D., Doligez, D. (2007). Zenon: An Extensible Automated Theorem Prover Producing Checkable Proofs. In: Dershowitz, N., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2007. Lecture Notes in Computer Science(), vol 4790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75560-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75560-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75558-6

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation