Integration of SMT-solvers in B and Event-B development environments

Software development in B and Event-B generates proof obligations that have to be discharged using theorem provers. The cost of such developments depends directly on the degree of automation and efficiency of theorem proving techniques for the logics in which these lemmas are expressed. This paper presents and formalizes an approach to transform a class of proof obligations essentially similar to those generated in the Rodin platform into the input language of a category of automatic theorem provers known as SMT-solvers. The work presented in the paper handles proof obligations with Booleans, integer arithmetics, basic sets and relations and has been implemented as a plug-in for Rodin.

► We formalize a class of proof obligations generated in B and Event-B developments.
► We formalize the translation of such proof obligations to the SMT-LIB format.
► SMT-solvers are evaluated experimentally as provers in formal development.
► Fragments of the specification logic are handled effectively with automated provers.