A Certified Procedure for RL Verification - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

A Certified Procedure for RL Verification

(1) , (2, 3) , (4) , (1)
1
2
3
4

Abstract

Proving programs correct is hard. During the last decades computer scientists developed various logics dedicated to program verification. One such effort is Reachability Logic (RL): 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 (i.e., an insufficient assumption, implicit hypotheses, and a missing case in the paper proof). The Coq formalisation provides us with a certified program-verification procedure.
Fichier principal
Vignette du fichier
synasc2017.pdf (374.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01627517 , version 1 (01-11-2017)

Identifiers

Cite

Andrei Arusoaie, David Nowak, Vlad Rusu, Dorel Lucanu. A Certified Procedure for RL Verification. SYNASC 2017 : 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Sep 2017, Timisoara, Romania. pp.8, ⟨10.1109/SYNASC.2017.00031⟩. ⟨hal-01627517⟩
308 View
328 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More