Abstract
Formal development in Event-B generally requires the validation of a large number of proof obligations. Some automatic tools exist to automatically discharge a significant part of them, thus augmenting the efficiency of the formal development. We here investigate the use of SMT (Satisfiability Modulo Theories) solvers in addition to the traditional tools, and detail the techniques used for the cooperation between the Rodin platform and SMT solvers. Our contribution is the definition of two approaches to use SMT solvers, their implementation in a Rodin plug-in, and an experimental evaluation on a large sample of industrial and academic projects. Adding SMT solvers to Atelier B provers reduces to one fourth the number of sequents that need to be proved interactively. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Déharbe, D., Fontaine, P., Guyot, Y., & Voisin, L. (2012). SMT solvers for Rodin. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7316 LNCS, pp. 194–207). https://doi.org/10.1007/978-3-642-30885-7_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
