Formal Proof of Soundness for an RL Prover - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Technical Report) Year : 2015

Formal Proof of Soundness for an RL Prover

La preuve formelle de la correction pour un demonstrateur RL


Proving programs correct is one of the major challenges that computer scientists have been struggling with during the last decades. For this purpose, Reachability Logic (RL) was proposed as a language-parametric generalisation of Hoare Logic. Recently, based on RL, an automatic verification procedure was given and proved sound. In this paper we generalise this procedure and prove its soundness formally in the Coq proof assistant. For the formalisation we had to deal with all the minutiae that were neglected in the paper proof. The trickiest one was appropriate renaming of free variables which, we discovered, was handled in the paper proof using an insufficient assumption. We also discovered a missing case in the paper proof, and we clarified some implicit and hidden hypotheses. Last but not least, the Coq formalisation provides us with a certified program-verification procedure.
Fichier principal
Vignette du fichier
RR-471.pdf (1015.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01244578 , version 1 (15-12-2015)


  • HAL Id : hal-01244578 , version 1


Andrei Arusoaie, David Nowak, Vlad Rusu, Dorel Lucanu. Formal Proof of Soundness for an RL Prover. [Technical Report] RR-0471, INRIA Lille - Nord Europe; Alexandru Ioan Cuza, University of Iasi. 2015, pp.27. ⟨hal-01244578⟩
220 View
189 Download


Gmail Facebook Twitter LinkedIn More