An Automation-Friendly Set Theory for the B Method
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).
KeywordsB method Set theory Automated deduction Polymorphic types Rewriting
- 3.Bury, G., Delahaye, D., Doligez, D., Halmagrand, P., Hermant, O.: Automated deduction in the B set theory using typed proof search and deduction modulo. In: Fehnker, A., McIver, A., Sutcliffe, G., Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence and Reasoning (LPAR) - Short Presentations, vol. 35, pp. 42–58. EasyChair, Suva (Fiji), November 2015Google Scholar
- 4.Delahaye, D., Dubois, C., Marché, C., Mentré, D.: The BWare project: building a proof platform for the automated verification of B proof obligations. In: Ameur, Y.A., Schewe, K.-D. (eds.) ABZ 2014. LNCS, vol. 8477, pp. 126–127. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-43652-3_26CrossRefGoogle Scholar