The Matrix Reproved - ANR - Agence nationale de la recherche Accéder directement au contenu
Article Dans Une Revue Journal of Automated Reasoning Année : 2018

The Matrix Reproved

Résumé

In this paper we describe a complete solution for the first challenge of the VerifyThis 2016 competition held at the 18th ETAPS Forum. We present the proof of two variants for the multiplication of matrices: a naive version using three nested loops and Strassen's algorithm. The proofs are conducted using the Why3 platform for deductive program verification and automated theorem provers to discharge proof obligations. In order to specify and prove the two multiplication algorithms, we develop a new Why3 theory of matrices. In order to prove the matrix identities on which Strassen's algorithm is based, we apply the proof by reflection methodology, which we implement using ghost state.To our knowledge, this is the first time such a methodology is used under an auto-active setting.
Fichier principal
Vignette du fichier
main.pdf (301.97 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01617437 , version 1 (16-10-2017)

Identifiants

Citer

Martin Clochard, Léon Gondelman, Mário Pereira. The Matrix Reproved: Verification Pearl. Journal of Automated Reasoning, 2018, 60 (3), pp.365-383. ⟨10.1007/s10817-017-9436-2⟩. ⟨hal-01617437⟩
274 Consultations
233 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More