Separation logic : expressiveness, complexity, temporal extension

Abstract : This thesis studies logics which express properties on programs. These logics were originally intended for the formal verification of programs with pointers. Overall, no automated verification method will be proved tractable here- rather, we give a new insight on separation logic. The complexity and decidability of some essential fragments of this logic for Hoare triples were not known before this work. Also, its combination with some other verification methods was little studied. Firstly, in this work we isolate the operator of separation logic which makes it undecidable. We describe the expressive power of this logic, comparing it to second-order logics. Secondly, we try to extend decidable subsets of separation logic with a temporal logic, and with the ability to describe data. This allows us to give boundaries to the use of separation logic. In particular, we give boundaries to the creation of decidable logics using this logic combined with a temporal logic or with the ability to describe data.
Document type :
Complete list of metadatas

Cited literature [92 references]  Display  Hide  Download
Contributor : Abes Star <>
Submitted on : Thursday, March 6, 2014 - 7:41:10 PM
Last modification on : Thursday, January 11, 2018 - 6:20:13 AM
Long-term archiving on: Friday, June 6, 2014 - 11:50:13 AM


Version validated by the jury (STAR)


  • HAL Id : tel-00956587, version 1



Rémi Brochenin. Separation logic : expressiveness, complexity, temporal extension. Other [cs.OH]. École normale supérieure de Cachan - ENS Cachan, 2013. English. ⟨NNT : 2013DENS0033⟩. ⟨tel-00956587⟩



Record views


Files downloads