Automated Deduction in the B Set Theory using Typed Proof Search and Deduction Modulo

Guillaume Bury (1) , David Delahaye (1) , Damien Doligez (2) , Pierre Halmagrand (1, 3) , Olivier Hermant (4)

1 CEDRIC - Centre d'études et de recherche en informatique et communications
2 GALLIUM - Programming languages, types, compilation and proofs
3 DEDUCTEAM - Deduction modulo, interopérabilité et démonstration automatique
4 CRI - Centre de Recherche en Informatique

We introduce an encoding of the set theory of the B method using polymorphic types and deduction modulo, which is used for the automated verication of proof obligations in the framework of theBWare project. Deduction modulo is an extension of predicate calculus with rewriting both on terms and propositions. It is well suited for proof search in theories because it turns many axioms into rewrite rules. We also present the associated automated theorem prover Zenon Modulo, an extension of Zenon to polymorphic types and deduction modulo, along with its backend to the Dedukti universal proof checker, which also relies on types and deduction modulo, and which allows us to verify the proofs produced by Zenon Modulo. Finally, we assess our approach over the proof obligation benchmark of BWare.

Mots clés: Automated Deduction; Set Theory; B Method; Typed Proof Search; Deduction Modulo; Zenon Modulo; Dedukti

Domaines: Informatique [cs]; Langage de programmation [cs.PL]

Guillaume Bury, David Delahaye, Damien Doligez, Pierre Halmagrand, Olivier Hermant. Automated Deduction in the B Set Theory using Typed Proof Search and Deduction Modulo. LPAR 20 : 20th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Nov 2015, Suva, Fiji. pp 42-58. ⟨hal-01204701v2⟩