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

@inproceedings{Bury2015AutomatedDI,
  title={Automated Deduction in the B Set Theory using Typed Proof Search and Deduction Modulo},
  author={Guillaume Bury and D. Delahaye and Damien Doligez and Pierre Halmagrand and O. Hermant},
  booktitle={LPAR},
  year={2015}
}
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… Expand
Soundly Proving B Method Formulæ Using Typed Sequent Calculus
SMT Solving Modulo Tableau and Rewriting Theories
Integrating rewriting, tableau and superposition into SMT
An Automation-Friendly Set Theory for the B Method
Implementing Polymorphism in Zenon
Linking Focusing and Resolution with Selection
  • G. Burel
  • Computer Science, Mathematics
  • ACM Trans. Comput. Log.
  • 2020
Linking Focusing and Resolution with Selection
Interactive Theorem Proving
...
1
2
...

References

SHOWING 1-10 OF 45 REFERENCES
Zenon Modulo: When Achilles Outruns the Tortoise Using Deduction Modulo
Theorem Proving Modulo
Checking Zenon Modulo Proofs in Dedukti
The -calculus Modulo as a Universal Proof Language
TaMeD: A Tableau Method for Deduction Modulo
Regaining cut admissibility in deduction modulo using abstract completion
Cut Admissibility by Saturation
  • G. Burel
  • Mathematics, Computer Science
  • RTA-TLCA
  • 2014
Encoding Monomorphic and Polymorphic Types
A Calculus for Type Predicates and Type Coercion
...
1
2
3
4
5
...