# An Automation-Friendly Set Theory for the B Method

@inproceedings{Bury2018AnAS, title={An Automation-Friendly Set Theory for the B Method}, author={Guillaume Bury and Simon Cruanes and D. Delahaye and Pierre-Louis Euvrard}, booktitle={ABZ}, year={2018} }

We propose an automation-friendly set theory for the B method. This theory is expressed using first order logic extended to polymorphic types and rewriting. Rewriting is introduced along the lines of deduction modulo theory, where axioms are turned into rewrite rules over both propositions and terms. We also provide experimental results of several tools able to deal with polymorphism and rewriting over a benchmark of problems in pure set theory (i.e. without arithmetic).

#### 3 Citations

First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice

- Computer Science
- Journal of Automated Reasoning
- 2019

This work describes two automated reasoning systems that have been built to extend other provers with Deduction modulo theory and describes the two backends of these systems to the Dedukti universal proof checker, which allows us to verify the proofs produced by these tools. Expand

Proof Automation in the Theory of Finite Sets and Finite Set Relation Algebra

- Mathematics, Computer Science
- ArXiv
- 2021

This work presents a prototype interactive theorem prover (ITP), called {log}-ITP, providing evidence that a proper integration of{log} into world-class ITP's can deliver a great deal of proof automation concerning FSTRA. Expand

Integrating rewriting, tableau and superposition into SMT

- Computer Science
- 2019

This PhD thesis presents ArchSAT, an automated theorem prover with formal proof outputs, which is used to study the integration of some first-order reasoning methods into SMT solvers to speed up reasoning on problems whose axioms can be turned into rewrite rules. Expand

#### References

SHOWING 1-5 OF 5 REFERENCES

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

- Computer Science
- LPAR
- 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… Expand

Theorem Proving Modulo

- Mathematics, Computer Science
- Journal of Automated Reasoning
- 2004

This paper defines a sequent calculus modulo that gives a proof-theoretic account of the combination of computations and deductions and gives a complete proof search method, called extended narrowing and resolution (ENAR), for theorem proving modulo such congruences. Expand

TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism

- Computer Science
- CADE
- 2013

The TFF1 format is introduced, an extension of TFF0 with rank-1 polymorphism, designed to be easy to process by existing reasoning tools that support ML-style polymorphism. Expand

The BWare Project: Building a Proof Platform for the Automated Verification of B Proof Obligations

- Computer Science
- ABZ
- 2014

We introduce BWare, an industrial research project that aims to provide a mechanized framework to support the automated verification of proof obligations coming from the development of industrial… Expand

The B-book - assigning programs to meanings

- Computer Science
- 1996

Tribute Foreword Introduction Part I. Mathematics: 1. Mathematical reasoning 2. Set notation 3. Mathematical objects Part II. Abstract Machines: 4. Introduction to abstract machines 5. Formal… Expand