An Automation-Friendly Set Theory for the B Method - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

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 poly-morphic 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).
Fichier principal
Vignette du fichier
bset-auto.pdf (343.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02082755 , version 1 (28-03-2019)



Guillaume Bury, Simon Cruanes, David Delahaye, Pierre-Louis Euvrard. An Automation-Friendly Set Theory for the B Method. ABZ 2018 - 6th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z, Jun 2018, Southampton, United Kingdom. pp.409-414, ⟨10.1007/978-3-319-91271-4_32⟩. ⟨hal-02082755⟩
108 View
92 Download



Gmail Facebook Twitter LinkedIn More