Soundly Proving B Method Formulae Using Typed Sequent Calculus - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Soundly Proving B Method Formulae Using Typed Sequent Calculus

Abstract

The B Method is a formal method mainly used in the railway industry to specify and develop safety-critical software. To guarantee the consistency of a B project, one decisive challenge is to show correct a large amount of proof obligations, which are mathematical formulae expressed in a classical set theory extended with a specific type system. To improve automated theorem proving in the B Method, we propose to use a first-order sequent calculus extended with a polymorphic type system, which is in particular the output proof-format of the tableau-based automated theorem prover Zenon. After stating some modifications of the B syntax and defining a sound elimination of comprehension sets, we propose a translation of B formulae into a polymorphic first-order logic format. Then, we introduce the typed sequent calculus used by Zenon, and show that Zenon proofs can be translated to proofs of the initial B formulae in the B proof system.
Fichier principal
Vignette du fichier
ictac-34.pdf (515.12 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01342849 , version 1 (06-07-2016)

Licence

Identifiers

Cite

Pierre Halmagrand. Soundly Proving B Method Formulae Using Typed Sequent Calculus. 13th International Colloquium on Theoretical Aspects of Computing (ICTAC), Oct 2016, Taipei, Taiwan. pp 196-213, ⟨10.1007/978-3-319-46750-4_12⟩. ⟨hal-01342849⟩
560 View
101 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More