Skip to Main content Skip to Navigation

Logique de séparation et vérification déductive

Abstract : This thesis comes within the domain of proofs of programs by deductive verification. The deductive verification generates from a program source and its specification a mathematical formula whose validity proves that the program follows its specification. The program source describes what the program does and its specification represents what the program should do. The validity of the formula is mainly verified by automatic provers. During the last ten years separation logic has shown to be an elegant way to deal with programs which use data-structures with pointers. However it requires a specific logical language, provers, and specific reasoning techniques.This thesis introduces a technique to express ideas from separation logic in the traditional framework of deductive verification. Unfortunately the mathematical formulas produced are not in the same first-order logic than the ones of provers. Thus this work defines new conversions between the polymorphic first-order logic and the many-sorted logic used by most proves.The first part of this thesis leads to an implementation in the Jessietool. The second part results in an important participation to the writing of the Why3 tool, in particular in the architecture and writing of the transformations which implement these conversions.
Document type :
Complete list of metadata

Cited literature [59 references]  Display  Hide  Download
Contributor : ABES STAR :  Contact
Submitted on : Thursday, December 15, 2011 - 5:22:16 PM
Last modification on : Sunday, June 26, 2022 - 11:55:04 AM
Long-term archiving on: : Friday, November 16, 2012 - 3:41:01 PM


Version validated by the jury (STAR)


  • HAL Id : tel-00652508, version 1



François Bobot. Logique de séparation et vérification déductive. Autre [cs.OH]. Université Paris Sud - Paris XI, 2011. Français. ⟨NNT : 2011PA112332⟩. ⟨tel-00652508⟩



Record views


Files downloads