Développement prouvé de structures de données sans verrou

Loïc Fejoz 1
1 MOSEL - Proof-oriented development of computer-based systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The central topic of this thesis is the proof-based development of lock-free data-structure algorithms. First motivation comes from new computer architectures that come with new synchronisation features. Those features enable concurrent algorithms that do not use locks and are thus more efficient. The second motivation is the search for proved correct program. Nowadays embedded software are used everywhere included in systems where safety is central. We propose a refinement-based method for designing and verifying non-blocking, and in particular lock-free, implementations of data structures. The entire method has been formalised in Isabelle/HOL. An associated prototype tool generates verification conditions that can be solved by SMT solvers or automatic theorem provers for first-order logic, and we have used this approach to verify a number of such algorithms.
Complete list of metadatas

Cited literature [79 references]  Display  Hide  Download

Contributor : Loïc Fejoz <>
Submitted on : Monday, May 23, 2011 - 8:50:17 AM
Last modification on : Monday, April 16, 2018 - 10:41:47 AM
Long-term archiving on : Wednesday, August 24, 2011 - 2:22:50 AM


  • HAL Id : tel-00594978, version 1


Loïc Fejoz. Développement prouvé de structures de données sans verrou. Modélisation et simulation. Université Henri Poincaré - Nancy I, 2008. Français. ⟨NNT : 2009NAN10022⟩. ⟨tel-00594978⟩



Record views


Files downloads