Verifying a Concurrent Garbage Collector with a Rely-Guarantee Methodology - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Automated Reasoning Année : 2018

Verifying a Concurrent Garbage Collector with a Rely-Guarantee Methodology

Résumé

Concurrent garbage collection algorithms are a challenge for program verification. In this paper, we address this problem by proposing a mechanized proof methodology based on the Rely-Guarantee proof technique. We design a compiler intermediate representation with strong type guarantees, dedicated support for abstract concurrent data structures, and high-level iterators on runtime internals. In addition, we define an Rely-Guarantee program logic supporting an incremental proof methodology where annotations and invariants can be progressively enriched. We formalize the intermediate representation, the proof system, and prove the soundness of the methodology in the Coq proof assistant. Equipped with this, we prove a fully concurrent garbage collector where mutators never have to wait for the collector.
Fichier principal
Vignette du fichier
jar18.pdf (454.81 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01897251 , version 1 (17-10-2018)

Identifiants

Citer

Yannick Zakowski, David Cachera, Delphine Demange, Gustavo Petri, David Pichardie, et al.. Verifying a Concurrent Garbage Collector with a Rely-Guarantee Methodology. Journal of Automated Reasoning, 2018, ⟨10.1007/s10817-018-9489-x⟩. ⟨hal-01897251⟩
195 Consultations
310 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More