Verifying B Proof Rules using Deep Embedding and Automated Theorem Proving - Archive ouverte HAL Access content directly
Journal Articles Software Engineering and Formal Methods Year : 2011

Verifying B Proof Rules using Deep Embedding and Automated Theorem Proving

Abstract

We propose a formal and mechanized framework which consists in verifying proof rules of the B method, which cannot be automatically proved by the elementary prover of Atelier B and using an external automated theorem prover called Zenon. This framework contains in particular a set of tools, named BCARe and developed by Siemens SAS I MO, which relies on a deep embedding of the B theory within the logic of the Coq proof assistant and allows us to automatically generate the required properties to be checked for a given proof rule. Currently, this tool chain is able to automatically verify a part of the derived rules of the B-Book, as well as some added rules coming from Atelier B and the rule database maintained by Siemens SAS I MO.

Dates and versions

hal-00722373 , version 1 (01-08-2012)

Identifiers

Cite

Mélanie Jacquel, Karim Berkani, David Delahaye, Catherine Dubois. Verifying B Proof Rules using Deep Embedding and Automated Theorem Proving. Software Engineering and Formal Methods, 2011, 7041, pp.253-268. ⟨10.1007/978-3-642-24690-6_18⟩. ⟨hal-00722373⟩
129 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More