Discharging proof obligations from atelier b using multiple automated provers

Authors:
David Mentré;Claude Marché;Jean-Christophe Filliâtre;Masashi Asuka
Affiliations:
Mitsubishi Electric R&D Centre Europe, Rennes, France;INRIA Saclay --- Île-de-France, Orsay, France,Lab. de Recherche en Informatique, Univ Paris-Sud, CNRS, Orsay, France;Lab. de Recherche en Informatique, Univ Paris-Sud, CNRS, Orsay, France,INRIA Saclay --- Île-de-France, Orsay, France;Advanced Technology R&D Center, Mitsubishi Electric Corp., Amagasaki, Japan
Venue:
ABZ'12 Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z
Year:
2012

Citing 8
Cited 1

The B-book: assigning programs to meanings

The B-book: assigning programs to meanings
Météor: A Successful Application of B in a Large Project

FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
CC(X): Semantic Combination of Congruence Closure with Solvable Theories

Electronic Notes in Theoretical Computer Science (ENTCS)
CVC3

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Expressing polymorphic types in a many-sorted language

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Verifying B proof rules using deep embedding and automated theorem proving

SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Using b as a high level programming language in an industrial project: roissy VAL

ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B

One logic to use them all

CADE'13 Proceedings of the 24th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method to discharge proof obligations from Atelier B using multiple SMT solvers. It is based on a faithful modeling of B's set theory into polymorphic first-order logic. We report on two case studies demonstrating a significant improvement in the ratio of obligations that are automatically discharged.