Vérification par model-checking de programmes concurrents paramétrés sur des modèles mémoires faibles

Abstract : Modern multiprocessors and microprocesseurs implement weak or relaxed memory models, in which the apparent order of memory operation does not follow the sequential consistency (SC) proposed by Leslie Lamport. Any concurrent program running on such architecture and designed with an SC model in mind may exhibit new behaviors during its execution, some of which may potentially be incorrect. For instance, a mutual exclusion algorithm, correct under an interleaving semantics, may no longer guarantee mutual exclusion when implemented on a weaker architecture. Reasoning about the semantics of such programs is a difficult task. Moreover, most concurrent algorithms are designed for an arbitrary number of processus. We would like to ensure the correctness of concurrent algorithms, regardless of the number of processes involved. For this purpose, we rely on the Model Checking Modulo Theories (MCMT) framework, developed by Ghilardi and Ranise, which allows for the verification of safety properties of parameterized concurrent programs, that is to say, programs involving an arbitrary number of processes. We extend this technology with a theory for reasoning about weak memory models. The result of this work is an extension of the Cubicle model checker called Cubicle-W, which allows the verification of safety properties of parameterized transition systems running under a weak memory model similar to TSO.
Document type :
Theses
Complete list of metadatas

Cited literature [118 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01900842
Contributor : Abes Star <>
Submitted on : Monday, October 22, 2018 - 2:59:06 PM
Last modification on : Tuesday, April 16, 2019 - 9:30:46 AM
Long-term archiving on : Wednesday, January 23, 2019 - 3:06:59 PM

File

76312_DECLERCK_2018_archivage....
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01900842, version 1

Citation

David Declerck. Vérification par model-checking de programmes concurrents paramétrés sur des modèles mémoires faibles. Langage de programmation [cs.PL]. Université Paris-Saclay, 2018. Français. ⟨NNT : 2018SACLS336⟩. ⟨tel-01900842⟩

Share

Metrics

Record views

198

Files downloads

72