A Certified Procedure for RL Verification

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.
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01627517
Contributor : Pal Dream <>
Submitted on : Wednesday, November 1, 2017 - 9:25:16 PM
Last modification on : Wednesday, November 20, 2019 - 5:29:15 PM
Long-term archiving on : Friday, February 2, 2018 - 12:55:51 PM

File

synasc2017.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

374

Files downloads

347