Verifying a Concurrent Garbage Collector using a Rely-Guarantee Methodology - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Verifying a Concurrent Garbage Collector using a Rely-Guarantee Methodology

Résumé

Concurrent garbage collection algorithms are an emblematic challenge in the area of concurrent program verification. In this paper, we address this problem by proposing a mechanized proof methodology based on the popular Rely-Guarantee (RG) proof technique. We design a specific compiler intermediate representation (IR) with strong type guarantees, dedicated support for abstract concurrent data structures, and high-level iterators on runtime internals. In addition, we define an RG program logic supporting an incremental proof methodology where annotations and invariants can be progressively enriched. We formalize the IR, the proof system, and prove the soundness of the methodology in the Coq proof assistant. Equipped with this IR, we prove a fully concurrent garbage collector where mutators never have to wait for the collector.

Domaines

Informatique
Fichier principal
Vignette du fichier
itp17.pdf (311.57 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01613389 , version 1 (11-10-2017)

Identifiants

Citer

Yannick Zakowski, David Cachera, Delphine Demange, Gustavo Petri, David Pichardie, et al.. Verifying a Concurrent Garbage Collector using a Rely-Guarantee Methodology. ITP 2017 - 8th International Conference on Interactive Theorem Proving, Sep 2017, Brasília, Brazil. pp.496-513, ⟨10.1007/978-3-319-66107-0_31⟩. ⟨hal-01613389⟩
608 Consultations
316 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More