Zenon

Zenon: An extensible automated theorem prover producing checkable proofs 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.


References in zbMATH (referenced in 18 articles , 2 standard articles )

Showing results 1 to 18 of 18.
Sorted by year (citations)

  1. Gilbert, Frédéric: Automated constructivization of proofs (2017)
  2. Cauderlier, Raphaël; Dubois, Catherine: ML pattern-matching, recursion, and rewriting: from focalize to dedukti (2016)
  3. Dubois, Catherine; Pessaux, François: Termination proofs for recursive functions in FoCaLiZe (2016)
  4. Halmagrand, Pierre: Soundly proving B method formulæusing typed sequent calculus (2016)
  5. Bury, Guillaume; Delahaye, David: Integrating simplex with tableaux (2015)
  6. Delahaye, David; Doligez, Damien; Gilbert, Frédéric; Halmagrand, Pierre; Hermant, Olivier: Zenon modulo: when Achilles outruns the tortoise using deduction modulo (2013)
  7. Jacquel, Mélanie; Berkani, Karim; Delahaye, David; Dubois, Catherine: Tableaux modulo theories using superdeduction. An application to the verification of B proof rules with the Zenon automated theorem prover (2012)
  8. Merz, Stephan; Vanzetto, Hernán: Automatic verification of TLA$^ + $ proof obligations with SMT solvers (2012)
  9. Jacquel, Mélanie; Berkani, Karim; Delahaye, David; Dubois, Catherine: Verifying B proof rules using deep embedding and automated theorem proving (2011)
  10. Chaudhuri, Kaustuv; Doligez, Damien; Lamport, Leslie; Merz, Stephan: Verifying safety properties with the TLA$^ + $ proof system (2010) ioport
  11. Hermant, Olivier: Resolution is cut-free (2010)
  12. Lescuyer, Stéphane; Conchon, Sylvain: Improving Coq propositional reasoning using a lazy CNF conversion scheme (2009)
  13. Rioboo, Renaud: Invariants for the FoCaL language (2009)
  14. Sutcliffe, Geoff: The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0 (2009)
  15. Bezem, Marc; Hendriks, Dimitri: On the mechanization of the proof of Hessenberg’s theorem in coherent logic (2008)
  16. Carlier, Matthieu; Dubois, Catherine: Functional testing in the focal environment (2008)
  17. Delahaye, David; Étienne, Jean-Frédéric; Donzeau-Gouge, Véronique Viguié: A formal and sound transformation from focal to UML: an application to airport security regulations (2008) ioport
  18. Bonichon, Richard; Delahaye, David; Doligez, Damien: Zenon: An extensible automated theorem prover producing checkable proofs (2007)